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-112bae1 [2019-09-10 02:06:24,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:06:24,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:06:24,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:06:24,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:06:24,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:06:25,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:06:25,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:06:25,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:06:25,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:06:25,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:06:25,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:06:25,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:06:25,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:06:25,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:06:25,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:06:25,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:06:25,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:06:25,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:06:25,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:06:25,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:06:25,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:06:25,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:06:25,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:06:25,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:06:25,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:06:25,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:06:25,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:06:25,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:06:25,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:06:25,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:06:25,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:06:25,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:06:25,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:06:25,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:06:25,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:06:25,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:06:25,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:06:25,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:06:25,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:06:25,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:06:25,034 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:06:25,051 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:06:25,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:06:25,052 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:06:25,052 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:06:25,052 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:06:25,053 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:06:25,053 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:06:25,053 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:06:25,053 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:06:25,053 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:06:25,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:06:25,054 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:06:25,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:06:25,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:06:25,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:06:25,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:06:25,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:06:25,056 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:06:25,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:06:25,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:06:25,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:06:25,056 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:06:25,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:06:25,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:06:25,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:06:25,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:06:25,058 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:06:25,058 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:06:25,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:06:25,058 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:06:25,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:06:25,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:06:25,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:06:25,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:06:25,103 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:06:25,104 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-10 02:06:25,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72694627/9faf34a008314cf48afa643b2f900c6e/FLAG43070dba0 [2019-09-10 02:06:25,672 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:06:25,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-09-10 02:06:25,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72694627/9faf34a008314cf48afa643b2f900c6e/FLAG43070dba0 [2019-09-10 02:06:26,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72694627/9faf34a008314cf48afa643b2f900c6e [2019-09-10 02:06:26,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:06:26,024 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:06:26,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:06:26,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:06:26,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:06:26,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:06:26" (1/1) ... [2019-09-10 02:06:26,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ef47f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:26, skipping insertion in model container [2019-09-10 02:06:26,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:06:26" (1/1) ... [2019-09-10 02:06:26,045 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:06:26,097 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:06:26,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:06:26,462 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:06:26,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:06:26,681 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:06:26,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:26 WrapperNode [2019-09-10 02:06:26,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:06:26,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:06:26,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:06:26,682 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:06:26,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:26" (1/1) ... [2019-09-10 02:06:26,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:26" (1/1) ... [2019-09-10 02:06:26,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:26" (1/1) ... [2019-09-10 02:06:26,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:26" (1/1) ... [2019-09-10 02:06:26,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:26" (1/1) ... [2019-09-10 02:06:26,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:26" (1/1) ... [2019-09-10 02:06:26,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:26" (1/1) ... [2019-09-10 02:06:26,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:06:26,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:06:26,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:06:26,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:06:26,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:06:26,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:06:26,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:06:26,831 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:06:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:06:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:06:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:06:26,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:06:26,832 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:06:26,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:06:26,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:06:27,670 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:06:27,671 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:06:27,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:06:27 BoogieIcfgContainer [2019-09-10 02:06:27,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:06:27,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:06:27,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:06:27,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:06:27,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:06:26" (1/3) ... [2019-09-10 02:06:27,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770b9f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:06:27, skipping insertion in model container [2019-09-10 02:06:27,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:26" (2/3) ... [2019-09-10 02:06:27,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770b9f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:06:27, skipping insertion in model container [2019-09-10 02:06:27,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:06:27" (3/3) ... [2019-09-10 02:06:27,680 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2019-09-10 02:06:27,690 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:06:27,698 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:06:27,715 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:06:27,742 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:06:27,742 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:06:27,743 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:06:27,743 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:06:27,743 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:06:27,743 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:06:27,744 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:06:27,744 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:06:27,765 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-09-10 02:06:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:27,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:27,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-10 02:06:27,786 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:27,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:27,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1537709744, now seen corresponding path program 1 times [2019-09-10 02:06:27,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:27,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:27,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:27,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:27,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:28,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:28,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:06:28,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:28,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:06:28,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:06:28,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:06:28,054 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2019-09-10 02:06:28,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:28,576 INFO L93 Difference]: Finished difference Result 149 states and 282 transitions. [2019-09-10 02:06:28,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:06:28,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-10 02:06:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:28,597 INFO L225 Difference]: With dead ends: 149 [2019-09-10 02:06:28,598 INFO L226 Difference]: Without dead ends: 145 [2019-09-10 02:06:28,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:06:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-10 02:06:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-09-10 02:06:28,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-10 02:06:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-09-10 02:06:28,690 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 143 [2019-09-10 02:06:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:28,690 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-09-10 02:06:28,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:06:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-09-10 02:06:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:28,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:28,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:28,698 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:28,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:28,699 INFO L82 PathProgramCache]: Analyzing trace with hash 470480343, now seen corresponding path program 1 times [2019-09-10 02:06:28,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:28,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:28,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:28,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:28,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:28,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:28,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:06:28,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:28,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:06:28,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:06:28,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:06:28,841 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-09-10 02:06:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:29,402 INFO L93 Difference]: Finished difference Result 277 states and 345 transitions. [2019-09-10 02:06:29,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:06:29,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-10 02:06:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:29,405 INFO L225 Difference]: With dead ends: 277 [2019-09-10 02:06:29,406 INFO L226 Difference]: Without dead ends: 277 [2019-09-10 02:06:29,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:06:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-10 02:06:29,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2019-09-10 02:06:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-10 02:06:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2019-09-10 02:06:29,435 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 143 [2019-09-10 02:06:29,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:29,436 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 345 transitions. [2019-09-10 02:06:29,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:06:29,436 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 345 transitions. [2019-09-10 02:06:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:29,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:29,444 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-10 02:06:29,444 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:29,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:29,444 INFO L82 PathProgramCache]: Analyzing trace with hash 859387544, now seen corresponding path program 1 times [2019-09-10 02:06:29,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:29,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:29,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:29,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:29,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:29,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:29,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:06:29,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:29,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:06:29,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:06:29,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:06:29,675 INFO L87 Difference]: Start difference. First operand 277 states and 345 transitions. Second operand 7 states. [2019-09-10 02:06:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:30,387 INFO L93 Difference]: Finished difference Result 269 states and 333 transitions. [2019-09-10 02:06:30,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:06:30,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-10 02:06:30,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:30,390 INFO L225 Difference]: With dead ends: 269 [2019-09-10 02:06:30,390 INFO L226 Difference]: Without dead ends: 269 [2019-09-10 02:06:30,390 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-10 02:06:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-10 02:06:30,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-09-10 02:06:30,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-10 02:06:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2019-09-10 02:06:30,403 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 143 [2019-09-10 02:06:30,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:30,403 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2019-09-10 02:06:30,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:06:30,404 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2019-09-10 02:06:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:30,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:30,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:30,406 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:30,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:30,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1284631305, now seen corresponding path program 1 times [2019-09-10 02:06:30,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:30,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:30,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:30,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:30,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:30,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:30,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:06:30,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:30,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:06:30,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:06:30,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:06:30,558 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 8 states. [2019-09-10 02:06:31,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:31,539 INFO L93 Difference]: Finished difference Result 267 states and 330 transitions. [2019-09-10 02:06:31,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:06:31,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2019-09-10 02:06:31,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:31,541 INFO L225 Difference]: With dead ends: 267 [2019-09-10 02:06:31,541 INFO L226 Difference]: Without dead ends: 267 [2019-09-10 02:06:31,542 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-10 02:06:31,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-10 02:06:31,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2019-09-10 02:06:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-10 02:06:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2019-09-10 02:06:31,550 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 143 [2019-09-10 02:06:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:31,550 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2019-09-10 02:06:31,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:06:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2019-09-10 02:06:31,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:31,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:31,553 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-10 02:06:31,553 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:31,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:31,553 INFO L82 PathProgramCache]: Analyzing trace with hash 698919756, now seen corresponding path program 1 times [2019-09-10 02:06:31,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:31,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:31,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:31,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:31,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:31,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:31,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:06:31,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:31,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:06:31,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:06:31,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:06:31,674 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand 9 states. [2019-09-10 02:06:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:32,401 INFO L93 Difference]: Finished difference Result 265 states and 327 transitions. [2019-09-10 02:06:32,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:06:32,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 143 [2019-09-10 02:06:32,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:32,404 INFO L225 Difference]: With dead ends: 265 [2019-09-10 02:06:32,404 INFO L226 Difference]: Without dead ends: 265 [2019-09-10 02:06:32,404 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-10 02:06:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-10 02:06:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2019-09-10 02:06:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-10 02:06:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2019-09-10 02:06:32,413 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 143 [2019-09-10 02:06:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:32,414 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2019-09-10 02:06:32,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:06:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2019-09-10 02:06:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:32,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:32,416 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:32,416 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:32,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:32,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2054450191, now seen corresponding path program 1 times [2019-09-10 02:06:32,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:32,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:32,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:32,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:32,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:32,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:32,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:06:32,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:32,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:06:32,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:06:32,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:06:32,652 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand 12 states. [2019-09-10 02:06:33,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:33,211 INFO L93 Difference]: Finished difference Result 259 states and 318 transitions. [2019-09-10 02:06:33,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:06:33,212 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2019-09-10 02:06:33,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:33,214 INFO L225 Difference]: With dead ends: 259 [2019-09-10 02:06:33,214 INFO L226 Difference]: Without dead ends: 259 [2019-09-10 02:06:33,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:06:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-10 02:06:33,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-09-10 02:06:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-10 02:06:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2019-09-10 02:06:33,222 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 143 [2019-09-10 02:06:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:33,222 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2019-09-10 02:06:33,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:06:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2019-09-10 02:06:33,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:33,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:33,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:33,225 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:33,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:33,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1013609311, now seen corresponding path program 1 times [2019-09-10 02:06:33,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:33,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:33,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:33,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:33,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:33,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:33,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 02:06:33,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:33,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:06:33,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:06:33,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:06:33,409 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand 14 states. [2019-09-10 02:06:34,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:34,316 INFO L93 Difference]: Finished difference Result 255 states and 312 transitions. [2019-09-10 02:06:34,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:06:34,316 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 143 [2019-09-10 02:06:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:34,319 INFO L225 Difference]: With dead ends: 255 [2019-09-10 02:06:34,319 INFO L226 Difference]: Without dead ends: 255 [2019-09-10 02:06:34,320 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-10 02:06:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-10 02:06:34,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-09-10 02:06:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 02:06:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2019-09-10 02:06:34,326 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 143 [2019-09-10 02:06:34,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:34,326 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2019-09-10 02:06:34,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:06:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2019-09-10 02:06:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:34,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:34,328 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-10 02:06:34,328 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:34,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:34,329 INFO L82 PathProgramCache]: Analyzing trace with hash 560132216, now seen corresponding path program 1 times [2019-09-10 02:06:34,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:34,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:34,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:34,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:34,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:34,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:34,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 02:06:34,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:34,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:06:34,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:06:34,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:06:34,494 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 15 states. [2019-09-10 02:06:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:35,958 INFO L93 Difference]: Finished difference Result 253 states and 309 transitions. [2019-09-10 02:06:35,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:06:35,958 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 143 [2019-09-10 02:06:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:35,960 INFO L225 Difference]: With dead ends: 253 [2019-09-10 02:06:35,961 INFO L226 Difference]: Without dead ends: 253 [2019-09-10 02:06:35,962 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-10 02:06:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-10 02:06:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-09-10 02:06:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-10 02:06:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2019-09-10 02:06:35,968 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 143 [2019-09-10 02:06:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:35,968 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2019-09-10 02:06:35,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:06:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2019-09-10 02:06:35,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:35,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:35,970 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-10 02:06:35,970 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:35,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:35,971 INFO L82 PathProgramCache]: Analyzing trace with hash 752755852, now seen corresponding path program 1 times [2019-09-10 02:06:35,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:35,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:35,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:35,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:35,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:36,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:36,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 02:06:36,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:36,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 02:06:36,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 02:06:36,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:06:36,149 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand 17 states. [2019-09-10 02:06:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:37,755 INFO L93 Difference]: Finished difference Result 249 states and 303 transitions. [2019-09-10 02:06:37,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:06:37,756 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 143 [2019-09-10 02:06:37,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:37,758 INFO L225 Difference]: With dead ends: 249 [2019-09-10 02:06:37,758 INFO L226 Difference]: Without dead ends: 249 [2019-09-10 02:06:37,759 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-10 02:06:37,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-09-10 02:06:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-09-10 02:06:37,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-10 02:06:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2019-09-10 02:06:37,765 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 143 [2019-09-10 02:06:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:37,765 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2019-09-10 02:06:37,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 02:06:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2019-09-10 02:06:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:37,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:37,767 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-10 02:06:37,768 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:37,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:37,768 INFO L82 PathProgramCache]: Analyzing trace with hash -553376648, now seen corresponding path program 1 times [2019-09-10 02:06:37,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:37,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:37,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:37,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:37,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:37,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:37,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 02:06:37,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:37,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:06:37,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:06:37,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:06:37,972 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand 19 states. [2019-09-10 02:06:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:38,667 INFO L93 Difference]: Finished difference Result 245 states and 297 transitions. [2019-09-10 02:06:38,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:06:38,668 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 143 [2019-09-10 02:06:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:38,671 INFO L225 Difference]: With dead ends: 245 [2019-09-10 02:06:38,671 INFO L226 Difference]: Without dead ends: 245 [2019-09-10 02:06:38,671 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-10 02:06:38,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-10 02:06:38,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-09-10 02:06:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-10 02:06:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 297 transitions. [2019-09-10 02:06:38,678 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 297 transitions. Word has length 143 [2019-09-10 02:06:38,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:38,678 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 297 transitions. [2019-09-10 02:06:38,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:06:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 297 transitions. [2019-09-10 02:06:38,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:38,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:38,683 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-10 02:06:38,683 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:38,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:38,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1465640920, now seen corresponding path program 1 times [2019-09-10 02:06:38,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:38,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:38,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:38,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:38,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:39,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:39,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 02:06:39,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:39,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 02:06:39,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 02:06:39,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:06:39,012 INFO L87 Difference]: Start difference. First operand 245 states and 297 transitions. Second operand 23 states. [2019-09-10 02:06:39,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:39,778 INFO L93 Difference]: Finished difference Result 237 states and 285 transitions. [2019-09-10 02:06:39,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 02:06:39,778 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 143 [2019-09-10 02:06:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:39,781 INFO L225 Difference]: With dead ends: 237 [2019-09-10 02:06:39,781 INFO L226 Difference]: Without dead ends: 237 [2019-09-10 02:06:39,781 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-10 02:06:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-10 02:06:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-09-10 02:06:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-09-10 02:06:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2019-09-10 02:06:39,787 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 143 [2019-09-10 02:06:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:39,787 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2019-09-10 02:06:39,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 02:06:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2019-09-10 02:06:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:39,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:39,789 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-10 02:06:39,789 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:39,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1149693335, now seen corresponding path program 1 times [2019-09-10 02:06:39,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:39,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:39,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:39,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:39,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:40,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:40,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 02:06:40,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:40,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:06:40,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:06:40,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:06:40,090 INFO L87 Difference]: Start difference. First operand 237 states and 285 transitions. Second operand 24 states. [2019-09-10 02:06:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:42,243 INFO L93 Difference]: Finished difference Result 235 states and 282 transitions. [2019-09-10 02:06:42,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:06:42,243 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 143 [2019-09-10 02:06:42,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:42,245 INFO L225 Difference]: With dead ends: 235 [2019-09-10 02:06:42,246 INFO L226 Difference]: Without dead ends: 235 [2019-09-10 02:06:42,246 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-10 02:06:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-10 02:06:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-09-10 02:06:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-10 02:06:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 282 transitions. [2019-09-10 02:06:42,252 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 282 transitions. Word has length 143 [2019-09-10 02:06:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:42,253 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 282 transitions. [2019-09-10 02:06:42,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:06:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 282 transitions. [2019-09-10 02:06:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:42,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:42,254 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-10 02:06:42,255 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:42,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:42,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1452778676, now seen corresponding path program 1 times [2019-09-10 02:06:42,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:42,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:42,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:42,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:42,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:42,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:42,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 02:06:42,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:42,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:06:42,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:06:42,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:06:42,561 INFO L87 Difference]: Start difference. First operand 235 states and 282 transitions. Second operand 25 states. [2019-09-10 02:06:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:43,444 INFO L93 Difference]: Finished difference Result 233 states and 279 transitions. [2019-09-10 02:06:43,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 02:06:43,444 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 143 [2019-09-10 02:06:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:43,446 INFO L225 Difference]: With dead ends: 233 [2019-09-10 02:06:43,447 INFO L226 Difference]: Without dead ends: 233 [2019-09-10 02:06:43,447 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-10 02:06:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-10 02:06:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-09-10 02:06:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-10 02:06:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 279 transitions. [2019-09-10 02:06:43,453 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 279 transitions. Word has length 143 [2019-09-10 02:06:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:43,454 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 279 transitions. [2019-09-10 02:06:43,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:06:43,454 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 279 transitions. [2019-09-10 02:06:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:43,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:43,455 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-10 02:06:43,455 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:43,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1738588719, now seen corresponding path program 1 times [2019-09-10 02:06:43,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:43,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:43,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:43,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:43,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:43,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:43,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 02:06:43,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:43,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:06:43,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:06:43,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:06:43,786 INFO L87 Difference]: Start difference. First operand 233 states and 279 transitions. Second operand 28 states. [2019-09-10 02:06:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:45,695 INFO L93 Difference]: Finished difference Result 227 states and 270 transitions. [2019-09-10 02:06:45,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 02:06:45,696 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 143 [2019-09-10 02:06:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:45,697 INFO L225 Difference]: With dead ends: 227 [2019-09-10 02:06:45,698 INFO L226 Difference]: Without dead ends: 227 [2019-09-10 02:06:45,699 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-10 02:06:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-10 02:06:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-10 02:06:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-10 02:06:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 270 transitions. [2019-09-10 02:06:45,704 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 270 transitions. Word has length 143 [2019-09-10 02:06:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:45,705 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 270 transitions. [2019-09-10 02:06:45,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:06:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2019-09-10 02:06:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:45,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:45,706 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-10 02:06:45,706 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:45,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:45,707 INFO L82 PathProgramCache]: Analyzing trace with hash -512972737, now seen corresponding path program 1 times [2019-09-10 02:06:45,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:45,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:45,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:45,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:45,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:46,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:46,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-10 02:06:46,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:46,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 02:06:46,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 02:06:46,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-10 02:06:46,079 INFO L87 Difference]: Start difference. First operand 227 states and 270 transitions. Second operand 30 states. [2019-09-10 02:06:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:48,540 INFO L93 Difference]: Finished difference Result 223 states and 264 transitions. [2019-09-10 02:06:48,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 02:06:48,541 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 143 [2019-09-10 02:06:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:48,542 INFO L225 Difference]: With dead ends: 223 [2019-09-10 02:06:48,543 INFO L226 Difference]: Without dead ends: 223 [2019-09-10 02:06:48,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-10 02:06:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-10 02:06:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-09-10 02:06:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-10 02:06:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2019-09-10 02:06:48,550 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 143 [2019-09-10 02:06:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:48,550 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2019-09-10 02:06:48,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 02:06:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2019-09-10 02:06:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:48,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:48,552 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-10 02:06:48,552 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:48,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:48,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1207573688, now seen corresponding path program 1 times [2019-09-10 02:06:48,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:48,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:48,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:48,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:48,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:49,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:49,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 02:06:49,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:49,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 02:06:49,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 02:06:49,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:06:49,002 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand 31 states. [2019-09-10 02:06:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:50,872 INFO L93 Difference]: Finished difference Result 221 states and 261 transitions. [2019-09-10 02:06:50,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:06:50,873 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 143 [2019-09-10 02:06:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:50,874 INFO L225 Difference]: With dead ends: 221 [2019-09-10 02:06:50,875 INFO L226 Difference]: Without dead ends: 221 [2019-09-10 02:06:50,875 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-10 02:06:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-10 02:06:50,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-09-10 02:06:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-10 02:06:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2019-09-10 02:06:50,880 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 143 [2019-09-10 02:06:50,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:50,881 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2019-09-10 02:06:50,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 02:06:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2019-09-10 02:06:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:50,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:50,882 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-10 02:06:50,882 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:50,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:50,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1520258956, now seen corresponding path program 1 times [2019-09-10 02:06:50,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:50,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:50,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:50,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:51,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:51,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-10 02:06:51,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:51,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 02:06:51,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 02:06:51,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 02:06:51,500 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand 33 states. [2019-09-10 02:06:54,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:54,115 INFO L93 Difference]: Finished difference Result 217 states and 255 transitions. [2019-09-10 02:06:54,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 02:06:54,115 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 143 [2019-09-10 02:06:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:54,117 INFO L225 Difference]: With dead ends: 217 [2019-09-10 02:06:54,117 INFO L226 Difference]: Without dead ends: 217 [2019-09-10 02:06:54,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 02:06:54,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-10 02:06:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-09-10 02:06:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-10 02:06:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 255 transitions. [2019-09-10 02:06:54,123 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 255 transitions. Word has length 143 [2019-09-10 02:06:54,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:54,123 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 255 transitions. [2019-09-10 02:06:54,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 02:06:54,124 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 255 transitions. [2019-09-10 02:06:54,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:54,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:54,125 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:54,125 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:54,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:54,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1702235704, now seen corresponding path program 1 times [2019-09-10 02:06:54,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:54,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:54,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:54,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:54,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:54,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:54,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-09-10 02:06:54,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:54,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 02:06:54,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 02:06:54,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:06:54,676 INFO L87 Difference]: Start difference. First operand 217 states and 255 transitions. Second operand 35 states. [2019-09-10 02:06:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:55,642 INFO L93 Difference]: Finished difference Result 213 states and 249 transitions. [2019-09-10 02:06:55,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 02:06:55,642 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 143 [2019-09-10 02:06:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:55,644 INFO L225 Difference]: With dead ends: 213 [2019-09-10 02:06:55,644 INFO L226 Difference]: Without dead ends: 213 [2019-09-10 02:06:55,645 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-10 02:06:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-10 02:06:55,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-09-10 02:06:55,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-10 02:06:55,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2019-09-10 02:06:55,649 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 143 [2019-09-10 02:06:55,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:55,649 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2019-09-10 02:06:55,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 02:06:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2019-09-10 02:06:55,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:55,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:55,651 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-10 02:06:55,651 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:55,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:55,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2011984104, now seen corresponding path program 1 times [2019-09-10 02:06:55,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:55,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:55,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:55,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:55,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:56,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:56,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2019-09-10 02:06:56,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:56,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 02:06:56,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 02:06:56,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:06:56,402 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand 39 states. [2019-09-10 02:06:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:58,211 INFO L93 Difference]: Finished difference Result 205 states and 237 transitions. [2019-09-10 02:06:58,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 02:06:58,211 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 143 [2019-09-10 02:06:58,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:58,213 INFO L225 Difference]: With dead ends: 205 [2019-09-10 02:06:58,213 INFO L226 Difference]: Without dead ends: 205 [2019-09-10 02:06:58,214 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-10 02:06:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-10 02:06:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-09-10 02:06:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-10 02:06:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 237 transitions. [2019-09-10 02:06:58,219 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 237 transitions. Word has length 143 [2019-09-10 02:06:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:58,219 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 237 transitions. [2019-09-10 02:06:58,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 02:06:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 237 transitions. [2019-09-10 02:06:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:06:58,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:58,220 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-10 02:06:58,221 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:58,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:58,221 INFO L82 PathProgramCache]: Analyzing trace with hash 221232183, now seen corresponding path program 1 times [2019-09-10 02:06:58,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:58,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:58,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:58,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:58,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:59,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:59,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-09-10 02:06:59,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:59,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 02:06:59,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 02:06:59,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:06:59,096 INFO L87 Difference]: Start difference. First operand 205 states and 237 transitions. Second operand 40 states. [2019-09-10 02:07:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:01,074 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2019-09-10 02:07:01,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 02:07:01,074 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 143 [2019-09-10 02:07:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:01,076 INFO L225 Difference]: With dead ends: 203 [2019-09-10 02:07:01,076 INFO L226 Difference]: Without dead ends: 203 [2019-09-10 02:07:01,077 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-10 02:07:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-10 02:07:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-09-10 02:07:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-10 02:07:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 234 transitions. [2019-09-10 02:07:01,082 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 234 transitions. Word has length 143 [2019-09-10 02:07:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:01,083 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 234 transitions. [2019-09-10 02:07:01,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 02:07:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 234 transitions. [2019-09-10 02:07:01,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:07:01,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:01,084 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-10 02:07:01,084 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:01,085 INFO L82 PathProgramCache]: Analyzing trace with hash 500367692, now seen corresponding path program 1 times [2019-09-10 02:07:01,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:01,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:01,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:01,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:01,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:01,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:07:01,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2019-09-10 02:07:01,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:07:01,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 02:07:01,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 02:07:01,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:07:01,836 INFO L87 Difference]: Start difference. First operand 203 states and 234 transitions. Second operand 41 states. [2019-09-10 02:07:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:03,670 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2019-09-10 02:07:03,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 02:07:03,671 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 143 [2019-09-10 02:07:03,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:03,672 INFO L225 Difference]: With dead ends: 201 [2019-09-10 02:07:03,673 INFO L226 Difference]: Without dead ends: 201 [2019-09-10 02:07:03,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:07:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-10 02:07:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-09-10 02:07:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-10 02:07:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2019-09-10 02:07:03,678 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 143 [2019-09-10 02:07:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:03,678 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2019-09-10 02:07:03,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 02:07:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2019-09-10 02:07:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:07:03,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:03,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:03,680 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:03,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1383526833, now seen corresponding path program 1 times [2019-09-10 02:07:03,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:03,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:03,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:03,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:03,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:04,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:04,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:07:04,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2019-09-10 02:07:04,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:07:04,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 02:07:04,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 02:07:04,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 02:07:04,383 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand 44 states. [2019-09-10 02:07:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:06,044 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2019-09-10 02:07:06,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:07:06,047 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 143 [2019-09-10 02:07:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:06,048 INFO L225 Difference]: With dead ends: 195 [2019-09-10 02:07:06,048 INFO L226 Difference]: Without dead ends: 195 [2019-09-10 02:07:06,049 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-10 02:07:06,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-10 02:07:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-09-10 02:07:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-10 02:07:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2019-09-10 02:07:06,054 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 143 [2019-09-10 02:07:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:06,054 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2019-09-10 02:07:06,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 02:07:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2019-09-10 02:07:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:07:06,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:06,056 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:06,056 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash -595537121, now seen corresponding path program 1 times [2019-09-10 02:07:06,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:06,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:06,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:06,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:06,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:07,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:07:07,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2019-09-10 02:07:07,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:07:07,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 02:07:07,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 02:07:07,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:07:07,072 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand 46 states. [2019-09-10 02:07:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:08,377 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2019-09-10 02:07:08,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 02:07:08,377 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 143 [2019-09-10 02:07:08,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:08,379 INFO L225 Difference]: With dead ends: 191 [2019-09-10 02:07:08,379 INFO L226 Difference]: Without dead ends: 191 [2019-09-10 02:07:08,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:07:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-10 02:07:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-09-10 02:07:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-10 02:07:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2019-09-10 02:07:08,384 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 143 [2019-09-10 02:07:08,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:08,385 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2019-09-10 02:07:08,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 02:07:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2019-09-10 02:07:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:07:08,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:08,386 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-10 02:07:08,386 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:08,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:08,386 INFO L82 PathProgramCache]: Analyzing trace with hash -830587144, now seen corresponding path program 1 times [2019-09-10 02:07:08,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:08,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:08,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:08,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:08,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:09,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:07:09,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2019-09-10 02:07:09,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:07:09,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 02:07:09,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 02:07:09,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:07:09,210 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand 47 states. [2019-09-10 02:07:12,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:12,268 INFO L93 Difference]: Finished difference Result 189 states and 213 transitions. [2019-09-10 02:07:12,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 02:07:12,269 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 143 [2019-09-10 02:07:12,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:12,271 INFO L225 Difference]: With dead ends: 189 [2019-09-10 02:07:12,271 INFO L226 Difference]: Without dead ends: 189 [2019-09-10 02:07:12,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:07:12,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-10 02:07:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-09-10 02:07:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-10 02:07:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2019-09-10 02:07:12,276 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 143 [2019-09-10 02:07:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:12,276 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2019-09-10 02:07:12,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 02:07:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2019-09-10 02:07:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:07:12,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:12,277 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-10 02:07:12,278 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:12,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:12,278 INFO L82 PathProgramCache]: Analyzing trace with hash -228626292, now seen corresponding path program 1 times [2019-09-10 02:07:12,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:12,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:12,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:13,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:07:13,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2019-09-10 02:07:13,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:07:13,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 02:07:13,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 02:07:13,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 02:07:13,117 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand 49 states. [2019-09-10 02:07:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:15,261 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2019-09-10 02:07:15,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 02:07:15,262 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 143 [2019-09-10 02:07:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:15,264 INFO L225 Difference]: With dead ends: 185 [2019-09-10 02:07:15,264 INFO L226 Difference]: Without dead ends: 185 [2019-09-10 02:07:15,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 02:07:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-10 02:07:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-09-10 02:07:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-10 02:07:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2019-09-10 02:07:15,268 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 143 [2019-09-10 02:07:15,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:15,269 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2019-09-10 02:07:15,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 02:07:15,269 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2019-09-10 02:07:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:07:15,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:15,270 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:15,271 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:15,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:15,271 INFO L82 PathProgramCache]: Analyzing trace with hash 679538168, now seen corresponding path program 1 times [2019-09-10 02:07:15,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:15,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:15,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:15,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:15,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:16,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:07:16,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2019-09-10 02:07:16,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:07:16,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-10 02:07:16,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-10 02:07:16,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:07:16,431 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand 51 states. [2019-09-10 02:07:17,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:17,925 INFO L93 Difference]: Finished difference Result 181 states and 201 transitions. [2019-09-10 02:07:17,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 02:07:17,926 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 143 [2019-09-10 02:07:17,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:17,927 INFO L225 Difference]: With dead ends: 181 [2019-09-10 02:07:17,927 INFO L226 Difference]: Without dead ends: 181 [2019-09-10 02:07:17,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:07:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-10 02:07:17,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-09-10 02:07:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-10 02:07:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 201 transitions. [2019-09-10 02:07:17,932 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 201 transitions. Word has length 143 [2019-09-10 02:07:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:17,933 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 201 transitions. [2019-09-10 02:07:17,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-10 02:07:17,933 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 201 transitions. [2019-09-10 02:07:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:07:17,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:17,934 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-10 02:07:17,934 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:17,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:17,934 INFO L82 PathProgramCache]: Analyzing trace with hash -200266664, now seen corresponding path program 1 times [2019-09-10 02:07:17,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:17,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:17,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:17,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:17,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:19,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:07:19,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2019-09-10 02:07:19,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:07:19,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-10 02:07:19,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-10 02:07:19,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:07:19,076 INFO L87 Difference]: Start difference. First operand 181 states and 201 transitions. Second operand 53 states. [2019-09-10 02:07:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:20,054 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2019-09-10 02:07:20,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 02:07:20,054 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 143 [2019-09-10 02:07:20,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:20,055 INFO L225 Difference]: With dead ends: 147 [2019-09-10 02:07:20,056 INFO L226 Difference]: Without dead ends: 147 [2019-09-10 02:07:20,057 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-10 02:07:20,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-10 02:07:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-09-10 02:07:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-10 02:07:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-09-10 02:07:20,060 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2019-09-10 02:07:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:20,060 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-09-10 02:07:20,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-10 02:07:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-09-10 02:07:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:07:20,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:20,061 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-10 02:07:20,061 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:20,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:20,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1774383300, now seen corresponding path program 1 times [2019-09-10 02:07:20,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:20,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:20,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:20,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:22,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:07:22,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2019-09-10 02:07:22,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:07:22,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-10 02:07:22,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-10 02:07:22,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 02:07:22,093 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 70 states. [2019-09-10 02:07:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:23,992 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-09-10 02:07:23,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 02:07:23,993 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 143 [2019-09-10 02:07:23,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:23,994 INFO L225 Difference]: With dead ends: 147 [2019-09-10 02:07:23,995 INFO L226 Difference]: Without dead ends: 147 [2019-09-10 02:07:23,997 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-10 02:07:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-10 02:07:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-09-10 02:07:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-10 02:07:24,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-09-10 02:07:24,000 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-09-10 02:07:24,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:24,000 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-09-10 02:07:24,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-10 02:07:24,001 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-09-10 02:07:24,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 02:07:24,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:24,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, 1, 1] [2019-09-10 02:07:24,002 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:24,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:24,002 INFO L82 PathProgramCache]: Analyzing trace with hash -87860138, now seen corresponding path program 1 times [2019-09-10 02:07:24,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:24,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:24,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:24,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:24,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:25,972 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-10 02:07:25,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:25,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:25,974 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 02:07:25,976 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-10 02:07:26,017 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:07:26,018 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:07:26,174 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:07:26,177 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-10 02:07:26,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:26,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:07:26,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:26,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:07:26,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:26,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:26,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-10 02:07:26,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:26,428 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-10 02:07:26,428 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:07:29,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:29,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 102 [2019-09-10 02:07:29,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:29,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-10 02:07:29,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-10 02:07:29,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:29,986 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 71 states. [2019-09-10 02:07:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:32,877 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-09-10 02:07:32,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-10 02:07:32,878 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 145 [2019-09-10 02:07:32,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:32,880 INFO L225 Difference]: With dead ends: 149 [2019-09-10 02:07:32,880 INFO L226 Difference]: Without dead ends: 149 [2019-09-10 02:07:32,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 222 SyntacticMatches, 38 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1881 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:32,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-10 02:07:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-09-10 02:07:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-10 02:07:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-09-10 02:07:32,886 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2019-09-10 02:07:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:32,886 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-09-10 02:07:32,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-10 02:07:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-09-10 02:07:32,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 02:07:32,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:32,888 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-10 02:07:32,888 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:32,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:32,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1458227952, now seen corresponding path program 2 times [2019-09-10 02:07:32,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:32,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:32,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:32,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:32,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:34,876 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-10 02:07:34,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:34,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:34,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:34,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:34,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:34,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:34,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:34,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:34,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 02:07:34,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:34,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-10 02:07:34,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:35,009 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-10 02:07:35,010 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:38,180 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-10 02:07:38,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:38,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 102 [2019-09-10 02:07:38,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:38,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-10 02:07:38,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-10 02:07:38,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:38,186 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 72 states. [2019-09-10 02:07:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:41,112 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-09-10 02:07:41,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-10 02:07:41,112 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 147 [2019-09-10 02:07:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:41,113 INFO L225 Difference]: With dead ends: 151 [2019-09-10 02:07:41,113 INFO L226 Difference]: Without dead ends: 151 [2019-09-10 02:07:41,114 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-10 02:07:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-10 02:07:41,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-09-10 02:07:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:07:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-09-10 02:07:41,119 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2019-09-10 02:07:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:41,119 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2019-09-10 02:07:41,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-10 02:07:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2019-09-10 02:07:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 02:07:41,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:41,120 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-10 02:07:41,120 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:41,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:41,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1190198026, now seen corresponding path program 3 times [2019-09-10 02:07:41,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:41,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:41,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:41,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:41,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:42,986 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-10 02:07:42,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:42,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:42,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:42,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:42,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:42,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:42,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:42,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:43,050 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:43,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:43,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-10 02:07:43,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:43,097 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-10 02:07:43,097 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:46,301 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-10 02:07:46,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:46,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 102 [2019-09-10 02:07:46,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:46,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-10 02:07:46,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-10 02:07:46,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:46,307 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 73 states. [2019-09-10 02:07:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:49,145 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-09-10 02:07:49,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-10 02:07:49,146 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 149 [2019-09-10 02:07:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:49,147 INFO L225 Difference]: With dead ends: 153 [2019-09-10 02:07:49,147 INFO L226 Difference]: Without dead ends: 153 [2019-09-10 02:07:49,148 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-10 02:07:49,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-10 02:07:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-09-10 02:07:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-10 02:07:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-09-10 02:07:49,153 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2019-09-10 02:07:49,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:49,153 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-09-10 02:07:49,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-10 02:07:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-09-10 02:07:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 02:07:49,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:49,154 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-10 02:07:49,155 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:49,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:49,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1311476900, now seen corresponding path program 4 times [2019-09-10 02:07:49,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:49,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:49,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:49,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:49,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:51,043 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-10 02:07:51,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:51,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:51,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:51,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:51,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:51,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:51,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:51,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:51,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-10 02:07:51,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:51,163 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-10 02:07:51,163 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:54,468 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-10 02:07:54,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:54,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 102 [2019-09-10 02:07:54,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:54,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-10 02:07:54,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-10 02:07:54,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:54,474 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 74 states. [2019-09-10 02:07:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:57,265 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-09-10 02:07:57,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-10 02:07:57,266 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 151 [2019-09-10 02:07:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:57,267 INFO L225 Difference]: With dead ends: 155 [2019-09-10 02:07:57,267 INFO L226 Difference]: Without dead ends: 155 [2019-09-10 02:07:57,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 231 SyntacticMatches, 44 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2178 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-10 02:07:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-09-10 02:07:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-10 02:07:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-09-10 02:07:57,272 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2019-09-10 02:07:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:57,272 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-09-10 02:07:57,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-10 02:07:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-09-10 02:07:57,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 02:07:57,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:57,274 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-10 02:07:57,274 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:57,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:57,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1896357822, now seen corresponding path program 5 times [2019-09-10 02:07:57,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:57,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:57,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:59,286 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-10 02:07:59,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:59,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:59,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:59,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:59,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:59,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:59,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:59,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:59,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 02:07:59,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:59,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-10 02:07:59,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:59,397 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-10 02:07:59,397 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:02,667 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-10 02:08:02,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:02,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 102 [2019-09-10 02:08:02,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:02,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-10 02:08:02,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-10 02:08:02,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:02,674 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 75 states. [2019-09-10 02:08:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:04,262 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-09-10 02:08:04,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-10 02:08:04,262 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 153 [2019-09-10 02:08:04,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:04,264 INFO L225 Difference]: With dead ends: 157 [2019-09-10 02:08:04,264 INFO L226 Difference]: Without dead ends: 157 [2019-09-10 02:08:04,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 234 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-10 02:08:04,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-09-10 02:08:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-10 02:08:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-09-10 02:08:04,269 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2019-09-10 02:08:04,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:04,269 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-09-10 02:08:04,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-10 02:08:04,269 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-09-10 02:08:04,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 02:08:04,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:04,270 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-10 02:08:04,270 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:04,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:04,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1326208088, now seen corresponding path program 6 times [2019-09-10 02:08:04,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:04,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:04,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:04,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:04,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:06,404 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-10 02:08:06,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:06,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:06,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:06,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:06,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:06,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:06,414 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:06,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:06,465 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:06,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:06,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-10 02:08:06,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:06,502 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-10 02:08:06,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:09,661 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-10 02:08:09,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:09,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 102 [2019-09-10 02:08:09,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:09,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-10 02:08:09,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-10 02:08:09,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:09,667 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 76 states. [2019-09-10 02:08:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:12,486 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-09-10 02:08:12,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-10 02:08:12,486 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 155 [2019-09-10 02:08:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:12,488 INFO L225 Difference]: With dead ends: 159 [2019-09-10 02:08:12,488 INFO L226 Difference]: Without dead ends: 159 [2019-09-10 02:08:12,489 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-10 02:08:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-10 02:08:12,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-09-10 02:08:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-10 02:08:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-09-10 02:08:12,493 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2019-09-10 02:08:12,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:12,493 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-09-10 02:08:12,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-10 02:08:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-09-10 02:08:12,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 02:08:12,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:12,494 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-10 02:08:12,495 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:12,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:12,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1126839694, now seen corresponding path program 7 times [2019-09-10 02:08:12,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:12,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:12,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:12,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:12,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:14,565 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-10 02:08:14,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:14,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:14,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:14,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:14,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:14,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:14,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:14,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:14,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-10 02:08:14,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:14,666 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-10 02:08:14,666 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:17,836 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-10 02:08:17,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:17,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 102 [2019-09-10 02:08:17,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:17,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-10 02:08:17,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-10 02:08:17,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:17,841 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 77 states. [2019-09-10 02:08:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:19,541 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-09-10 02:08:19,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-10 02:08:19,541 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 157 [2019-09-10 02:08:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:19,543 INFO L225 Difference]: With dead ends: 161 [2019-09-10 02:08:19,543 INFO L226 Difference]: Without dead ends: 161 [2019-09-10 02:08:19,544 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-10 02:08:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-10 02:08:19,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-09-10 02:08:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:08:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-09-10 02:08:19,547 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2019-09-10 02:08:19,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:19,548 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-09-10 02:08:19,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-10 02:08:19,548 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-09-10 02:08:19,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 02:08:19,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:19,549 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-10 02:08:19,549 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:19,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:19,550 INFO L82 PathProgramCache]: Analyzing trace with hash -568712692, now seen corresponding path program 8 times [2019-09-10 02:08:19,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:19,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:19,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:19,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:19,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:21,690 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-10 02:08:21,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:21,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:21,690 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:21,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:21,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:21,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:21,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:21,704 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:21,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 02:08:21,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:21,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-10 02:08:21,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:21,799 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-10 02:08:21,799 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:25,022 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-10 02:08:25,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:25,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 102 [2019-09-10 02:08:25,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:25,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-10 02:08:25,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-10 02:08:25,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:25,028 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 78 states. [2019-09-10 02:08:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:27,871 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-09-10 02:08:27,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-10 02:08:27,871 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 159 [2019-09-10 02:08:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:27,873 INFO L225 Difference]: With dead ends: 163 [2019-09-10 02:08:27,873 INFO L226 Difference]: Without dead ends: 163 [2019-09-10 02:08:27,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 243 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2574 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-10 02:08:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-09-10 02:08:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-10 02:08:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-09-10 02:08:27,877 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2019-09-10 02:08:27,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:27,878 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-09-10 02:08:27,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-10 02:08:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-09-10 02:08:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 02:08:27,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:27,879 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-10 02:08:27,879 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:27,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1079575770, now seen corresponding path program 9 times [2019-09-10 02:08:27,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:27,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:27,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:27,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:30,076 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-10 02:08:30,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:30,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:30,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:30,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:30,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:30,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:30,086 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:30,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:30,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:30,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:30,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-10 02:08:30,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:30,184 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-10 02:08:30,184 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:33,425 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-10 02:08:33,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:33,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 102 [2019-09-10 02:08:33,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:33,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-10 02:08:33,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-10 02:08:33,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:33,431 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 79 states. [2019-09-10 02:08:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:36,330 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-09-10 02:08:36,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-10 02:08:36,330 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 161 [2019-09-10 02:08:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:36,332 INFO L225 Difference]: With dead ends: 165 [2019-09-10 02:08:36,332 INFO L226 Difference]: Without dead ends: 165 [2019-09-10 02:08:36,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 246 SyntacticMatches, 54 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:36,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-10 02:08:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-09-10 02:08:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-10 02:08:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-09-10 02:08:36,336 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2019-09-10 02:08:36,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:36,336 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-09-10 02:08:36,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-10 02:08:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-09-10 02:08:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 02:08:36,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:36,337 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-10 02:08:36,337 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:36,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:36,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1902245312, now seen corresponding path program 10 times [2019-09-10 02:08:36,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:36,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:36,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:36,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:36,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:38,624 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-10 02:08:38,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:38,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:38,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:38,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:38,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:38,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:38,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:38,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:38,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-10 02:08:38,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:38,721 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-10 02:08:38,721 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:41,966 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-10 02:08:41,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:41,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 102 [2019-09-10 02:08:41,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:41,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-10 02:08:41,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-10 02:08:41,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:41,976 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 80 states. [2019-09-10 02:08:44,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:44,341 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-09-10 02:08:44,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-10 02:08:44,342 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 163 [2019-09-10 02:08:44,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:44,343 INFO L225 Difference]: With dead ends: 167 [2019-09-10 02:08:44,343 INFO L226 Difference]: Without dead ends: 167 [2019-09-10 02:08:44,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 249 SyntacticMatches, 56 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2772 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:44,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-10 02:08:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-09-10 02:08:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-10 02:08:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-09-10 02:08:44,348 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2019-09-10 02:08:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:44,348 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-09-10 02:08:44,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-10 02:08:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-09-10 02:08:44,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 02:08:44,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:44,349 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-10 02:08:44,349 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:44,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:44,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1605848614, now seen corresponding path program 11 times [2019-09-10 02:08:44,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:44,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:44,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:44,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:44,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:46,600 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-10 02:08:46,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:46,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:46,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:46,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:46,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:46,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:46,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:46,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:46,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 02:08:46,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:46,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-10 02:08:46,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:46,730 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-10 02:08:46,730 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:50,050 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-10 02:08:50,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:50,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 102 [2019-09-10 02:08:50,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:50,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-10 02:08:50,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-10 02:08:50,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:50,056 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 81 states. [2019-09-10 02:08:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:52,606 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-09-10 02:08:52,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-10 02:08:52,606 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 165 [2019-09-10 02:08:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:52,608 INFO L225 Difference]: With dead ends: 169 [2019-09-10 02:08:52,608 INFO L226 Difference]: Without dead ends: 169 [2019-09-10 02:08:52,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 252 SyntacticMatches, 58 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:52,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-10 02:08:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-09-10 02:08:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-10 02:08:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-09-10 02:08:52,614 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2019-09-10 02:08:52,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:52,614 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2019-09-10 02:08:52,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-10 02:08:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2019-09-10 02:08:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 02:08:52,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:52,615 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-10 02:08:52,616 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:52,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:52,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1334784140, now seen corresponding path program 12 times [2019-09-10 02:08:52,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:52,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:52,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:52,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:52,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:54,851 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-10 02:08:54,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:54,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:54,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:54,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:54,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:54,852 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) [2019-09-10 02:08:54,869 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:54,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:54,925 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:54,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:54,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-10 02:08:54,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:54,968 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-10 02:08:54,968 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:58,266 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-10 02:08:58,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:58,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 102 [2019-09-10 02:08:58,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:58,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-10 02:08:58,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-10 02:08:58,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:58,280 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 82 states. [2019-09-10 02:09:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:01,160 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-09-10 02:09:01,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-10 02:09:01,161 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 167 [2019-09-10 02:09:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:01,162 INFO L225 Difference]: With dead ends: 171 [2019-09-10 02:09:01,163 INFO L226 Difference]: Without dead ends: 171 [2019-09-10 02:09:01,164 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-10 02:09:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-10 02:09:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-09-10 02:09:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:09:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-09-10 02:09:01,167 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2019-09-10 02:09:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:01,167 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-09-10 02:09:01,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-10 02:09:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-09-10 02:09:01,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 02:09:01,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:01,168 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-10 02:09:01,169 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:01,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:01,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1460137614, now seen corresponding path program 13 times [2019-09-10 02:09:01,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:01,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:01,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:01,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:01,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:03,468 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-10 02:09:03,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:03,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:03,468 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:03,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:03,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:03,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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:03,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:03,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:03,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-10 02:09:03,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:03,571 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-10 02:09:03,571 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:06,843 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-10 02:09:06,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:06,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 102 [2019-09-10 02:09:06,847 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:06,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-10 02:09:06,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-10 02:09:06,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:06,848 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 83 states. [2019-09-10 02:09:09,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:09,710 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-09-10 02:09:09,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-10 02:09:09,711 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 169 [2019-09-10 02:09:09,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:09,712 INFO L225 Difference]: With dead ends: 173 [2019-09-10 02:09:09,712 INFO L226 Difference]: Without dead ends: 173 [2019-09-10 02:09:09,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 258 SyntacticMatches, 62 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3069 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-10 02:09:09,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-10 02:09:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-10 02:09:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-09-10 02:09:09,717 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2019-09-10 02:09:09,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:09,718 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-09-10 02:09:09,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-10 02:09:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-09-10 02:09:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 02:09:09,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:09,719 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-10 02:09:09,719 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:09,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:09,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1269584088, now seen corresponding path program 14 times [2019-09-10 02:09:09,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:09,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:09,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:09,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:09,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:12,158 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-10 02:09:12,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:12,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:12,159 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:12,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:12,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:12,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:12,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:12,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:12,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 02:09:12,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:12,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-10 02:09:12,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:12,271 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-10 02:09:12,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:15,486 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-10 02:09:15,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:15,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 102 [2019-09-10 02:09:15,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:15,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-10 02:09:15,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-10 02:09:15,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:15,498 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 84 states. [2019-09-10 02:09:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:17,098 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-09-10 02:09:17,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-10 02:09:17,099 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 171 [2019-09-10 02:09:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:17,100 INFO L225 Difference]: With dead ends: 175 [2019-09-10 02:09:17,101 INFO L226 Difference]: Without dead ends: 175 [2019-09-10 02:09:17,101 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-10 02:09:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-10 02:09:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-09-10 02:09:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-10 02:09:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-09-10 02:09:17,105 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2019-09-10 02:09:17,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:17,105 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2019-09-10 02:09:17,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-10 02:09:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2019-09-10 02:09:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 02:09:17,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:17,107 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-10 02:09:17,107 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:17,107 INFO L82 PathProgramCache]: Analyzing trace with hash -307121854, now seen corresponding path program 15 times [2019-09-10 02:09:17,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:17,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:17,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:17,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:17,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:19,594 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-10 02:09:19,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:19,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:19,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:19,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:19,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:19,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:19,605 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:19,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:19,658 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:19,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:19,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-10 02:09:19,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:19,699 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-10 02:09:19,700 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:23,036 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-10 02:09:23,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:23,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 102 [2019-09-10 02:09:23,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:23,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-10 02:09:23,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-10 02:09:23,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:23,042 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 85 states. [2019-09-10 02:09:25,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:25,914 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-09-10 02:09:25,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-10 02:09:25,914 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 173 [2019-09-10 02:09:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:25,915 INFO L225 Difference]: With dead ends: 177 [2019-09-10 02:09:25,915 INFO L226 Difference]: Without dead ends: 177 [2019-09-10 02:09:25,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 264 SyntacticMatches, 66 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-10 02:09:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-09-10 02:09:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-10 02:09:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-09-10 02:09:25,919 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2019-09-10 02:09:25,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:25,919 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-09-10 02:09:25,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-10 02:09:25,919 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-09-10 02:09:25,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 02:09:25,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:25,920 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-10 02:09:25,921 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:25,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:25,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1201116380, now seen corresponding path program 16 times [2019-09-10 02:09:25,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:25,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:25,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:25,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:25,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:28,444 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-10 02:09:28,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:28,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:28,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:28,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:28,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:28,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:28,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:28,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:28,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-10 02:09:28,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:28,567 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-10 02:09:28,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:31,906 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-10 02:09:31,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:31,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 102 [2019-09-10 02:09:31,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:31,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-10 02:09:31,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-10 02:09:31,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:31,911 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 86 states. [2019-09-10 02:09:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:34,075 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-09-10 02:09:34,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-10 02:09:34,076 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 175 [2019-09-10 02:09:34,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:34,077 INFO L225 Difference]: With dead ends: 179 [2019-09-10 02:09:34,077 INFO L226 Difference]: Without dead ends: 179 [2019-09-10 02:09:34,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 267 SyntacticMatches, 68 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3366 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-10 02:09:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-09-10 02:09:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-10 02:09:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-09-10 02:09:34,081 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2019-09-10 02:09:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:34,081 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-09-10 02:09:34,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-10 02:09:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-09-10 02:09:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 02:09:34,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:34,083 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-10 02:09:34,083 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:34,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:34,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1080886794, now seen corresponding path program 17 times [2019-09-10 02:09:34,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:34,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:34,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:34,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:34,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:36,684 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-10 02:09:36,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:36,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:36,684 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:36,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:36,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:36,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:36,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:36,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:36,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 02:09:36,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:36,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-10 02:09:36,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:36,809 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-10 02:09:36,809 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:40,113 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-10 02:09:40,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:40,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 102 [2019-09-10 02:09:40,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:40,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-10 02:09:40,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-10 02:09:40,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:40,119 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 87 states. [2019-09-10 02:09:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:41,791 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-09-10 02:09:41,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-10 02:09:41,792 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 177 [2019-09-10 02:09:41,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:41,793 INFO L225 Difference]: With dead ends: 181 [2019-09-10 02:09:41,793 INFO L226 Difference]: Without dead ends: 181 [2019-09-10 02:09:41,794 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-10 02:09:41,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-10 02:09:41,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-10 02:09:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:09:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-09-10 02:09:41,798 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2019-09-10 02:09:41,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:41,798 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-09-10 02:09:41,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-10 02:09:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-09-10 02:09:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 02:09:41,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:41,800 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-10 02:09:41,800 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:41,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:41,800 INFO L82 PathProgramCache]: Analyzing trace with hash 642351248, now seen corresponding path program 18 times [2019-09-10 02:09:41,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:41,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:41,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:41,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:41,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:44,384 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-10 02:09:44,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:44,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:44,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:44,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:44,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:44,386 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-10 02:09:44,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:44,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:44,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:44,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:44,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-10 02:09:44,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:44,510 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-10 02:09:44,511 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:47,820 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-10 02:09:47,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:47,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 102 [2019-09-10 02:09:47,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:47,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-10 02:09:47,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-10 02:09:47,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:47,827 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 88 states. [2019-09-10 02:09:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:49,952 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-09-10 02:09:49,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-10 02:09:49,952 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 179 [2019-09-10 02:09:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:49,954 INFO L225 Difference]: With dead ends: 183 [2019-09-10 02:09:49,954 INFO L226 Difference]: Without dead ends: 183 [2019-09-10 02:09:49,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 273 SyntacticMatches, 72 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-10 02:09:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-09-10 02:09:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-10 02:09:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-09-10 02:09:49,958 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2019-09-10 02:09:49,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:49,958 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-09-10 02:09:49,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-10 02:09:49,959 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-09-10 02:09:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 02:09:49,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:49,959 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-10 02:09:49,959 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:49,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1183266646, now seen corresponding path program 19 times [2019-09-10 02:09:49,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:49,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:49,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:49,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:49,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:52,614 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-10 02:09:52,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:52,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:52,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:52,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:52,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:52,615 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-10 02:09:52,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:52,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:52,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-10 02:09:52,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:52,739 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-10 02:09:52,739 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:56,087 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-10 02:09:56,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:56,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 102 [2019-09-10 02:09:56,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:56,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-10 02:09:56,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-10 02:09:56,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:56,097 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 89 states. [2019-09-10 02:09:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:58,111 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-09-10 02:09:58,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 02:09:58,112 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 181 [2019-09-10 02:09:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:58,113 INFO L225 Difference]: With dead ends: 185 [2019-09-10 02:09:58,113 INFO L226 Difference]: Without dead ends: 185 [2019-09-10 02:09:58,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 276 SyntacticMatches, 74 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3663 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-10 02:09:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-09-10 02:09:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-10 02:09:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-09-10 02:09:58,117 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2019-09-10 02:09:58,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:58,118 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-09-10 02:09:58,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-10 02:09:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-09-10 02:09:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 02:09:58,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:58,119 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-10 02:09:58,119 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:58,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1039561284, now seen corresponding path program 20 times [2019-09-10 02:09:58,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:58,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:58,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:00,853 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-10 02:10:00,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:00,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:00,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:00,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:00,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:00,854 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-10 02:10:00,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:10:00,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:10:00,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-10 02:10:00,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:00,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-10 02:10:00,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:00,993 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-10 02:10:00,994 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:04,374 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-10 02:10:04,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:04,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 102 [2019-09-10 02:10:04,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:04,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-10 02:10:04,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-10 02:10:04,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:04,383 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 90 states. [2019-09-10 02:10:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:05,996 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-09-10 02:10:05,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 02:10:05,996 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 183 [2019-09-10 02:10:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:05,998 INFO L225 Difference]: With dead ends: 187 [2019-09-10 02:10:05,998 INFO L226 Difference]: Without dead ends: 187 [2019-09-10 02:10:05,999 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-10 02:10:05,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-10 02:10:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-09-10 02:10:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-10 02:10:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-09-10 02:10:06,002 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2019-09-10 02:10:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:06,003 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-09-10 02:10:06,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-10 02:10:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-09-10 02:10:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 02:10:06,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:06,004 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-10 02:10:06,004 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:06,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:06,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1716511394, now seen corresponding path program 21 times [2019-09-10 02:10:06,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:06,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:06,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:06,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:06,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:08,827 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-10 02:10:08,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:08,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:08,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:08,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:08,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:08,828 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-10 02:10:08,838 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:10:08,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:10:08,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:10:08,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:08,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-10 02:10:08,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:08,955 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-10 02:10:08,956 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:12,626 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-10 02:10:12,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:12,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 102 [2019-09-10 02:10:12,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:12,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-10 02:10:12,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-10 02:10:12,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:12,631 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 91 states. [2019-09-10 02:10:15,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:15,445 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-09-10 02:10:15,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-10 02:10:15,445 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 185 [2019-09-10 02:10:15,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:15,446 INFO L225 Difference]: With dead ends: 189 [2019-09-10 02:10:15,446 INFO L226 Difference]: Without dead ends: 189 [2019-09-10 02:10:15,447 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-10 02:10:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-10 02:10:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-09-10 02:10:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-10 02:10:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-09-10 02:10:15,450 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2019-09-10 02:10:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:15,450 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-09-10 02:10:15,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-10 02:10:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-09-10 02:10:15,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 02:10:15,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:15,452 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-10 02:10:15,452 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:15,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:15,452 INFO L82 PathProgramCache]: Analyzing trace with hash -307533320, now seen corresponding path program 22 times [2019-09-10 02:10:15,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:15,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:15,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:15,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:15,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:18,258 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-10 02:10:18,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:18,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:18,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:18,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:18,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:18,259 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-10 02:10:18,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:18,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:10:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:18,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-10 02:10:18,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:18,370 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-10 02:10:18,370 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:21,731 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-10 02:10:21,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:21,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 102 [2019-09-10 02:10:21,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:21,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-10 02:10:21,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-10 02:10:21,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:21,737 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 92 states. [2019-09-10 02:10:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:24,641 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-09-10 02:10:24,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-10 02:10:24,641 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 187 [2019-09-10 02:10:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:24,642 INFO L225 Difference]: With dead ends: 191 [2019-09-10 02:10:24,643 INFO L226 Difference]: Without dead ends: 191 [2019-09-10 02:10:24,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 285 SyntacticMatches, 80 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-10 02:10:24,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-09-10 02:10:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:10:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-09-10 02:10:24,647 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2019-09-10 02:10:24,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:24,647 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-09-10 02:10:24,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-10 02:10:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-09-10 02:10:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 02:10:24,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:24,649 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-10 02:10:24,649 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:24,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:24,649 INFO L82 PathProgramCache]: Analyzing trace with hash 805697554, now seen corresponding path program 23 times [2019-09-10 02:10:24,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:24,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:24,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:24,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:24,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:27,604 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-10 02:10:27,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:27,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:27,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10: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-10 02:10:27,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:27,605 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-10 02:10:27,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:10:27,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:10:27,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-10 02:10:27,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:27,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-10 02:10:27,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:27,755 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-10 02:10:27,756 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:31,129 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-10 02:10:31,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:31,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 102 [2019-09-10 02:10:31,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:31,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-10 02:10:31,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-10 02:10:31,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:31,142 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 93 states. [2019-09-10 02:10:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:33,259 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-09-10 02:10:33,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-10 02:10:33,259 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 189 [2019-09-10 02:10:33,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:33,262 INFO L225 Difference]: With dead ends: 193 [2019-09-10 02:10:33,262 INFO L226 Difference]: Without dead ends: 193 [2019-09-10 02:10:33,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 288 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4059 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:33,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-10 02:10:33,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-09-10 02:10:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-10 02:10:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-09-10 02:10:33,266 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2019-09-10 02:10:33,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:33,266 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-09-10 02:10:33,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-10 02:10:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-09-10 02:10:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 02:10:33,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:33,268 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-10 02:10:33,268 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:33,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1173710764, now seen corresponding path program 24 times [2019-09-10 02:10:33,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:33,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:33,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:33,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:33,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:36,211 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-10 02:10:36,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:36,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:36,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:36,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:36,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:36,212 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-10 02:10:36,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:10:36,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:10:36,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:10:36,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:36,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-10 02:10:36,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:36,336 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-10 02:10:36,336 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:39,669 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-10 02:10:39,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:39,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 102 [2019-09-10 02:10:39,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:39,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-10 02:10:39,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-10 02:10:39,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:39,682 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 94 states. [2019-09-10 02:10:42,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:42,039 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-09-10 02:10:42,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-10 02:10:42,039 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 191 [2019-09-10 02:10:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:42,041 INFO L225 Difference]: With dead ends: 195 [2019-09-10 02:10:42,041 INFO L226 Difference]: Without dead ends: 195 [2019-09-10 02:10:42,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 291 SyntacticMatches, 84 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4158 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-10 02:10:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-09-10 02:10:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-10 02:10:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-09-10 02:10:42,045 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2019-09-10 02:10:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:42,045 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-09-10 02:10:42,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-10 02:10:42,045 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-09-10 02:10:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 02:10:42,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:42,046 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-10 02:10:42,047 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:42,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:42,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1647879994, now seen corresponding path program 25 times [2019-09-10 02:10:42,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:42,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:42,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:42,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:42,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:45,148 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-10 02:10:45,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:45,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:45,148 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:45,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:45,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:45,148 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-10 02:10:45,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:45,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:10:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:45,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-10 02:10:45,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:45,258 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-10 02:10:45,258 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:48,595 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-10 02:10:48,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:48,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 102 [2019-09-10 02:10:48,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:48,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-10 02:10:48,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-10 02:10:48,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:48,601 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 95 states. [2019-09-10 02:10:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:51,522 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-09-10 02:10:51,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-10 02:10:51,523 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 193 [2019-09-10 02:10:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:51,524 INFO L225 Difference]: With dead ends: 197 [2019-09-10 02:10:51,524 INFO L226 Difference]: Without dead ends: 197 [2019-09-10 02:10:51,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 294 SyntacticMatches, 86 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4257 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-10 02:10:51,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-09-10 02:10:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-10 02:10:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-09-10 02:10:51,529 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2019-09-10 02:10:51,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:51,529 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-09-10 02:10:51,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-10 02:10:51,529 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-09-10 02:10:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 02:10:51,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:51,530 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-10 02:10:51,530 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:51,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1222732640, now seen corresponding path program 26 times [2019-09-10 02:10:51,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:51,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:51,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:51,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:51,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:54,557 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-10 02:10:54,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:54,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:54,558 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:54,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:54,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:54,558 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-10 02:10:54,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:10:54,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:10:54,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-10 02:10:54,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:54,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-10 02:10:54,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:54,781 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-10 02:10:54,782 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:58,219 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-10 02:10:58,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:58,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 102 [2019-09-10 02:10:58,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:58,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-10 02:10:58,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-10 02:10:58,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:58,227 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 96 states. [2019-09-10 02:11:01,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:01,140 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-09-10 02:11:01,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-10 02:11:01,140 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 195 [2019-09-10 02:11:01,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:01,141 INFO L225 Difference]: With dead ends: 199 [2019-09-10 02:11:01,141 INFO L226 Difference]: Without dead ends: 199 [2019-09-10 02:11:01,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 297 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-10 02:11:01,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-09-10 02:11:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-10 02:11:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2019-09-10 02:11:01,144 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2019-09-10 02:11:01,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:01,144 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2019-09-10 02:11:01,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-10 02:11:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2019-09-10 02:11:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 02:11:01,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:01,145 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-10 02:11:01,146 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:01,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:01,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1782497414, now seen corresponding path program 27 times [2019-09-10 02:11:01,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:01,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:01,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:01,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:01,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:04,272 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-10 02:11:04,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:04,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:04,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:04,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:04,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:04,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:11:04,288 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:11:04,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:11:04,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:11:04,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:04,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-10 02:11:04,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:04,413 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-10 02:11:04,413 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:07,869 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-10 02:11:07,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:07,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2019-09-10 02:11:07,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:07,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-10 02:11:07,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-10 02:11:07,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:07,880 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 97 states. [2019-09-10 02:11:10,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:10,795 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-09-10 02:11:10,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-10 02:11:10,795 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 197 [2019-09-10 02:11:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:10,796 INFO L225 Difference]: With dead ends: 201 [2019-09-10 02:11:10,796 INFO L226 Difference]: Without dead ends: 201 [2019-09-10 02:11:10,797 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-10 02:11:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-10 02:11:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-09-10 02:11:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:11:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-09-10 02:11:10,799 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2019-09-10 02:11:10,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:10,800 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-09-10 02:11:10,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-10 02:11:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-09-10 02:11:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 02:11:10,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:10,801 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-10 02:11:10,801 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:10,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:10,801 INFO L82 PathProgramCache]: Analyzing trace with hash 704410900, now seen corresponding path program 28 times [2019-09-10 02:11:10,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:10,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:10,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:10,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:10,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:13,981 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-10 02:11:13,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:13,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:13,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:13,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:13,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:13,982 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-10 02:11:13,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:13,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:11:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:14,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-10 02:11:14,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:14,106 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-10 02:11:14,107 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:17,702 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-10 02:11:17,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:17,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 102 [2019-09-10 02:11:17,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:17,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-10 02:11:17,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-10 02:11:17,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:17,708 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 98 states. [2019-09-10 02:11:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:20,665 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-09-10 02:11:20,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-10 02:11:20,666 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 199 [2019-09-10 02:11:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:20,667 INFO L225 Difference]: With dead ends: 203 [2019-09-10 02:11:20,668 INFO L226 Difference]: Without dead ends: 203 [2019-09-10 02:11:20,668 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-10 02:11:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-10 02:11:20,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-09-10 02:11:20,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-10 02:11:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-09-10 02:11:20,672 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2019-09-10 02:11:20,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:20,672 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-09-10 02:11:20,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-10 02:11:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-09-10 02:11:20,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 02:11:20,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:20,674 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-10 02:11:20,674 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:20,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:20,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1673483218, now seen corresponding path program 29 times [2019-09-10 02:11:20,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:20,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:20,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:20,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:20,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:23,936 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-10 02:11:23,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:23,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:23,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:23,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:23,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:23,936 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-10 02:11:23,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:11:23,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:11:24,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-10 02:11:24,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:24,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-10 02:11:24,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:24,271 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-10 02:11:24,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:27,644 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-10 02:11:27,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:27,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 102 [2019-09-10 02:11:27,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:27,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-10 02:11:27,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-10 02:11:27,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:27,650 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 99 states. [2019-09-10 02:11:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:29,580 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-09-10 02:11:29,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-10 02:11:29,581 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 201 [2019-09-10 02:11:29,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:29,582 INFO L225 Difference]: With dead ends: 205 [2019-09-10 02:11:29,583 INFO L226 Difference]: Without dead ends: 205 [2019-09-10 02:11:29,583 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-10 02:11:29,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-10 02:11:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-09-10 02:11:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-10 02:11:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2019-09-10 02:11:29,585 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2019-09-10 02:11:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:29,586 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2019-09-10 02:11:29,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-10 02:11:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2019-09-10 02:11:29,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 02:11:29,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:29,587 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-10 02:11:29,587 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:29,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:29,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1907129144, now seen corresponding path program 30 times [2019-09-10 02:11:29,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:29,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:29,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:29,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:29,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:32,875 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-10 02:11:32,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:32,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:32,876 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:32,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:32,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:32,876 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-10 02:11:32,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:11:32,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:11:32,952 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:11:32,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:32,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-10 02:11:32,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:33,007 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-10 02:11:33,007 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:36,389 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-10 02:11:36,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:36,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 102 [2019-09-10 02:11:36,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:36,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-10 02:11:36,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-10 02:11:36,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:36,394 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 100 states. [2019-09-10 02:11:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:39,357 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-09-10 02:11:39,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-10 02:11:39,358 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 203 [2019-09-10 02:11:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:39,359 INFO L225 Difference]: With dead ends: 207 [2019-09-10 02:11:39,359 INFO L226 Difference]: Without dead ends: 207 [2019-09-10 02:11:39,360 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-10 02:11:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-10 02:11:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-09-10 02:11:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-10 02:11:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-09-10 02:11:39,363 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2019-09-10 02:11:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:39,363 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-09-10 02:11:39,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-10 02:11:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-09-10 02:11:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-10 02:11:39,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:39,364 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-10 02:11:39,364 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:39,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:39,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1192402658, now seen corresponding path program 31 times [2019-09-10 02:11:39,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:39,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:39,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:39,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:39,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:42,769 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-10 02:11:42,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:42,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:42,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:42,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:42,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:42,769 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-10 02:11:42,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:42,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:11:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:42,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-10 02:11:42,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:42,891 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-10 02:11:42,892 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:46,312 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-10 02:11:46,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:46,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 102 [2019-09-10 02:11:46,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:46,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-10 02:11:46,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-10 02:11:46,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:46,317 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 101 states. [2019-09-10 02:11:49,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:49,279 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-09-10 02:11:49,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-10 02:11:49,279 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2019-09-10 02:11:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:49,281 INFO L225 Difference]: With dead ends: 209 [2019-09-10 02:11:49,281 INFO L226 Difference]: Without dead ends: 209 [2019-09-10 02:11:49,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 312 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4851 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-10 02:11:49,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-09-10 02:11:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-10 02:11:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-09-10 02:11:49,283 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2019-09-10 02:11:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:49,283 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-09-10 02:11:49,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-10 02:11:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-09-10 02:11:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 02:11:49,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:49,284 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-10 02:11:49,285 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:49,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:49,285 INFO L82 PathProgramCache]: Analyzing trace with hash -864839044, now seen corresponding path program 32 times [2019-09-10 02:11:49,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:49,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:49,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:49,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:49,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:52,702 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-10 02:11:52,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:52,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:52,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:52,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:52,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:52,703 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-10 02:11:52,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:11:52,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:11:52,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-10 02:11:52,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:52,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-10 02:11:52,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:52,865 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-10 02:11:52,865 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:56,255 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-10 02:11:56,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:56,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 102 [2019-09-10 02:11:56,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:56,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-10 02:11:56,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-10 02:11:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:56,261 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 102 states. [2019-09-10 02:11:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:59,251 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-09-10 02:11:59,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-10 02:11:59,252 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2019-09-10 02:11:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:59,253 INFO L225 Difference]: With dead ends: 210 [2019-09-10 02:11:59,253 INFO L226 Difference]: Without dead ends: 210 [2019-09-10 02:11:59,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 315 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:11:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-10 02:11:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-09-10 02:11:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:11:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2019-09-10 02:11:59,257 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2019-09-10 02:11:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:59,257 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2019-09-10 02:11:59,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-10 02:11:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2019-09-10 02:11:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 02:11:59,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:59,258 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-10 02:11:59,259 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:59,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:59,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2105808790, now seen corresponding path program 33 times [2019-09-10 02:11:59,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:59,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:59,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:59,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:59,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:00,904 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-10 02:12:00,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:00,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:00,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:00,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:00,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:00,905 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-10 02:12:00,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:12:00,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:12:00,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:12:00,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:12:00,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-10 02:12:00,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:01,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:12:01,206 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-10 02:12:01,206 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:01,499 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-10 02:12:01,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:01,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2019-09-10 02:12:01,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:01,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 02:12:01,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 02:12:01,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:12:01,505 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 55 states. [2019-09-10 02:12:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:03,359 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2019-09-10 02:12:03,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 02:12:03,360 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-09-10 02:12:03,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:03,362 INFO L225 Difference]: With dead ends: 214 [2019-09-10 02:12:03,362 INFO L226 Difference]: Without dead ends: 213 [2019-09-10 02:12:03,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 416 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 02:12:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-10 02:12:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-09-10 02:12:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-10 02:12:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-09-10 02:12:03,365 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2019-09-10 02:12:03,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:03,366 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-09-10 02:12:03,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 02:12:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-09-10 02:12:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-10 02:12:03,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:03,367 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-10 02:12:03,367 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:03,367 INFO L82 PathProgramCache]: Analyzing trace with hash 745125424, now seen corresponding path program 34 times [2019-09-10 02:12:03,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:03,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:12:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:03,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:04,460 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-10 02:12:04,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:12:04,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-09-10 02:12:04,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:12:04,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 02:12:04,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 02:12:04,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:12:04,463 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 52 states. [2019-09-10 02:12:04,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:04,809 INFO L93 Difference]: Finished difference Result 207 states and 206 transitions. [2019-09-10 02:12:04,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 02:12:04,809 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2019-09-10 02:12:04,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:04,810 INFO L225 Difference]: With dead ends: 207 [2019-09-10 02:12:04,810 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:12:04,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:12:04,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:12:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:12:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:12:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:12:04,811 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-09-10 02:12:04,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:04,812 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:12:04,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 02:12:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:12:04,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:12:04,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:12:04 BoogieIcfgContainer [2019-09-10 02:12:04,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:12:04,818 INFO L168 Benchmark]: Toolchain (without parser) took 338794.17 ms. Allocated memory was 132.6 MB in the beginning and 578.8 MB in the end (delta: 446.2 MB). Free memory was 87.2 MB in the beginning and 367.2 MB in the end (delta: -280.1 MB). Peak memory consumption was 166.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:12:04,818 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 132.6 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:12:04,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 652.47 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 86.9 MB in the beginning and 171.0 MB in the end (delta: -84.1 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:12:04,820 INFO L168 Benchmark]: Boogie Preprocessor took 64.25 ms. Allocated memory is still 199.2 MB. Free memory was 171.0 MB in the beginning and 168.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:12:04,820 INFO L168 Benchmark]: RCFGBuilder took 925.80 ms. Allocated memory is still 199.2 MB. Free memory was 168.5 MB in the beginning and 105.9 MB in the end (delta: 62.6 MB). Peak memory consumption was 62.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:12:04,821 INFO L168 Benchmark]: TraceAbstraction took 337143.35 ms. Allocated memory was 199.2 MB in the beginning and 578.8 MB in the end (delta: 379.6 MB). Free memory was 105.9 MB in the beginning and 367.2 MB in the end (delta: -261.3 MB). Peak memory consumption was 118.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:12:04,823 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 132.6 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 652.47 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 86.9 MB in the beginning and 171.0 MB in the end (delta: -84.1 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.25 ms. Allocated memory is still 199.2 MB. Free memory was 171.0 MB in the beginning and 168.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 925.80 ms. Allocated memory is still 199.2 MB. Free memory was 168.5 MB in the beginning and 105.9 MB in the end (delta: 62.6 MB). Peak memory consumption was 62.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 337143.35 ms. Allocated memory was 199.2 MB in the beginning and 578.8 MB in the end (delta: 379.6 MB). Free memory was 105.9 MB in the beginning and 367.2 MB in the end (delta: -261.3 MB). Peak memory consumption was 118.3 MB. 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, 337.0s OverallTime, 62 OverallIterations, 34 TraceHistogramMax, 123.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4132 SDtfs, 6117 SDslu, 24767 SDs, 0 SdLazy, 200781 SolverSat, 5721 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 97.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15340 GetRequests, 9066 SyntacticMatches, 2210 SemanticMatches, 4064 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109296 ImplicationChecksByTransitivity, 201.0s 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.1s SatisfiabilityAnalysisTime, 206.7s 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...