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/loop-lit/gj2007.c.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:52:51,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:52:51,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:52:51,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:52:51,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:52:51,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:52:51,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:52:51,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:52:51,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:52:51,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:52:51,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:52:51,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:52:51,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:52:51,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:52:51,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:52:51,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:52:51,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:52:51,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:52:51,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:52:51,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:52:51,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:52:51,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:52:51,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:52:51,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:52:51,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:52:51,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:52:51,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:52:51,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:52:51,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:52:51,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:52:51,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:52:51,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:52:51,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:52:51,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:52:51,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:52:51,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:52:51,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:52:51,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:52:51,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:52:51,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:52:51,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:52:51,776 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-03 20:52:51,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:52:51,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:52:51,791 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:52:51,791 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:52:51,792 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:52:51,792 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:52:51,792 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:52:51,792 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:52:51,792 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:52:51,793 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:52:51,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:52:51,793 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:52:51,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:52:51,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:52:51,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:52:51,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:52:51,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:52:51,795 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:52:51,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:52:51,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:52:51,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:52:51,795 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:52:51,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:52:51,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:52:51,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:52:51,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:52:51,796 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:52:51,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:52:51,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:52:51,797 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:52:51,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:52:51,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:52:51,854 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:52:51,856 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:52:51,856 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:52:51,857 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-09-03 20:52:51,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46878d9c/0fb792259e3249449f7a921690292c8c/FLAG1142b993d [2019-09-03 20:52:52,386 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:52:52,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-09-03 20:52:52,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46878d9c/0fb792259e3249449f7a921690292c8c/FLAG1142b993d [2019-09-03 20:52:52,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46878d9c/0fb792259e3249449f7a921690292c8c [2019-09-03 20:52:52,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:52:52,782 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:52:52,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:52,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:52:52,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:52:52,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:52" (1/1) ... [2019-09-03 20:52:52,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2088cf83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:52, skipping insertion in model container [2019-09-03 20:52:52,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:52" (1/1) ... [2019-09-03 20:52:52,798 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:52:52,846 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:52:53,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:53,354 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:52:53,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:53,431 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:52:53,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:53 WrapperNode [2019-09-03 20:52:53,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:53,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:52:53,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:52:53,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:52:53,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:53" (1/1) ... [2019-09-03 20:52:53,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:53" (1/1) ... [2019-09-03 20:52:53,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:53" (1/1) ... [2019-09-03 20:52:53,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:53" (1/1) ... [2019-09-03 20:52:53,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:53" (1/1) ... [2019-09-03 20:52:53,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:53" (1/1) ... [2019-09-03 20:52:53,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:53" (1/1) ... [2019-09-03 20:52:53,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:52:53,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:52:53,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:52:53,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:52:53,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:53" (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-03 20:52:53,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:52:53,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:52:53,574 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:52:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:52:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:52:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:52:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:52:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:52:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:52:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:52:54,435 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:52:54,435 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 20:52:54,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:54 BoogieIcfgContainer [2019-09-03 20:52:54,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:52:54,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:52:54,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:52:54,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:52:54,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:52:52" (1/3) ... [2019-09-03 20:52:54,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1fdcfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:54, skipping insertion in model container [2019-09-03 20:52:54,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:53" (2/3) ... [2019-09-03 20:52:54,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1fdcfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:54, skipping insertion in model container [2019-09-03 20:52:54,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:54" (3/3) ... [2019-09-03 20:52:54,444 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2019-09-03 20:52:54,454 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:52:54,461 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:52:54,477 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:52:54,504 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:52:54,505 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:52:54,505 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:52:54,505 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:52:54,506 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:52:54,506 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:52:54,507 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:52:54,507 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:52:54,532 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-09-03 20:52:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:52:54,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:54,550 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] [2019-09-03 20:52:54,552 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:54,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:54,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1537709744, now seen corresponding path program 1 times [2019-09-03 20:52:54,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:54,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:54,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:54,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:54,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:54,777 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-03 20:52:54,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:54,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:52:54,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:54,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:52:54,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:52:54,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:52:54,803 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2019-09-03 20:52:55,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:55,286 INFO L93 Difference]: Finished difference Result 149 states and 282 transitions. [2019-09-03 20:52:55,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:52:55,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-03 20:52:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:55,309 INFO L225 Difference]: With dead ends: 149 [2019-09-03 20:52:55,309 INFO L226 Difference]: Without dead ends: 145 [2019-09-03 20:52:55,313 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-03 20:52:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-03 20:52:55,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-09-03 20:52:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-03 20:52:55,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-09-03 20:52:55,399 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 143 [2019-09-03 20:52:55,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:55,402 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-09-03 20:52:55,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:52:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-09-03 20:52:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:52:55,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:55,408 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] [2019-09-03 20:52:55,409 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:55,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:55,410 INFO L82 PathProgramCache]: Analyzing trace with hash 470480343, now seen corresponding path program 1 times [2019-09-03 20:52:55,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:55,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:55,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:55,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:55,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:55,545 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-03 20:52:55,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:55,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:52:55,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:55,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:52:55,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:52:55,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:52:55,549 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-09-03 20:52:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:56,103 INFO L93 Difference]: Finished difference Result 277 states and 345 transitions. [2019-09-03 20:52:56,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:52:56,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-03 20:52:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:56,106 INFO L225 Difference]: With dead ends: 277 [2019-09-03 20:52:56,106 INFO L226 Difference]: Without dead ends: 277 [2019-09-03 20:52:56,107 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-03 20:52:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-03 20:52:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2019-09-03 20:52:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-03 20:52:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2019-09-03 20:52:56,124 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 143 [2019-09-03 20:52:56,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:56,124 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 345 transitions. [2019-09-03 20:52:56,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:52:56,125 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 345 transitions. [2019-09-03 20:52:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:52:56,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:56,128 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:56,128 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:56,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:56,129 INFO L82 PathProgramCache]: Analyzing trace with hash 859387544, now seen corresponding path program 1 times [2019-09-03 20:52:56,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:56,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:56,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:56,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:56,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:56,314 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-03 20:52:56,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:56,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 20:52:56,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:56,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:52:56,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:52:56,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:56,316 INFO L87 Difference]: Start difference. First operand 277 states and 345 transitions. Second operand 7 states. [2019-09-03 20:52:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:57,082 INFO L93 Difference]: Finished difference Result 269 states and 333 transitions. [2019-09-03 20:52:57,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:52:57,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-03 20:52:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:57,085 INFO L225 Difference]: With dead ends: 269 [2019-09-03 20:52:57,085 INFO L226 Difference]: Without dead ends: 269 [2019-09-03 20:52:57,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:57,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-03 20:52:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-09-03 20:52:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-03 20:52:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2019-09-03 20:52:57,106 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 143 [2019-09-03 20:52:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:57,107 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2019-09-03 20:52:57,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:52:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2019-09-03 20:52:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:52:57,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:57,113 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] [2019-09-03 20:52:57,113 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:57,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1284631305, now seen corresponding path program 1 times [2019-09-03 20:52:57,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:57,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:57,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:57,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:57,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:57,293 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-03 20:52:57,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:57,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-03 20:52:57,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:57,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:52:57,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:52:57,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:52:57,295 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 8 states. [2019-09-03 20:52:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:58,163 INFO L93 Difference]: Finished difference Result 267 states and 330 transitions. [2019-09-03 20:52:58,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:52:58,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2019-09-03 20:52:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:58,167 INFO L225 Difference]: With dead ends: 267 [2019-09-03 20:52:58,167 INFO L226 Difference]: Without dead ends: 267 [2019-09-03 20:52:58,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:52:58,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-03 20:52:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2019-09-03 20:52:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-03 20:52:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2019-09-03 20:52:58,178 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 143 [2019-09-03 20:52:58,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:58,179 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2019-09-03 20:52:58,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:52:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2019-09-03 20:52:58,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:52:58,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:58,181 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] [2019-09-03 20:52:58,182 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:58,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:58,182 INFO L82 PathProgramCache]: Analyzing trace with hash 698919756, now seen corresponding path program 1 times [2019-09-03 20:52:58,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:58,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:58,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:58,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:58,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:58,356 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-03 20:52:58,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:58,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-03 20:52:58,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:58,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:52:58,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:52:58,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:52:58,359 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand 9 states. [2019-09-03 20:52:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:59,113 INFO L93 Difference]: Finished difference Result 265 states and 327 transitions. [2019-09-03 20:52:59,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:52:59,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 143 [2019-09-03 20:52:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:59,115 INFO L225 Difference]: With dead ends: 265 [2019-09-03 20:52:59,116 INFO L226 Difference]: Without dead ends: 265 [2019-09-03 20:52:59,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:52:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-03 20:52:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2019-09-03 20:52:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-03 20:52:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2019-09-03 20:52:59,124 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 143 [2019-09-03 20:52:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:59,125 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2019-09-03 20:52:59,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:52:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2019-09-03 20:52:59,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:52:59,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:59,128 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:59,128 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:59,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:59,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2054450191, now seen corresponding path program 1 times [2019-09-03 20:52:59,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:59,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:59,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:59,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:59,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:59,309 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-03 20:52:59,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:59,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-03 20:52:59,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:59,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:52:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:52:59,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:59,312 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand 12 states. [2019-09-03 20:52:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:59,795 INFO L93 Difference]: Finished difference Result 259 states and 318 transitions. [2019-09-03 20:52:59,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:52:59,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2019-09-03 20:52:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:59,799 INFO L225 Difference]: With dead ends: 259 [2019-09-03 20:52:59,799 INFO L226 Difference]: Without dead ends: 259 [2019-09-03 20:52:59,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-03 20:52:59,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-09-03 20:52:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-03 20:52:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2019-09-03 20:52:59,807 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 143 [2019-09-03 20:52:59,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:59,807 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2019-09-03 20:52:59,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:52:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2019-09-03 20:52:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:52:59,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:59,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] [2019-09-03 20:52:59,810 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:59,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:59,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1013609311, now seen corresponding path program 1 times [2019-09-03 20:52:59,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:59,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:59,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:59,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:59,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:59,974 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-03 20:52:59,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:59,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-03 20:52:59,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:59,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:52:59,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:52:59,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:52:59,976 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand 14 states. [2019-09-03 20:53:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:00,951 INFO L93 Difference]: Finished difference Result 255 states and 312 transitions. [2019-09-03 20:53:00,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:53:00,952 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 143 [2019-09-03 20:53:00,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:00,954 INFO L225 Difference]: With dead ends: 255 [2019-09-03 20:53:00,955 INFO L226 Difference]: Without dead ends: 255 [2019-09-03 20:53:00,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:53:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-03 20:53:00,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-09-03 20:53:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-03 20:53:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2019-09-03 20:53:00,962 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 143 [2019-09-03 20:53:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:00,962 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2019-09-03 20:53:00,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:53:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2019-09-03 20:53:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:00,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:00,964 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] [2019-09-03 20:53:00,965 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash 560132216, now seen corresponding path program 1 times [2019-09-03 20:53:00,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:00,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:00,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:00,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:00,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:01,145 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-03 20:53:01,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:01,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-03 20:53:01,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:01,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:53:01,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:53:01,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:53:01,147 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 15 states. [2019-09-03 20:53:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:02,658 INFO L93 Difference]: Finished difference Result 253 states and 309 transitions. [2019-09-03 20:53:02,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:53:02,659 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 143 [2019-09-03 20:53:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:02,661 INFO L225 Difference]: With dead ends: 253 [2019-09-03 20:53:02,661 INFO L226 Difference]: Without dead ends: 253 [2019-09-03 20:53:02,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:53:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-03 20:53:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-09-03 20:53:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-03 20:53:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2019-09-03 20:53:02,669 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 143 [2019-09-03 20:53:02,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:02,670 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2019-09-03 20:53:02,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:53:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2019-09-03 20:53:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:02,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:02,672 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] [2019-09-03 20:53:02,672 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:02,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:02,673 INFO L82 PathProgramCache]: Analyzing trace with hash 752755852, now seen corresponding path program 1 times [2019-09-03 20:53:02,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:02,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:02,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:02,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:02,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:02,896 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-03 20:53:02,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:02,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-03 20:53:02,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:02,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:53:02,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:53:02,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:53:02,898 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand 17 states. [2019-09-03 20:53:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:04,556 INFO L93 Difference]: Finished difference Result 249 states and 303 transitions. [2019-09-03 20:53:04,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:53:04,557 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 143 [2019-09-03 20:53:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:04,559 INFO L225 Difference]: With dead ends: 249 [2019-09-03 20:53:04,559 INFO L226 Difference]: Without dead ends: 249 [2019-09-03 20:53:04,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:53:04,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-09-03 20:53:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-09-03 20:53:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-03 20:53:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2019-09-03 20:53:04,566 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 143 [2019-09-03 20:53:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:04,566 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2019-09-03 20:53:04,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:53:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2019-09-03 20:53:04,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:04,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:04,569 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] [2019-09-03 20:53:04,569 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:04,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:04,569 INFO L82 PathProgramCache]: Analyzing trace with hash -553376648, now seen corresponding path program 1 times [2019-09-03 20:53:04,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:04,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:04,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:04,786 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-03 20:53:04,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:04,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-03 20:53:04,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:04,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:53:04,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:53:04,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:53:04,788 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand 19 states. [2019-09-03 20:53:05,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:05,504 INFO L93 Difference]: Finished difference Result 245 states and 297 transitions. [2019-09-03 20:53:05,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:53:05,508 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 143 [2019-09-03 20:53:05,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:05,510 INFO L225 Difference]: With dead ends: 245 [2019-09-03 20:53:05,510 INFO L226 Difference]: Without dead ends: 245 [2019-09-03 20:53:05,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:53:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-03 20:53:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-09-03 20:53:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-03 20:53:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 297 transitions. [2019-09-03 20:53:05,518 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 297 transitions. Word has length 143 [2019-09-03 20:53:05,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:05,519 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 297 transitions. [2019-09-03 20:53:05,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:53:05,519 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 297 transitions. [2019-09-03 20:53:05,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:05,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:05,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] [2019-09-03 20:53:05,522 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:05,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:05,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1465640920, now seen corresponding path program 1 times [2019-09-03 20:53:05,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:05,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:05,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:05,815 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-03 20:53:05,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:05,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-03 20:53:05,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:05,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:53:05,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:53:05,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:53:05,817 INFO L87 Difference]: Start difference. First operand 245 states and 297 transitions. Second operand 23 states. [2019-09-03 20:53:06,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:06,620 INFO L93 Difference]: Finished difference Result 237 states and 285 transitions. [2019-09-03 20:53:06,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:53:06,621 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 143 [2019-09-03 20:53:06,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:06,623 INFO L225 Difference]: With dead ends: 237 [2019-09-03 20:53:06,624 INFO L226 Difference]: Without dead ends: 237 [2019-09-03 20:53:06,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:53:06,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-03 20:53:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-09-03 20:53:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-09-03 20:53:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2019-09-03 20:53:06,631 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 143 [2019-09-03 20:53:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:06,631 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2019-09-03 20:53:06,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:53:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2019-09-03 20:53:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:06,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:06,633 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] [2019-09-03 20:53:06,634 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:06,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1149693335, now seen corresponding path program 1 times [2019-09-03 20:53:06,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:06,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:06,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:06,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:06,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:06,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:06,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-03 20:53:06,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:06,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:53:06,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:53:06,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:53:06,924 INFO L87 Difference]: Start difference. First operand 237 states and 285 transitions. Second operand 24 states. [2019-09-03 20:53:09,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:09,176 INFO L93 Difference]: Finished difference Result 235 states and 282 transitions. [2019-09-03 20:53:09,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:53:09,176 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 143 [2019-09-03 20:53:09,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:09,179 INFO L225 Difference]: With dead ends: 235 [2019-09-03 20:53:09,179 INFO L226 Difference]: Without dead ends: 235 [2019-09-03 20:53:09,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:53:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-03 20:53:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-09-03 20:53:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-03 20:53:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 282 transitions. [2019-09-03 20:53:09,186 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 282 transitions. Word has length 143 [2019-09-03 20:53:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:09,186 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 282 transitions. [2019-09-03 20:53:09,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:53:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 282 transitions. [2019-09-03 20:53:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:09,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:09,188 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] [2019-09-03 20:53:09,188 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:09,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:09,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1452778676, now seen corresponding path program 1 times [2019-09-03 20:53:09,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:09,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:09,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:09,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:09,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:09,518 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-03 20:53:09,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:09,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-03 20:53:09,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:09,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:53:09,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:53:09,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:53:09,520 INFO L87 Difference]: Start difference. First operand 235 states and 282 transitions. Second operand 25 states. [2019-09-03 20:53:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:10,421 INFO L93 Difference]: Finished difference Result 233 states and 279 transitions. [2019-09-03 20:53:10,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:53:10,422 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 143 [2019-09-03 20:53:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:10,424 INFO L225 Difference]: With dead ends: 233 [2019-09-03 20:53:10,424 INFO L226 Difference]: Without dead ends: 233 [2019-09-03 20:53:10,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:53:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-03 20:53:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-09-03 20:53:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-03 20:53:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 279 transitions. [2019-09-03 20:53:10,429 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 279 transitions. Word has length 143 [2019-09-03 20:53:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:10,430 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 279 transitions. [2019-09-03 20:53:10,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:53:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 279 transitions. [2019-09-03 20:53:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:10,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:10,431 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] [2019-09-03 20:53:10,431 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:10,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:10,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1738588719, now seen corresponding path program 1 times [2019-09-03 20:53:10,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:10,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:10,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:10,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:10,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:10,778 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-03 20:53:10,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:10,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-03 20:53:10,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:10,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:53:10,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:53:10,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:53:10,779 INFO L87 Difference]: Start difference. First operand 233 states and 279 transitions. Second operand 28 states. [2019-09-03 20:53:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:12,795 INFO L93 Difference]: Finished difference Result 227 states and 270 transitions. [2019-09-03 20:53:12,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:53:12,796 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 143 [2019-09-03 20:53:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:12,798 INFO L225 Difference]: With dead ends: 227 [2019-09-03 20:53:12,798 INFO L226 Difference]: Without dead ends: 227 [2019-09-03 20:53:12,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:53:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-03 20:53:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-03 20:53:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-03 20:53:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 270 transitions. [2019-09-03 20:53:12,805 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 270 transitions. Word has length 143 [2019-09-03 20:53:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:12,805 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 270 transitions. [2019-09-03 20:53:12,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:53:12,805 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2019-09-03 20:53:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:12,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:12,807 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] [2019-09-03 20:53:12,807 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:12,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:12,807 INFO L82 PathProgramCache]: Analyzing trace with hash -512972737, now seen corresponding path program 1 times [2019-09-03 20:53:12,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:12,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:12,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:12,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:12,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:13,280 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-03 20:53:13,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:13,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-03 20:53:13,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:13,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:53:13,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:53:13,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:53:13,282 INFO L87 Difference]: Start difference. First operand 227 states and 270 transitions. Second operand 30 states. [2019-09-03 20:53:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:15,807 INFO L93 Difference]: Finished difference Result 223 states and 264 transitions. [2019-09-03 20:53:15,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:53:15,807 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 143 [2019-09-03 20:53:15,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:15,809 INFO L225 Difference]: With dead ends: 223 [2019-09-03 20:53:15,809 INFO L226 Difference]: Without dead ends: 223 [2019-09-03 20:53:15,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:53:15,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-03 20:53:15,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-09-03 20:53:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-03 20:53:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2019-09-03 20:53:15,816 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 143 [2019-09-03 20:53:15,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:15,816 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2019-09-03 20:53:15,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:53:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2019-09-03 20:53:15,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:15,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:15,817 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] [2019-09-03 20:53:15,818 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:15,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:15,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1207573688, now seen corresponding path program 1 times [2019-09-03 20:53:15,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:15,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:15,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:15,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:15,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:16,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:16,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-03 20:53:16,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:16,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:53:16,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:53:16,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:53:16,243 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand 31 states. [2019-09-03 20:53:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:18,209 INFO L93 Difference]: Finished difference Result 221 states and 261 transitions. [2019-09-03 20:53:18,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:53:18,210 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 143 [2019-09-03 20:53:18,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:18,212 INFO L225 Difference]: With dead ends: 221 [2019-09-03 20:53:18,212 INFO L226 Difference]: Without dead ends: 221 [2019-09-03 20:53:18,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:53:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-03 20:53:18,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-09-03 20:53:18,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-03 20:53:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2019-09-03 20:53:18,220 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 143 [2019-09-03 20:53:18,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:18,221 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2019-09-03 20:53:18,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:53:18,221 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2019-09-03 20:53:18,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:18,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:18,222 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] [2019-09-03 20:53:18,223 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:18,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:18,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1520258956, now seen corresponding path program 1 times [2019-09-03 20:53:18,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:18,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:18,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:18,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:18,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:18,777 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-03 20:53:18,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:18,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-03 20:53:18,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:18,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:53:18,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:53:18,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:53:18,780 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand 33 states. [2019-09-03 20:53:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:21,467 INFO L93 Difference]: Finished difference Result 217 states and 255 transitions. [2019-09-03 20:53:21,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:53:21,468 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 143 [2019-09-03 20:53:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:21,470 INFO L225 Difference]: With dead ends: 217 [2019-09-03 20:53:21,470 INFO L226 Difference]: Without dead ends: 217 [2019-09-03 20:53:21,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:53:21,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-03 20:53:21,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-09-03 20:53:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-03 20:53:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 255 transitions. [2019-09-03 20:53:21,476 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 255 transitions. Word has length 143 [2019-09-03 20:53:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:21,476 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 255 transitions. [2019-09-03 20:53:21,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:53:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 255 transitions. [2019-09-03 20:53:21,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:21,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:21,478 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] [2019-09-03 20:53:21,478 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:21,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:21,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1702235704, now seen corresponding path program 1 times [2019-09-03 20:53:21,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:21,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:21,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:21,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:21,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:22,014 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-03 20:53:22,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:22,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-09-03 20:53:22,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:22,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:53:22,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:53:22,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:53:22,017 INFO L87 Difference]: Start difference. First operand 217 states and 255 transitions. Second operand 35 states. [2019-09-03 20:53:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:22,992 INFO L93 Difference]: Finished difference Result 213 states and 249 transitions. [2019-09-03 20:53:22,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:53:22,993 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 143 [2019-09-03 20:53:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:22,994 INFO L225 Difference]: With dead ends: 213 [2019-09-03 20:53:22,994 INFO L226 Difference]: Without dead ends: 213 [2019-09-03 20:53:22,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:53:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-03 20:53:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-09-03 20:53:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-03 20:53:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2019-09-03 20:53:23,000 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 143 [2019-09-03 20:53:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:23,001 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2019-09-03 20:53:23,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:53:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2019-09-03 20:53:23,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:23,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:23,002 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] [2019-09-03 20:53:23,002 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:23,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:23,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2011984104, now seen corresponding path program 1 times [2019-09-03 20:53:23,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:23,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:23,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:23,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:23,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:23,752 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-03 20:53:23,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:23,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2019-09-03 20:53:23,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:23,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:53:23,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:53:23,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:53:23,757 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand 39 states. [2019-09-03 20:53:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:25,561 INFO L93 Difference]: Finished difference Result 205 states and 237 transitions. [2019-09-03 20:53:25,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:53:25,562 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 143 [2019-09-03 20:53:25,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:25,564 INFO L225 Difference]: With dead ends: 205 [2019-09-03 20:53:25,564 INFO L226 Difference]: Without dead ends: 205 [2019-09-03 20:53:25,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:53:25,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-03 20:53:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-09-03 20:53:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-03 20:53:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 237 transitions. [2019-09-03 20:53:25,570 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 237 transitions. Word has length 143 [2019-09-03 20:53:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:25,570 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 237 transitions. [2019-09-03 20:53:25,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:53:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 237 transitions. [2019-09-03 20:53:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:25,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:25,571 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] [2019-09-03 20:53:25,572 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:25,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:25,572 INFO L82 PathProgramCache]: Analyzing trace with hash 221232183, now seen corresponding path program 1 times [2019-09-03 20:53:25,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:25,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:25,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:25,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:25,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:26,488 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-03 20:53:26,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:26,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-09-03 20:53:26,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:26,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 20:53:26,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 20:53:26,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:53:26,490 INFO L87 Difference]: Start difference. First operand 205 states and 237 transitions. Second operand 40 states. [2019-09-03 20:53:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:28,410 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2019-09-03 20:53:28,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 20:53:28,411 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 143 [2019-09-03 20:53:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:28,413 INFO L225 Difference]: With dead ends: 203 [2019-09-03 20:53:28,413 INFO L226 Difference]: Without dead ends: 203 [2019-09-03 20:53:28,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:53:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-03 20:53:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-09-03 20:53:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-03 20:53:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 234 transitions. [2019-09-03 20:53:28,418 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 234 transitions. Word has length 143 [2019-09-03 20:53:28,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:28,419 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 234 transitions. [2019-09-03 20:53:28,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 20:53:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 234 transitions. [2019-09-03 20:53:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:28,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:28,420 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] [2019-09-03 20:53:28,420 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:28,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:28,421 INFO L82 PathProgramCache]: Analyzing trace with hash 500367692, now seen corresponding path program 1 times [2019-09-03 20:53:28,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:28,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:28,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:28,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:28,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:29,279 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-03 20:53:29,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:29,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2019-09-03 20:53:29,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:29,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:53:29,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:53:29,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:53:29,283 INFO L87 Difference]: Start difference. First operand 203 states and 234 transitions. Second operand 41 states. [2019-09-03 20:53:31,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:31,138 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2019-09-03 20:53:31,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:53:31,138 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 143 [2019-09-03 20:53:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:31,140 INFO L225 Difference]: With dead ends: 201 [2019-09-03 20:53:31,140 INFO L226 Difference]: Without dead ends: 201 [2019-09-03 20:53:31,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:53:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-03 20:53:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-09-03 20:53:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-03 20:53:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2019-09-03 20:53:31,146 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 143 [2019-09-03 20:53:31,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:31,146 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2019-09-03 20:53:31,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:53:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2019-09-03 20:53:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:31,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:31,148 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] [2019-09-03 20:53:31,148 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:31,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:31,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1383526833, now seen corresponding path program 1 times [2019-09-03 20:53:31,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:31,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:31,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:31,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:31,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:31,911 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-03 20:53:31,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:31,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2019-09-03 20:53:31,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:31,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 20:53:31,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 20:53:31,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:53:31,913 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand 44 states. [2019-09-03 20:53:33,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:33,615 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2019-09-03 20:53:33,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:53:33,618 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 143 [2019-09-03 20:53:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:33,620 INFO L225 Difference]: With dead ends: 195 [2019-09-03 20:53:33,620 INFO L226 Difference]: Without dead ends: 195 [2019-09-03 20:53:33,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:53:33,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-03 20:53:33,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-09-03 20:53:33,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-03 20:53:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2019-09-03 20:53:33,624 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 143 [2019-09-03 20:53:33,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:33,625 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2019-09-03 20:53:33,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 20:53:33,625 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2019-09-03 20:53:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:33,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:33,626 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] [2019-09-03 20:53:33,626 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:33,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:33,627 INFO L82 PathProgramCache]: Analyzing trace with hash -595537121, now seen corresponding path program 1 times [2019-09-03 20:53:33,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:33,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:33,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:33,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:33,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:34,441 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-03 20:53:34,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:34,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2019-09-03 20:53:34,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:34,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 20:53:34,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 20:53:34,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:53:34,444 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand 46 states. [2019-09-03 20:53:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:35,773 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2019-09-03 20:53:35,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 20:53:35,773 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 143 [2019-09-03 20:53:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:35,778 INFO L225 Difference]: With dead ends: 191 [2019-09-03 20:53:35,778 INFO L226 Difference]: Without dead ends: 191 [2019-09-03 20:53:35,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:53:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-03 20:53:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-09-03 20:53:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-03 20:53:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2019-09-03 20:53:35,783 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 143 [2019-09-03 20:53:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:35,783 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2019-09-03 20:53:35,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 20:53:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2019-09-03 20:53:35,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:35,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:35,784 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] [2019-09-03 20:53:35,784 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:35,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:35,785 INFO L82 PathProgramCache]: Analyzing trace with hash -830587144, now seen corresponding path program 1 times [2019-09-03 20:53:35,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:35,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:35,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:35,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:35,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:37,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:37,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2019-09-03 20:53:37,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:37,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:53:37,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:53:37,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:53:37,010 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand 47 states. [2019-09-03 20:53:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:40,155 INFO L93 Difference]: Finished difference Result 189 states and 213 transitions. [2019-09-03 20:53:40,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:53:40,156 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 143 [2019-09-03 20:53:40,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:40,158 INFO L225 Difference]: With dead ends: 189 [2019-09-03 20:53:40,158 INFO L226 Difference]: Without dead ends: 189 [2019-09-03 20:53:40,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:53:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-03 20:53:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-09-03 20:53:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-03 20:53:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2019-09-03 20:53:40,163 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 143 [2019-09-03 20:53:40,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:40,163 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2019-09-03 20:53:40,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:53:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2019-09-03 20:53:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:40,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:40,164 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:40,165 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:40,165 INFO L82 PathProgramCache]: Analyzing trace with hash -228626292, now seen corresponding path program 1 times [2019-09-03 20:53:40,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:40,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:40,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:40,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:40,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:41,018 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-03 20:53:41,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:41,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2019-09-03 20:53:41,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:41,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:53:41,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:53:41,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:53:41,020 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand 49 states. [2019-09-03 20:53:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:43,230 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2019-09-03 20:53:43,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:53:43,230 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 143 [2019-09-03 20:53:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:43,232 INFO L225 Difference]: With dead ends: 185 [2019-09-03 20:53:43,233 INFO L226 Difference]: Without dead ends: 185 [2019-09-03 20:53:43,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:53:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-03 20:53:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-09-03 20:53:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-03 20:53:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2019-09-03 20:53:43,237 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 143 [2019-09-03 20:53:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:43,237 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2019-09-03 20:53:43,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:53:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2019-09-03 20:53:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:43,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:43,239 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] [2019-09-03 20:53:43,239 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:43,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:43,239 INFO L82 PathProgramCache]: Analyzing trace with hash 679538168, now seen corresponding path program 1 times [2019-09-03 20:53:43,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:43,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:43,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:43,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:43,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:44,148 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-03 20:53:44,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:44,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2019-09-03 20:53:44,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:44,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:53:44,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:53:44,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:53:44,152 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand 51 states. [2019-09-03 20:53:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:45,653 INFO L93 Difference]: Finished difference Result 181 states and 201 transitions. [2019-09-03 20:53:45,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:53:45,654 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 143 [2019-09-03 20:53:45,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:45,656 INFO L225 Difference]: With dead ends: 181 [2019-09-03 20:53:45,656 INFO L226 Difference]: Without dead ends: 181 [2019-09-03 20:53:45,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:53:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-03 20:53:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-09-03 20:53:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-03 20:53:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 201 transitions. [2019-09-03 20:53:45,661 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 201 transitions. Word has length 143 [2019-09-03 20:53:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:45,661 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 201 transitions. [2019-09-03 20:53:45,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:53:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 201 transitions. [2019-09-03 20:53:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:45,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:45,662 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] [2019-09-03 20:53:45,662 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:45,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:45,663 INFO L82 PathProgramCache]: Analyzing trace with hash -200266664, now seen corresponding path program 1 times [2019-09-03 20:53:45,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:45,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:45,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:46,750 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-03 20:53:46,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:46,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2019-09-03 20:53:46,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:46,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:53:46,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:53:46,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:53:46,753 INFO L87 Difference]: Start difference. First operand 181 states and 201 transitions. Second operand 53 states. [2019-09-03 20:53:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:47,767 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2019-09-03 20:53:47,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:53:47,767 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 143 [2019-09-03 20:53:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:47,769 INFO L225 Difference]: With dead ends: 147 [2019-09-03 20:53:47,769 INFO L226 Difference]: Without dead ends: 147 [2019-09-03 20:53:47,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:53:47,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-03 20:53:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-09-03 20:53:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-03 20:53:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-09-03 20:53:47,774 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2019-09-03 20:53:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:47,774 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-09-03 20:53:47,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:53:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-09-03 20:53:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:47,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:47,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] [2019-09-03 20:53:47,775 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:47,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:47,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1774383300, now seen corresponding path program 1 times [2019-09-03 20:53:47,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:47,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:47,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:47,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:47,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:49,755 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-03 20:53:49,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:49,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2019-09-03 20:53:49,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:49,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 20:53:49,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 20:53:49,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 20:53:49,758 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 70 states. [2019-09-03 20:53:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:51,741 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-09-03 20:53:51,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-03 20:53:51,741 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 143 [2019-09-03 20:53:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:51,743 INFO L225 Difference]: With dead ends: 147 [2019-09-03 20:53:51,743 INFO L226 Difference]: Without dead ends: 147 [2019-09-03 20:53:51,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 20:53:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-03 20:53:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-09-03 20:53:51,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-03 20:53:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-09-03 20:53:51,748 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-09-03 20:53:51,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:51,749 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-09-03 20:53:51,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 20:53:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-09-03 20:53:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-03 20:53:51,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:51,750 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] [2019-09-03 20:53:51,750 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:51,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:51,751 INFO L82 PathProgramCache]: Analyzing trace with hash -87860138, now seen corresponding path program 1 times [2019-09-03 20:53:51,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:51,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:51,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:53,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:53,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:53,671 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-03 20:53:53,673 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [15], [18], [22], [25], [29], [32], [36], [39], [43], [46], [50], [53], [57], [60], [64], [67], [71], [74], [78], [81], [85], [88], [92], [95], [99], [102], [106], [109], [113], [116], [120], [123], [127], [130], [134], [137], [141], [144], [148], [151], [155], [158], [162], [165], [169], [172], [176], [179], [183], [186], [190], [193], [197], [200], [204], [207], [211], [214], [218], [221], [225], [228], [232], [235], [239], [242], [246], [249], [253], [256], [260], [263], [267], [270], [274], [277], [281], [284], [288], [291], [295], [298], [302], [305], [309], [312], [316], [319], [323], [326], [330], [333], [337], [340], [344], [347], [351], [354], [358], [365], [372], [379], [386], [393], [400], [407], [414], [421], [428], [435], [442], [449], [456], [463], [470], [477], [483], [485], [488], [489], [492], [495], [498], [501], [504], [507], [510], [513], [516], [519], [522], [525], [528], [531], [534], [537], [540], [694], [695], [696] [2019-09-03 20:53:53,714 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:53:53,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:53:53,951 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:53:53,956 INFO L272 AbstractInterpreter]: Visited 145 different actions 165 times. Merged at 5 different actions 15 times. Widened at 1 different actions 2 times. Performed 298 root evaluator evaluations with a maximum evaluation depth of 4. Performed 298 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-09-03 20:53:53,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:53,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:53:53,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:53,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:53,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:53,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:54,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 20:53:54,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:54,196 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:57,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:57,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 102 [2019-09-03 20:53:57,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:57,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 20:53:57,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 20:53:57,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:53:57,939 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 71 states. [2019-09-03 20:54:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:00,866 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-09-03 20:54:00,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:54:00,866 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 145 [2019-09-03 20:54:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:00,868 INFO L225 Difference]: With dead ends: 149 [2019-09-03 20:54:00,868 INFO L226 Difference]: Without dead ends: 149 [2019-09-03 20:54:00,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 222 SyntacticMatches, 38 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1881 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-03 20:54:00,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-09-03 20:54:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-03 20:54:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-09-03 20:54:00,874 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2019-09-03 20:54:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:00,875 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-09-03 20:54:00,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 20:54:00,875 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-09-03 20:54:00,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-03 20:54:00,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:00,876 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-03 20:54:00,877 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:00,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:00,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1458227952, now seen corresponding path program 2 times [2019-09-03 20:54:00,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:00,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:00,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:00,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:00,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:02,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:02,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:02,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:02,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:02,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:02,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:02,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:02,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:02,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:54:02,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:02,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 20:54:02,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:02,994 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:06,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:06,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 102 [2019-09-03 20:54:06,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:06,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 20:54:06,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 20:54:06,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:06,230 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 72 states. [2019-09-03 20:54:09,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:09,319 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-09-03 20:54:09,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 20:54:09,325 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 147 [2019-09-03 20:54:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:09,327 INFO L225 Difference]: With dead ends: 151 [2019-09-03 20:54:09,327 INFO L226 Difference]: Without dead ends: 151 [2019-09-03 20:54:09,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 225 SyntacticMatches, 40 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-03 20:54:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-09-03 20:54:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 20:54:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-09-03 20:54:09,332 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2019-09-03 20:54:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:09,333 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2019-09-03 20:54:09,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 20:54:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2019-09-03 20:54:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-03 20:54:09,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:09,334 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:09,334 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:09,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:09,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1190198026, now seen corresponding path program 3 times [2019-09-03 20:54:09,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:09,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:09,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:09,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:09,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:11,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:11,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:11,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:11,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:11,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:11,157 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-03 20:54:11,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:11,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:11,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:11,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:11,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 20:54:11,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:11,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:14,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:14,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 102 [2019-09-03 20:54:14,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:14,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 20:54:14,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 20:54:14,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:14,584 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 73 states. [2019-09-03 20:54:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:17,501 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-09-03 20:54:17,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 20:54:17,502 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 149 [2019-09-03 20:54:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:17,503 INFO L225 Difference]: With dead ends: 153 [2019-09-03 20:54:17,503 INFO L226 Difference]: Without dead ends: 153 [2019-09-03 20:54:17,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 228 SyntacticMatches, 42 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-03 20:54:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-09-03 20:54:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-03 20:54:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-09-03 20:54:17,508 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2019-09-03 20:54:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:17,509 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-09-03 20:54:17,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 20:54:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-09-03 20:54:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-03 20:54:17,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:17,510 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:17,510 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:17,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:17,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1311476900, now seen corresponding path program 4 times [2019-09-03 20:54:17,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:17,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:17,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:17,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:17,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:19,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:19,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:19,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:19,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:19,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:19,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:19,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:19,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:19,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 20:54:19,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:19,466 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:54:22,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:22,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 102 [2019-09-03 20:54:22,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:22,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 20:54:22,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 20:54:22,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:22,698 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 74 states. [2019-09-03 20:54:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:25,602 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-09-03 20:54:25,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 20:54:25,603 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 151 [2019-09-03 20:54:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:25,604 INFO L225 Difference]: With dead ends: 155 [2019-09-03 20:54:25,604 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 20:54:25,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 231 SyntacticMatches, 44 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2178 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:25,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 20:54:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-09-03 20:54:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-03 20:54:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-09-03 20:54:25,609 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2019-09-03 20:54:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:25,610 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-09-03 20:54:25,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 20:54:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-09-03 20:54:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-03 20:54:25,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:25,611 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:25,611 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:25,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:25,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1896357822, now seen corresponding path program 5 times [2019-09-03 20:54:25,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:25,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:25,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:25,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:25,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:27,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:27,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:27,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:27,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:27,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:27,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:27,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:27,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:27,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:54:27,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:27,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 20:54:27,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:27,979 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:27,979 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:31,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:31,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 102 [2019-09-03 20:54:31,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:31,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 20:54:31,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 20:54:31,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:31,332 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 75 states. [2019-09-03 20:54:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:32,954 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-09-03 20:54:32,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 20:54:32,954 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 153 [2019-09-03 20:54:32,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:32,956 INFO L225 Difference]: With dead ends: 157 [2019-09-03 20:54:32,956 INFO L226 Difference]: Without dead ends: 157 [2019-09-03 20:54:32,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 234 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-03 20:54:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-09-03 20:54:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-03 20:54:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-09-03 20:54:32,960 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2019-09-03 20:54:32,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:32,960 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-09-03 20:54:32,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 20:54:32,960 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-09-03 20:54:32,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-03 20:54:32,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:32,961 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:32,961 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:32,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:32,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1326208088, now seen corresponding path program 6 times [2019-09-03 20:54:32,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:32,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:32,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:32,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:32,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:35,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:35,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:35,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:35,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:35,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:35,009 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-03 20:54:35,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:35,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:35,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:35,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:35,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-03 20:54:35,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:35,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:38,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:38,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 102 [2019-09-03 20:54:38,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:38,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 20:54:38,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 20:54:38,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:38,307 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 76 states. [2019-09-03 20:54:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:41,244 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-09-03 20:54:41,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 20:54:41,245 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 155 [2019-09-03 20:54:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:41,246 INFO L225 Difference]: With dead ends: 159 [2019-09-03 20:54:41,247 INFO L226 Difference]: Without dead ends: 159 [2019-09-03 20:54:41,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 237 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-03 20:54:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-09-03 20:54:41,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-03 20:54:41,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-09-03 20:54:41,250 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2019-09-03 20:54:41,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:41,250 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-09-03 20:54:41,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 20:54:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-09-03 20:54:41,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-03 20:54:41,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:41,251 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:41,251 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:41,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:41,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1126839694, now seen corresponding path program 7 times [2019-09-03 20:54:41,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:41,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:41,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:41,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:41,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:43,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:43,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:43,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:43,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:43,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:43,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:43,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:43,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:43,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 20:54:43,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:43,408 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:46,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:46,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 102 [2019-09-03 20:54:46,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:46,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 20:54:46,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 20:54:46,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:46,612 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 77 states. [2019-09-03 20:54:48,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:48,408 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-09-03 20:54:48,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 20:54:48,408 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 157 [2019-09-03 20:54:48,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:48,410 INFO L225 Difference]: With dead ends: 161 [2019-09-03 20:54:48,410 INFO L226 Difference]: Without dead ends: 161 [2019-09-03 20:54:48,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 240 SyntacticMatches, 50 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2475 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-03 20:54:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-09-03 20:54:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:54:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-09-03 20:54:48,414 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2019-09-03 20:54:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:48,415 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-09-03 20:54:48,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 20:54:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-09-03 20:54:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-03 20:54:48,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:48,416 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:48,416 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash -568712692, now seen corresponding path program 8 times [2019-09-03 20:54:48,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:48,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:48,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:48,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:48,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:50,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:50,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:50,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:50,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:50,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:50,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:50,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:50,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:50,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:54:50,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:50,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 20:54:50,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:50,581 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:53,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:53,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 102 [2019-09-03 20:54:53,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:53,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 20:54:53,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 20:54:53,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:53,801 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 78 states. [2019-09-03 20:54:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:56,757 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-09-03 20:54:56,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-03 20:54:56,758 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 159 [2019-09-03 20:54:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:56,759 INFO L225 Difference]: With dead ends: 163 [2019-09-03 20:54:56,759 INFO L226 Difference]: Without dead ends: 163 [2019-09-03 20:54:56,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 243 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2574 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:56,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-03 20:54:56,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-09-03 20:54:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-03 20:54:56,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-09-03 20:54:56,763 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2019-09-03 20:54:56,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:56,763 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-09-03 20:54:56,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 20:54:56,763 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-09-03 20:54:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-03 20:54:56,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:56,764 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:56,764 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:56,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:56,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1079575770, now seen corresponding path program 9 times [2019-09-03 20:54:56,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:56,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:56,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:56,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:56,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:58,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:58,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:58,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:58,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:58,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:58,880 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-03 20:54:58,891 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:58,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:58,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:58,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:58,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 20:54:58,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:58,996 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:02,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:02,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 102 [2019-09-03 20:55:02,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:02,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 20:55:02,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 20:55:02,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:02,231 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 79 states. [2019-09-03 20:55:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:05,205 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-09-03 20:55:05,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:55:05,206 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 161 [2019-09-03 20:55:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:05,207 INFO L225 Difference]: With dead ends: 165 [2019-09-03 20:55:05,207 INFO L226 Difference]: Without dead ends: 165 [2019-09-03 20:55:05,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 246 SyntacticMatches, 54 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:05,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-03 20:55:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-09-03 20:55:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-03 20:55:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-09-03 20:55:05,211 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2019-09-03 20:55:05,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:05,211 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-09-03 20:55:05,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 20:55:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-09-03 20:55:05,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-03 20:55:05,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:05,213 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:05,213 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:05,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:05,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1902245312, now seen corresponding path program 10 times [2019-09-03 20:55:05,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:05,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:05,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:05,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:05,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:07,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:07,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:07,401 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:07,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:07,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:07,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:07,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:07,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:07,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-03 20:55:07,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:07,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:10,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:10,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 102 [2019-09-03 20:55:10,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:10,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 20:55:10,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 20:55:10,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:10,811 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 80 states. [2019-09-03 20:55:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:13,281 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-09-03 20:55:13,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 20:55:13,282 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 163 [2019-09-03 20:55:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:13,283 INFO L225 Difference]: With dead ends: 167 [2019-09-03 20:55:13,284 INFO L226 Difference]: Without dead ends: 167 [2019-09-03 20:55:13,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 249 SyntacticMatches, 56 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2772 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-03 20:55:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-09-03 20:55:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-03 20:55:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-09-03 20:55:13,288 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2019-09-03 20:55:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:13,289 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-09-03 20:55:13,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 20:55:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-09-03 20:55:13,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-03 20:55:13,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:13,290 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:13,290 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:13,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:13,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1605848614, now seen corresponding path program 11 times [2019-09-03 20:55:13,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:13,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:13,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:13,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:13,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:17,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:17,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:17,249 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:17,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:17,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:17,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:17,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:17,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:17,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:55:17,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:17,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 20:55:17,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:17,373 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:20,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:20,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 102 [2019-09-03 20:55:20,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:20,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 20:55:20,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 20:55:20,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:20,685 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 81 states. [2019-09-03 20:55:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:23,299 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-09-03 20:55:23,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 20:55:23,299 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 165 [2019-09-03 20:55:23,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:23,301 INFO L225 Difference]: With dead ends: 169 [2019-09-03 20:55:23,301 INFO L226 Difference]: Without dead ends: 169 [2019-09-03 20:55:23,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 252 SyntacticMatches, 58 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-03 20:55:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-09-03 20:55:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-03 20:55:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-09-03 20:55:23,305 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2019-09-03 20:55:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:23,305 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2019-09-03 20:55:23,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 20:55:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2019-09-03 20:55:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-03 20:55:23,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:23,307 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:23,307 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:23,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:23,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1334784140, now seen corresponding path program 12 times [2019-09-03 20:55:23,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:23,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:23,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:23,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:23,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:25,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:25,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:25,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:25,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:25,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:25,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:25,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:25,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:25,662 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:25,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:25,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 20:55:25,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:25,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:29,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:29,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 102 [2019-09-03 20:55:29,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:29,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 20:55:29,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 20:55:29,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:29,036 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 82 states. [2019-09-03 20:55:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:32,019 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-09-03 20:55:32,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-03 20:55:32,020 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 167 [2019-09-03 20:55:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:32,021 INFO L225 Difference]: With dead ends: 171 [2019-09-03 20:55:32,021 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 20:55:32,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 255 SyntacticMatches, 60 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 20:55:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-09-03 20:55:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:55:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-09-03 20:55:32,025 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2019-09-03 20:55:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:32,026 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-09-03 20:55:32,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 20:55:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-09-03 20:55:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-03 20:55:32,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:32,027 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:32,027 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:32,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1460137614, now seen corresponding path program 13 times [2019-09-03 20:55:32,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:32,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:32,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:32,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:34,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:34,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:34,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:34,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:34,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:34,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:34,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:34,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:34,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 20:55:34,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:34,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:37,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:37,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 102 [2019-09-03 20:55:37,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:37,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 20:55:37,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 20:55:37,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:37,954 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 83 states. [2019-09-03 20:55:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:40,945 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-09-03 20:55:40,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 20:55:40,946 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 169 [2019-09-03 20:55:40,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:40,947 INFO L225 Difference]: With dead ends: 173 [2019-09-03 20:55:40,947 INFO L226 Difference]: Without dead ends: 173 [2019-09-03 20:55:40,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 258 SyntacticMatches, 62 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3069 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-03 20:55:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-03 20:55:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-03 20:55:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-09-03 20:55:40,951 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2019-09-03 20:55:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:40,951 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-09-03 20:55:40,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 20:55:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-09-03 20:55:40,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-03 20:55:40,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:40,953 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:40,953 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:40,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:40,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1269584088, now seen corresponding path program 14 times [2019-09-03 20:55:40,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:40,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:40,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:40,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:40,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:43,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:43,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:43,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:43,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:43,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:43,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:43,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:43,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:43,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:55:43,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:43,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 20:55:43,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:43,529 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:46,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:46,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 102 [2019-09-03 20:55:46,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:46,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 20:55:46,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 20:55:46,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:46,791 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 84 states. [2019-09-03 20:55:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:48,471 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-09-03 20:55:48,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 20:55:48,472 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 171 [2019-09-03 20:55:48,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:48,473 INFO L225 Difference]: With dead ends: 175 [2019-09-03 20:55:48,474 INFO L226 Difference]: Without dead ends: 175 [2019-09-03 20:55:48,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 261 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3168 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-03 20:55:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-09-03 20:55:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-03 20:55:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-09-03 20:55:48,477 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2019-09-03 20:55:48,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:48,478 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2019-09-03 20:55:48,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 20:55:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2019-09-03 20:55:48,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-03 20:55:48,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:48,479 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:48,479 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:48,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:48,480 INFO L82 PathProgramCache]: Analyzing trace with hash -307121854, now seen corresponding path program 15 times [2019-09-03 20:55:48,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:48,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:48,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:48,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:48,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:50,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:50,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:50,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:50,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:50,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:50,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:50,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:50,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:50,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:50,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:50,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 20:55:50,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:50,986 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:54,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:54,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 102 [2019-09-03 20:55:54,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:54,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 20:55:54,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 20:55:54,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:54,300 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 85 states. [2019-09-03 20:55:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:57,296 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-09-03 20:55:57,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 20:55:57,296 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 173 [2019-09-03 20:55:57,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:57,297 INFO L225 Difference]: With dead ends: 177 [2019-09-03 20:55:57,297 INFO L226 Difference]: Without dead ends: 177 [2019-09-03 20:55:57,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 264 SyntacticMatches, 66 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-03 20:55:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-09-03 20:55:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-03 20:55:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-09-03 20:55:57,301 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2019-09-03 20:55:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:57,302 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-09-03 20:55:57,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 20:55:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-09-03 20:55:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-03 20:55:57,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:57,303 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:57,303 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:57,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:57,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1201116380, now seen corresponding path program 16 times [2019-09-03 20:55:57,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:57,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:57,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:57,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:57,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:01,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:01,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:01,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:01,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:01,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:01,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:01,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:01,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:01,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-03 20:56:01,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:01,249 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:01,249 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:04,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:04,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 102 [2019-09-03 20:56:04,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:04,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 20:56:04,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 20:56:04,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:04,660 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 86 states. [2019-09-03 20:56:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:06,949 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-09-03 20:56:06,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-03 20:56:06,949 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 175 [2019-09-03 20:56:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:06,951 INFO L225 Difference]: With dead ends: 179 [2019-09-03 20:56:06,951 INFO L226 Difference]: Without dead ends: 179 [2019-09-03 20:56:06,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 267 SyntacticMatches, 68 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3366 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-03 20:56:06,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-09-03 20:56:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-03 20:56:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-09-03 20:56:06,955 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2019-09-03 20:56:06,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:06,956 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-09-03 20:56:06,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 20:56:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-09-03 20:56:06,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-03 20:56:06,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:06,957 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:06,957 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:06,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:06,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1080886794, now seen corresponding path program 17 times [2019-09-03 20:56:06,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:06,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:06,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:06,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:06,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:09,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:09,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:09,576 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:09,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:09,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:09,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:09,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:09,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:09,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:56:09,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:09,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 20:56:09,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:09,722 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:13,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:13,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 102 [2019-09-03 20:56:13,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:13,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 20:56:13,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 20:56:13,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:13,051 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 87 states. [2019-09-03 20:56:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:14,784 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-09-03 20:56:14,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 20:56:14,784 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 177 [2019-09-03 20:56:14,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:14,786 INFO L225 Difference]: With dead ends: 181 [2019-09-03 20:56:14,786 INFO L226 Difference]: Without dead ends: 181 [2019-09-03 20:56:14,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 270 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:14,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-03 20:56:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-03 20:56:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:56:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-09-03 20:56:14,790 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2019-09-03 20:56:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:14,790 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-09-03 20:56:14,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 20:56:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-09-03 20:56:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-03 20:56:14,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:14,791 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:14,792 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:14,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:14,792 INFO L82 PathProgramCache]: Analyzing trace with hash 642351248, now seen corresponding path program 18 times [2019-09-03 20:56:14,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:14,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:14,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:18,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:18,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:18,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:18,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:18,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:18,694 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:18,705 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:18,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:18,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:18,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:18,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-03 20:56:18,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:18,810 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:22,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:22,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 102 [2019-09-03 20:56:22,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:22,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 20:56:22,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 20:56:22,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:22,132 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 88 states. [2019-09-03 20:56:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:24,342 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-09-03 20:56:24,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 20:56:24,343 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 179 [2019-09-03 20:56:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:24,344 INFO L225 Difference]: With dead ends: 183 [2019-09-03 20:56:24,345 INFO L226 Difference]: Without dead ends: 183 [2019-09-03 20:56:24,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 273 SyntacticMatches, 72 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-03 20:56:24,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-09-03 20:56:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-03 20:56:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-09-03 20:56:24,348 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2019-09-03 20:56:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:24,349 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-09-03 20:56:24,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 20:56:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-09-03 20:56:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-03 20:56:24,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:24,350 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:24,350 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:24,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:24,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1183266646, now seen corresponding path program 19 times [2019-09-03 20:56:24,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:24,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:24,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:24,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:24,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:27,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:27,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:27,605 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:27,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:27,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:27,606 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:27,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:27,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:27,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 20:56:27,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:27,725 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:31,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:31,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 102 [2019-09-03 20:56:31,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:31,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 20:56:31,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 20:56:31,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:31,090 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 89 states. [2019-09-03 20:56:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:33,227 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-09-03 20:56:33,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:56:33,228 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 181 [2019-09-03 20:56:33,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:33,229 INFO L225 Difference]: With dead ends: 185 [2019-09-03 20:56:33,229 INFO L226 Difference]: Without dead ends: 185 [2019-09-03 20:56:33,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 276 SyntacticMatches, 74 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3663 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-03 20:56:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-09-03 20:56:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-03 20:56:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-09-03 20:56:33,233 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2019-09-03 20:56:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:33,233 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-09-03 20:56:33,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 20:56:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-09-03 20:56:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-03 20:56:33,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:33,235 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:33,235 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:33,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:33,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1039561284, now seen corresponding path program 20 times [2019-09-03 20:56:33,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:33,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:33,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:36,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:36,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:36,003 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:36,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:36,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:36,003 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:36,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:36,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:36,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 20:56:36,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:36,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-03 20:56:36,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:36,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:39,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:39,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 102 [2019-09-03 20:56:39,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:39,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 20:56:39,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 20:56:39,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:39,486 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 90 states. [2019-09-03 20:56:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:41,183 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-09-03 20:56:41,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 20:56:41,184 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 183 [2019-09-03 20:56:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:41,185 INFO L225 Difference]: With dead ends: 187 [2019-09-03 20:56:41,185 INFO L226 Difference]: Without dead ends: 187 [2019-09-03 20:56:41,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 279 SyntacticMatches, 76 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-03 20:56:41,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-09-03 20:56:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-03 20:56:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-09-03 20:56:41,190 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2019-09-03 20:56:41,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:41,190 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-09-03 20:56:41,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 20:56:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-09-03 20:56:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-03 20:56:41,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:41,192 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:41,192 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:41,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:41,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1716511394, now seen corresponding path program 21 times [2019-09-03 20:56:41,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:41,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:41,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:41,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:41,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:43,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:43,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:43,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:43,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:43,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:43,995 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:44,006 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:44,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:44,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:44,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:44,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 20:56:44,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:44,123 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:47,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:47,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 102 [2019-09-03 20:56:47,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:47,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 20:56:47,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 20:56:47,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:47,763 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 91 states. [2019-09-03 20:56:50,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:50,711 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-09-03 20:56:50,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 20:56:50,711 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 185 [2019-09-03 20:56:50,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:50,713 INFO L225 Difference]: With dead ends: 189 [2019-09-03 20:56:50,713 INFO L226 Difference]: Without dead ends: 189 [2019-09-03 20:56:50,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 282 SyntacticMatches, 78 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:50,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-03 20:56:50,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-09-03 20:56:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-03 20:56:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-09-03 20:56:50,717 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2019-09-03 20:56:50,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:50,717 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-09-03 20:56:50,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 20:56:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-09-03 20:56:50,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-03 20:56:50,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:50,718 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:50,719 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:50,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:50,719 INFO L82 PathProgramCache]: Analyzing trace with hash -307533320, now seen corresponding path program 22 times [2019-09-03 20:56:50,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:50,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:50,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:50,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:50,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:53,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:53,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:53,583 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:53,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:53,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:53,583 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:53,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:53,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:53,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-03 20:56:53,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:53,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:57,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:57,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 102 [2019-09-03 20:56:57,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:57,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-03 20:56:57,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-03 20:56:57,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:57,166 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 92 states. [2019-09-03 20:57:00,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:00,202 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-09-03 20:57:00,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 20:57:00,202 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 187 [2019-09-03 20:57:00,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:00,203 INFO L225 Difference]: With dead ends: 191 [2019-09-03 20:57:00,203 INFO L226 Difference]: Without dead ends: 191 [2019-09-03 20:57:00,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 285 SyntacticMatches, 80 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-03 20:57:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-09-03 20:57:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:57:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-09-03 20:57:00,207 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2019-09-03 20:57:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:00,208 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-09-03 20:57:00,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-03 20:57:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-09-03 20:57:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-03 20:57:00,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:00,209 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:00,209 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:00,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:00,209 INFO L82 PathProgramCache]: Analyzing trace with hash 805697554, now seen corresponding path program 23 times [2019-09-03 20:57:00,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:00,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:00,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:00,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:00,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:03,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:03,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:03,097 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:03,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:03,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:03,097 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:03,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:03,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:03,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 20:57:03,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:03,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 20:57:03,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:03,241 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:06,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:06,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 102 [2019-09-03 20:57:06,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:06,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 20:57:06,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 20:57:06,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:06,704 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 93 states. [2019-09-03 20:57:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:08,931 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-09-03 20:57:08,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 20:57:08,932 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 189 [2019-09-03 20:57:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:08,933 INFO L225 Difference]: With dead ends: 193 [2019-09-03 20:57:08,933 INFO L226 Difference]: Without dead ends: 193 [2019-09-03 20:57:08,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 288 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4059 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:08,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-03 20:57:08,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-09-03 20:57:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-03 20:57:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-09-03 20:57:08,942 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2019-09-03 20:57:08,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:08,942 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-09-03 20:57:08,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 20:57:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-09-03 20:57:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-03 20:57:08,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:08,944 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:08,944 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:08,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1173710764, now seen corresponding path program 24 times [2019-09-03 20:57:08,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:08,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:08,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:08,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:08,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:11,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:11,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:11,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:11,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:11,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:11,912 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:11,926 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:11,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:11,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:11,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:11,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 20:57:11,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:12,038 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:15,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:15,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 102 [2019-09-03 20:57:15,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:15,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-03 20:57:15,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-03 20:57:15,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:15,443 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 94 states. [2019-09-03 20:57:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:17,904 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-09-03 20:57:17,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 20:57:17,905 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 191 [2019-09-03 20:57:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:17,906 INFO L225 Difference]: With dead ends: 195 [2019-09-03 20:57:17,906 INFO L226 Difference]: Without dead ends: 195 [2019-09-03 20:57:17,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 291 SyntacticMatches, 84 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4158 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-03 20:57:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-09-03 20:57:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-03 20:57:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-09-03 20:57:17,909 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2019-09-03 20:57:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:17,909 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-09-03 20:57:17,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-03 20:57:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-09-03 20:57:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-03 20:57:17,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:17,910 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:17,911 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:17,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1647879994, now seen corresponding path program 25 times [2019-09-03 20:57:17,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:17,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:17,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:17,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:21,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:21,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:21,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:21,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:21,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:21,112 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:21,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:21,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:21,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 20:57:21,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:21,231 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:24,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:24,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 102 [2019-09-03 20:57:24,625 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:24,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 20:57:24,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 20:57:24,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:24,627 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 95 states. [2019-09-03 20:57:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:27,654 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-09-03 20:57:27,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 20:57:27,655 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 193 [2019-09-03 20:57:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:27,656 INFO L225 Difference]: With dead ends: 197 [2019-09-03 20:57:27,657 INFO L226 Difference]: Without dead ends: 197 [2019-09-03 20:57:27,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 294 SyntacticMatches, 86 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4257 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-03 20:57:27,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-09-03 20:57:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-03 20:57:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-09-03 20:57:27,659 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2019-09-03 20:57:27,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:27,660 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-09-03 20:57:27,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 20:57:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-09-03 20:57:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-03 20:57:27,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:27,661 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:27,661 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:27,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:27,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1222732640, now seen corresponding path program 26 times [2019-09-03 20:57:27,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:27,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:27,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:27,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:27,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:30,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:30,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:30,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:30,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:30,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:30,806 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:30,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:30,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:30,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-03 20:57:30,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:30,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-03 20:57:30,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:31,040 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:34,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:34,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 102 [2019-09-03 20:57:34,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:34,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-03 20:57:34,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-03 20:57:34,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:34,558 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 96 states. [2019-09-03 20:57:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:37,610 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-09-03 20:57:37,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 20:57:37,610 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 195 [2019-09-03 20:57:37,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:37,612 INFO L225 Difference]: With dead ends: 199 [2019-09-03 20:57:37,612 INFO L226 Difference]: Without dead ends: 199 [2019-09-03 20:57:37,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 297 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:37,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-03 20:57:37,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-09-03 20:57:37,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-03 20:57:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2019-09-03 20:57:37,615 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2019-09-03 20:57:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:37,615 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2019-09-03 20:57:37,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-03 20:57:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2019-09-03 20:57:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-03 20:57:37,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:37,616 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:37,617 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1782497414, now seen corresponding path program 27 times [2019-09-03 20:57:37,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:37,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:37,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:37,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:37,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:40,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:40,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:40,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:40,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:40,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:40,787 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:40,798 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:40,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:40,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:40,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:40,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 20:57:40,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:40,930 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:44,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:44,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2019-09-03 20:57:44,381 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:44,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 20:57:44,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 20:57:44,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:44,383 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 97 states. [2019-09-03 20:57:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:47,438 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-09-03 20:57:47,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 20:57:47,439 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 197 [2019-09-03 20:57:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:47,440 INFO L225 Difference]: With dead ends: 201 [2019-09-03 20:57:47,440 INFO L226 Difference]: Without dead ends: 201 [2019-09-03 20:57:47,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 300 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-03 20:57:47,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-09-03 20:57:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 20:57:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-09-03 20:57:47,442 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2019-09-03 20:57:47,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:47,442 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-09-03 20:57:47,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 20:57:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-09-03 20:57:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-03 20:57:47,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:47,444 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:47,444 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash 704410900, now seen corresponding path program 28 times [2019-09-03 20:57:47,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:47,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:47,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:47,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:47,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:50,660 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:50,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:50,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:50,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:50,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:50,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:50,661 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:50,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:50,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:50,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-03 20:57:50,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:50,802 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:54,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:54,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 102 [2019-09-03 20:57:54,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:54,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-03 20:57:54,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-03 20:57:54,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:54,429 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 98 states. [2019-09-03 20:57:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:57,475 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-09-03 20:57:57,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 20:57:57,476 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 199 [2019-09-03 20:57:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:57,477 INFO L225 Difference]: With dead ends: 203 [2019-09-03 20:57:57,477 INFO L226 Difference]: Without dead ends: 203 [2019-09-03 20:57:57,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 303 SyntacticMatches, 92 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4554 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-03 20:57:57,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-09-03 20:57:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-03 20:57:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-09-03 20:57:57,481 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2019-09-03 20:57:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:57,482 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-09-03 20:57:57,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-03 20:57:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-09-03 20:57:57,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-03 20:57:57,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:57,483 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:57,483 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:57,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:57,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1673483218, now seen corresponding path program 29 times [2019-09-03 20:57:57,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:57,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:57,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:57,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:57,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:00,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:00,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:00,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:00,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:00,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:00,739 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:00,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:00,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:00,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-03 20:58:00,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:00,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 20:58:00,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:00,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:04,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:04,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 102 [2019-09-03 20:58:04,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:04,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 20:58:04,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 20:58:04,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:58:04,297 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 99 states. [2019-09-03 20:58:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:06,305 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-09-03 20:58:06,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 20:58:06,306 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 201 [2019-09-03 20:58:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:06,307 INFO L225 Difference]: With dead ends: 205 [2019-09-03 20:58:06,308 INFO L226 Difference]: Without dead ends: 205 [2019-09-03 20:58:06,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 306 SyntacticMatches, 94 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4653 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:58:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-03 20:58:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-09-03 20:58:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-03 20:58:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2019-09-03 20:58:06,311 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2019-09-03 20:58:06,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:06,311 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2019-09-03 20:58:06,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 20:58:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2019-09-03 20:58:06,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-03 20:58:06,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:06,312 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:06,312 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:06,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:06,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1907129144, now seen corresponding path program 30 times [2019-09-03 20:58:06,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:06,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:06,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:06,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:06,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:09,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:09,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:09,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:09,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:09,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:09,638 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:09,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:09,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:09,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:09,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:09,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-03 20:58:09,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:09,767 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:13,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:13,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 102 [2019-09-03 20:58:13,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:13,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-03 20:58:13,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-03 20:58:13,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:58:13,161 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 100 states. [2019-09-03 20:58:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:16,231 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-09-03 20:58:16,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-03 20:58:16,231 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 203 [2019-09-03 20:58:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:16,232 INFO L225 Difference]: With dead ends: 207 [2019-09-03 20:58:16,232 INFO L226 Difference]: Without dead ends: 207 [2019-09-03 20:58:16,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 309 SyntacticMatches, 96 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:58:16,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-03 20:58:16,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-09-03 20:58:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-03 20:58:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-09-03 20:58:16,235 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2019-09-03 20:58:16,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:16,235 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-09-03 20:58:16,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-03 20:58:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-09-03 20:58:16,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-03 20:58:16,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:16,236 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:16,236 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:16,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:16,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1192402658, now seen corresponding path program 31 times [2019-09-03 20:58:16,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:16,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:16,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:16,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:16,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:19,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:19,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:19,674 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:19,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:19,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:19,674 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:19,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:19,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:19,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 20:58:19,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:19,799 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:23,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:23,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 102 [2019-09-03 20:58:23,316 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:23,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 20:58:23,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 20:58:23,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:58:23,318 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 101 states. [2019-09-03 20:58:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:26,384 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-09-03 20:58:26,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 20:58:26,384 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2019-09-03 20:58:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:26,385 INFO L225 Difference]: With dead ends: 209 [2019-09-03 20:58:26,386 INFO L226 Difference]: Without dead ends: 209 [2019-09-03 20:58:26,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 312 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4851 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:58:26,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-03 20:58:26,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-09-03 20:58:26,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-03 20:58:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-09-03 20:58:26,388 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2019-09-03 20:58:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:26,389 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-09-03 20:58:26,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 20:58:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-09-03 20:58:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-03 20:58:26,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:26,390 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:26,390 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:26,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:26,390 INFO L82 PathProgramCache]: Analyzing trace with hash -864839044, now seen corresponding path program 32 times [2019-09-03 20:58:26,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:26,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:26,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:26,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:26,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:29,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:29,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:29,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:29,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:29,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:29,844 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:29,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:29,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:29,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-03 20:58:29,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:29,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-03 20:58:29,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:30,015 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:33,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:33,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:33,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 102 [2019-09-03 20:58:33,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:33,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 20:58:33,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 20:58:33,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:58:33,471 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 102 states. [2019-09-03 20:58:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:36,539 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-09-03 20:58:36,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-03 20:58:36,539 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2019-09-03 20:58:36,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:36,541 INFO L225 Difference]: With dead ends: 210 [2019-09-03 20:58:36,541 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 20:58:36,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 315 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:58:36,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 20:58:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-09-03 20:58:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 20:58:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2019-09-03 20:58:36,545 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2019-09-03 20:58:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:36,545 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2019-09-03 20:58:36,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 20:58:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2019-09-03 20:58:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-03 20:58:36,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:36,547 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:36,547 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:36,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:36,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2105808790, now seen corresponding path program 33 times [2019-09-03 20:58:36,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:36,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:36,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:36,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:36,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:38,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:38,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:38,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:38,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:38,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:38,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:38,664 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:38,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:38,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:38,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:38,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 20:58:38,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:38,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:39,013 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:58:39,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:39,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2019-09-03 20:58:39,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:39,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:58:39,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:58:39,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:58:39,282 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 55 states. [2019-09-03 20:58:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:41,142 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2019-09-03 20:58:41,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 20:58:41,143 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-09-03 20:58:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:41,144 INFO L225 Difference]: With dead ends: 214 [2019-09-03 20:58:41,144 INFO L226 Difference]: Without dead ends: 213 [2019-09-03 20:58:41,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 416 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:58:41,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-03 20:58:41,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-09-03 20:58:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-03 20:58:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-09-03 20:58:41,148 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2019-09-03 20:58:41,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:41,148 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-09-03 20:58:41,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:58:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-09-03 20:58:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-03 20:58:41,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:41,149 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:41,150 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:41,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:41,150 INFO L82 PathProgramCache]: Analyzing trace with hash 745125424, now seen corresponding path program 34 times [2019-09-03 20:58:41,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:41,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:41,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:41,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:41,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:42,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:58:42,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-09-03 20:58:42,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:58:42,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:58:42,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:58:42,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:58:42,321 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 52 states. [2019-09-03 20:58:42,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:42,725 INFO L93 Difference]: Finished difference Result 207 states and 206 transitions. [2019-09-03 20:58:42,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:58:42,726 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2019-09-03 20:58:42,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:42,726 INFO L225 Difference]: With dead ends: 207 [2019-09-03 20:58:42,726 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:58:42,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:58:42,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:58:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:58:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:58:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:58:42,727 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-09-03 20:58:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:42,728 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:58:42,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:58:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:58:42,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:58:42,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:58:42 BoogieIcfgContainer [2019-09-03 20:58:42,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:58:42,735 INFO L168 Benchmark]: Toolchain (without parser) took 349953.01 ms. Allocated memory was 140.5 MB in the beginning and 615.5 MB in the end (delta: 475.0 MB). Free memory was 87.3 MB in the beginning and 558.5 MB in the end (delta: -471.2 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-09-03 20:58:42,736 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:58:42,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.86 ms. Allocated memory was 140.5 MB in the beginning and 199.8 MB in the end (delta: 59.2 MB). Free memory was 87.1 MB in the beginning and 171.2 MB in the end (delta: -84.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:58:42,737 INFO L168 Benchmark]: Boogie Preprocessor took 78.91 ms. Allocated memory is still 199.8 MB. Free memory was 171.2 MB in the beginning and 168.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:58:42,737 INFO L168 Benchmark]: RCFGBuilder took 925.48 ms. Allocated memory is still 199.8 MB. Free memory was 168.1 MB in the beginning and 106.0 MB in the end (delta: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:58:42,738 INFO L168 Benchmark]: TraceAbstraction took 348295.63 ms. Allocated memory was 199.8 MB in the beginning and 615.5 MB in the end (delta: 415.8 MB). Free memory was 105.4 MB in the beginning and 558.5 MB in the end (delta: -453.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-03 20:58:42,746 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 648.86 ms. Allocated memory was 140.5 MB in the beginning and 199.8 MB in the end (delta: 59.2 MB). Free memory was 87.1 MB in the beginning and 171.2 MB in the end (delta: -84.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.91 ms. Allocated memory is still 199.8 MB. Free memory was 171.2 MB in the beginning and 168.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 925.48 ms. Allocated memory is still 199.8 MB. Free memory was 168.1 MB in the beginning and 106.0 MB in the end (delta: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 348295.63 ms. Allocated memory was 199.8 MB in the beginning and 615.5 MB in the end (delta: 415.8 MB). Free memory was 105.4 MB in the beginning and 558.5 MB in the end (delta: -453.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 439]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 149 locations, 1 error locations. SAFE Result, 348.2s OverallTime, 62 OverallIterations, 34 TraceHistogramMax, 127.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4132 SDtfs, 6117 SDslu, 24767 SDs, 0 SdLazy, 200781 SolverSat, 5721 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 100.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15340 GetRequests, 9066 SyntacticMatches, 2210 SemanticMatches, 4064 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109296 ImplicationChecksByTransitivity, 207.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 62 MinimizatonAttempts, 35 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 213.5s InterpolantComputationTime, 15897 NumberOfCodeBlocks, 15897 NumberOfCodeBlocksAsserted, 293 NumberOfCheckSat, 21610 ConstructedInterpolants, 0 QuantifiedInterpolants, 10648676 SizeOfPredicates, 35 NumberOfNonLiveVariables, 14454 ConjunctsInSsa, 2844 ConjunctsInUnsatCore, 128 InterpolantComputations, 29 PerfectInterpolantSequences, 1156/38743 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...