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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:23:34,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:34,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:34,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:34,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:34,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:34,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:34,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:34,786 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:34,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:34,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:34,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:34,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:34,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:34,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:34,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:34,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:34,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:34,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:34,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:34,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:34,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:34,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:34,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:34,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:34,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:34,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:34,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:34,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:34,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:34,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:34,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:34,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:34,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:34,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:34,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:34,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:34,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:34,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:34,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:34,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:34,831 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:23:34,864 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:34,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:34,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:34,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:34,867 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:34,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:34,868 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:34,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:34,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:34,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:34,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:34,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:34,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:34,871 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:34,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:34,872 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:34,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:34,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:34,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:34,872 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:34,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:34,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:34,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:34,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:34,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:34,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:34,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:34,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:34,874 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:23:35,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:35,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:35,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:35,152 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:35,152 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:35,153 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:23:35,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7e47636/adc307dcd0584084b1c13b289dcc8dbd/FLAGa16a58302 [2019-10-13 21:23:35,807 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:35,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:23:35,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7e47636/adc307dcd0584084b1c13b289dcc8dbd/FLAGa16a58302 [2019-10-13 21:23:36,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7e47636/adc307dcd0584084b1c13b289dcc8dbd [2019-10-13 21:23:36,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:36,081 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:36,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:36,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:36,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:36,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5d4e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36, skipping insertion in model container [2019-10-13 21:23:36,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,095 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:36,166 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:36,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:36,700 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:36,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:36,869 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:36,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36 WrapperNode [2019-10-13 21:23:36,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:36,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:36,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:36,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:36,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:36,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:36,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:36,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:36,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (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-10-13 21:23:37,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:37,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:37,036 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:37,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:37,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:23:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:23:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:23:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:23:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:23:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:23:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:23:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:23:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:23:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:23:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:23:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:38,498 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:38,499 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:23:38,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:38 BoogieIcfgContainer [2019-10-13 21:23:38,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:38,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:38,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:38,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:38,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:36" (1/3) ... [2019-10-13 21:23:38,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5f3bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:38, skipping insertion in model container [2019-10-13 21:23:38,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36" (2/3) ... [2019-10-13 21:23:38,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5f3bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:38, skipping insertion in model container [2019-10-13 21:23:38,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:38" (3/3) ... [2019-10-13 21:23:38,515 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:23:38,525 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:38,547 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:23:38,558 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:23:38,587 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:38,587 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:38,588 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:38,588 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:38,588 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:38,588 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:38,588 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:38,589 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states. [2019-10-13 21:23:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:23:38,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:38,639 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:38,641 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:38,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:38,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1850165601, now seen corresponding path program 1 times [2019-10-13 21:23:38,652 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:38,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256112769] [2019-10-13 21:23:38,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:38,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:38,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:39,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256112769] [2019-10-13 21:23:39,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:39,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:39,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251372771] [2019-10-13 21:23:39,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:39,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:39,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:39,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:39,406 INFO L87 Difference]: Start difference. First operand 310 states. Second operand 3 states. [2019-10-13 21:23:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:39,655 INFO L93 Difference]: Finished difference Result 605 states and 1058 transitions. [2019-10-13 21:23:39,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:39,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-13 21:23:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:39,676 INFO L225 Difference]: With dead ends: 605 [2019-10-13 21:23:39,676 INFO L226 Difference]: Without dead ends: 493 [2019-10-13 21:23:39,681 INFO L600 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-10-13 21:23:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-10-13 21:23:39,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2019-10-13 21:23:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-10-13 21:23:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 730 transitions. [2019-10-13 21:23:39,785 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 730 transitions. Word has length 148 [2019-10-13 21:23:39,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:39,789 INFO L462 AbstractCegarLoop]: Abstraction has 491 states and 730 transitions. [2019-10-13 21:23:39,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 730 transitions. [2019-10-13 21:23:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:23:39,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:39,800 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:39,800 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:39,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:39,801 INFO L82 PathProgramCache]: Analyzing trace with hash -835560269, now seen corresponding path program 1 times [2019-10-13 21:23:39,802 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:39,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932402605] [2019-10-13 21:23:39,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:39,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:39,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:40,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932402605] [2019-10-13 21:23:40,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:40,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:40,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792882829] [2019-10-13 21:23:40,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:40,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:40,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:40,293 INFO L87 Difference]: Start difference. First operand 491 states and 730 transitions. Second operand 4 states. [2019-10-13 21:23:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:40,415 INFO L93 Difference]: Finished difference Result 1423 states and 2113 transitions. [2019-10-13 21:23:40,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:40,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-13 21:23:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:40,421 INFO L225 Difference]: With dead ends: 1423 [2019-10-13 21:23:40,422 INFO L226 Difference]: Without dead ends: 945 [2019-10-13 21:23:40,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:40,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-10-13 21:23:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 943. [2019-10-13 21:23:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-10-13 21:23:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1389 transitions. [2019-10-13 21:23:40,503 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1389 transitions. Word has length 148 [2019-10-13 21:23:40,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:40,504 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1389 transitions. [2019-10-13 21:23:40,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1389 transitions. [2019-10-13 21:23:40,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:23:40,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:40,507 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:40,507 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:40,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:40,508 INFO L82 PathProgramCache]: Analyzing trace with hash -312485947, now seen corresponding path program 1 times [2019-10-13 21:23:40,508 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:40,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541038778] [2019-10-13 21:23:40,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:40,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:40,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:40,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541038778] [2019-10-13 21:23:40,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:40,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:40,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897083030] [2019-10-13 21:23:40,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:40,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:40,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:40,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:40,587 INFO L87 Difference]: Start difference. First operand 943 states and 1389 transitions. Second operand 3 states. [2019-10-13 21:23:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:40,664 INFO L93 Difference]: Finished difference Result 2783 states and 4097 transitions. [2019-10-13 21:23:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:40,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-13 21:23:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:40,675 INFO L225 Difference]: With dead ends: 2783 [2019-10-13 21:23:40,675 INFO L226 Difference]: Without dead ends: 1872 [2019-10-13 21:23:40,679 INFO L600 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-10-13 21:23:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-10-13 21:23:40,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 945. [2019-10-13 21:23:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-10-13 21:23:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1391 transitions. [2019-10-13 21:23:40,746 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1391 transitions. Word has length 149 [2019-10-13 21:23:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:40,747 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1391 transitions. [2019-10-13 21:23:40,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1391 transitions. [2019-10-13 21:23:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:23:40,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:40,750 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:40,750 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:40,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:40,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1358823732, now seen corresponding path program 1 times [2019-10-13 21:23:40,751 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:40,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563838035] [2019-10-13 21:23:40,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:40,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:40,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:41,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563838035] [2019-10-13 21:23:41,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:41,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:41,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875846405] [2019-10-13 21:23:41,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:41,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:41,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:41,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:41,064 INFO L87 Difference]: Start difference. First operand 945 states and 1391 transitions. Second operand 4 states. [2019-10-13 21:23:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:41,164 INFO L93 Difference]: Finished difference Result 1876 states and 2764 transitions. [2019-10-13 21:23:41,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:41,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-13 21:23:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:41,174 INFO L225 Difference]: With dead ends: 1876 [2019-10-13 21:23:41,174 INFO L226 Difference]: Without dead ends: 943 [2019-10-13 21:23:41,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:41,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-10-13 21:23:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2019-10-13 21:23:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-10-13 21:23:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1387 transitions. [2019-10-13 21:23:41,266 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1387 transitions. Word has length 150 [2019-10-13 21:23:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:41,267 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1387 transitions. [2019-10-13 21:23:41,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1387 transitions. [2019-10-13 21:23:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:23:41,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:41,273 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:41,273 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:41,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:41,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1528940934, now seen corresponding path program 1 times [2019-10-13 21:23:41,274 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:41,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422172771] [2019-10-13 21:23:41,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:41,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422172771] [2019-10-13 21:23:41,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:41,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:41,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980786509] [2019-10-13 21:23:41,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:41,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:41,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:41,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:41,465 INFO L87 Difference]: Start difference. First operand 943 states and 1387 transitions. Second operand 3 states. [2019-10-13 21:23:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:41,595 INFO L93 Difference]: Finished difference Result 2159 states and 3193 transitions. [2019-10-13 21:23:41,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:41,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-13 21:23:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:41,605 INFO L225 Difference]: With dead ends: 2159 [2019-10-13 21:23:41,606 INFO L226 Difference]: Without dead ends: 1396 [2019-10-13 21:23:41,608 INFO L600 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-10-13 21:23:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-10-13 21:23:41,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1394. [2019-10-13 21:23:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2019-10-13 21:23:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2025 transitions. [2019-10-13 21:23:41,754 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2025 transitions. Word has length 150 [2019-10-13 21:23:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:41,754 INFO L462 AbstractCegarLoop]: Abstraction has 1394 states and 2025 transitions. [2019-10-13 21:23:41,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:41,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2025 transitions. [2019-10-13 21:23:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:23:41,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:41,759 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:41,759 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:41,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:41,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2049235060, now seen corresponding path program 1 times [2019-10-13 21:23:41,760 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:41,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844911487] [2019-10-13 21:23:41,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:41,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844911487] [2019-10-13 21:23:41,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:41,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:41,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701255002] [2019-10-13 21:23:41,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:41,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:41,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:41,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:41,898 INFO L87 Difference]: Start difference. First operand 1394 states and 2025 transitions. Second operand 3 states. [2019-10-13 21:23:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:42,297 INFO L93 Difference]: Finished difference Result 3707 states and 5443 transitions. [2019-10-13 21:23:42,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:42,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-13 21:23:42,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:42,316 INFO L225 Difference]: With dead ends: 3707 [2019-10-13 21:23:42,317 INFO L226 Difference]: Without dead ends: 2595 [2019-10-13 21:23:42,324 INFO L600 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-10-13 21:23:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2019-10-13 21:23:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2593. [2019-10-13 21:23:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2593 states. [2019-10-13 21:23:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3764 transitions. [2019-10-13 21:23:42,560 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3764 transitions. Word has length 156 [2019-10-13 21:23:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:42,562 INFO L462 AbstractCegarLoop]: Abstraction has 2593 states and 3764 transitions. [2019-10-13 21:23:42,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3764 transitions. [2019-10-13 21:23:42,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:23:42,569 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:42,569 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:42,569 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:42,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:42,570 INFO L82 PathProgramCache]: Analyzing trace with hash 327258095, now seen corresponding path program 1 times [2019-10-13 21:23:42,570 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:42,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839859794] [2019-10-13 21:23:42,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:42,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:42,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:42,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:42,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839859794] [2019-10-13 21:23:42,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:42,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:23:42,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934012918] [2019-10-13 21:23:42,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:23:42,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:42,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:23:42,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:23:42,848 INFO L87 Difference]: Start difference. First operand 2593 states and 3764 transitions. Second operand 6 states. [2019-10-13 21:23:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:43,398 INFO L93 Difference]: Finished difference Result 6395 states and 10006 transitions. [2019-10-13 21:23:43,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:23:43,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-10-13 21:23:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:43,424 INFO L225 Difference]: With dead ends: 6395 [2019-10-13 21:23:43,424 INFO L226 Difference]: Without dead ends: 5489 [2019-10-13 21:23:43,427 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:23:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2019-10-13 21:23:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 5453. [2019-10-13 21:23:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-10-13 21:23:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 8364 transitions. [2019-10-13 21:23:43,727 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 8364 transitions. Word has length 156 [2019-10-13 21:23:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:43,728 INFO L462 AbstractCegarLoop]: Abstraction has 5453 states and 8364 transitions. [2019-10-13 21:23:43,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:23:43,728 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 8364 transitions. [2019-10-13 21:23:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:23:43,734 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:43,734 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:43,734 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:43,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:43,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1936499521, now seen corresponding path program 1 times [2019-10-13 21:23:43,735 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:43,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189017143] [2019-10-13 21:23:43,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:43,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:43,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:44,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189017143] [2019-10-13 21:23:44,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:44,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:23:44,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651174886] [2019-10-13 21:23:44,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:23:44,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:44,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:23:44,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:23:44,039 INFO L87 Difference]: Start difference. First operand 5453 states and 8364 transitions. Second operand 8 states. [2019-10-13 21:23:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:44,437 INFO L93 Difference]: Finished difference Result 9061 states and 14264 transitions. [2019-10-13 21:23:44,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:44,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2019-10-13 21:23:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:44,466 INFO L225 Difference]: With dead ends: 9061 [2019-10-13 21:23:44,467 INFO L226 Difference]: Without dead ends: 5455 [2019-10-13 21:23:44,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:23:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5455 states. [2019-10-13 21:23:44,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5455 to 5453. [2019-10-13 21:23:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-10-13 21:23:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 8328 transitions. [2019-10-13 21:23:44,781 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 8328 transitions. Word has length 156 [2019-10-13 21:23:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:44,781 INFO L462 AbstractCegarLoop]: Abstraction has 5453 states and 8328 transitions. [2019-10-13 21:23:44,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:23:44,781 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 8328 transitions. [2019-10-13 21:23:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:23:44,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:44,787 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:44,788 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:44,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:44,788 INFO L82 PathProgramCache]: Analyzing trace with hash -681147618, now seen corresponding path program 1 times [2019-10-13 21:23:44,789 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:44,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821575522] [2019-10-13 21:23:44,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:44,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:44,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:45,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821575522] [2019-10-13 21:23:45,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:45,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:45,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370363486] [2019-10-13 21:23:45,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:45,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:45,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:45,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:45,057 INFO L87 Difference]: Start difference. First operand 5453 states and 8328 transitions. Second operand 4 states. [2019-10-13 21:23:45,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:45,546 INFO L93 Difference]: Finished difference Result 14216 states and 21721 transitions. [2019-10-13 21:23:45,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:45,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-13 21:23:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:45,589 INFO L225 Difference]: With dead ends: 14216 [2019-10-13 21:23:45,589 INFO L226 Difference]: Without dead ends: 8786 [2019-10-13 21:23:45,602 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8786 states. [2019-10-13 21:23:46,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8786 to 8784. [2019-10-13 21:23:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8784 states. [2019-10-13 21:23:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8784 states to 8784 states and 13279 transitions. [2019-10-13 21:23:46,074 INFO L78 Accepts]: Start accepts. Automaton has 8784 states and 13279 transitions. Word has length 156 [2019-10-13 21:23:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:46,074 INFO L462 AbstractCegarLoop]: Abstraction has 8784 states and 13279 transitions. [2019-10-13 21:23:46,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 8784 states and 13279 transitions. [2019-10-13 21:23:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:23:46,081 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:46,082 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:46,082 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1122789079, now seen corresponding path program 1 times [2019-10-13 21:23:46,082 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:46,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778318897] [2019-10-13 21:23:46,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:46,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:46,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:46,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:46,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778318897] [2019-10-13 21:23:46,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:46,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:46,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325553639] [2019-10-13 21:23:46,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:46,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:46,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:46,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:46,184 INFO L87 Difference]: Start difference. First operand 8784 states and 13279 transitions. Second operand 3 states. [2019-10-13 21:23:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:47,029 INFO L93 Difference]: Finished difference Result 25169 states and 38128 transitions. [2019-10-13 21:23:47,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:47,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-13 21:23:47,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:47,088 INFO L225 Difference]: With dead ends: 25169 [2019-10-13 21:23:47,088 INFO L226 Difference]: Without dead ends: 16843 [2019-10-13 21:23:47,117 INFO L600 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-10-13 21:23:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16843 states. [2019-10-13 21:23:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16843 to 16841. [2019-10-13 21:23:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16841 states. [2019-10-13 21:23:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16841 states to 16841 states and 25210 transitions. [2019-10-13 21:23:48,228 INFO L78 Accepts]: Start accepts. Automaton has 16841 states and 25210 transitions. Word has length 158 [2019-10-13 21:23:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:48,228 INFO L462 AbstractCegarLoop]: Abstraction has 16841 states and 25210 transitions. [2019-10-13 21:23:48,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 16841 states and 25210 transitions. [2019-10-13 21:23:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:23:48,246 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:48,246 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:48,246 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:48,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:48,247 INFO L82 PathProgramCache]: Analyzing trace with hash 725817844, now seen corresponding path program 1 times [2019-10-13 21:23:48,247 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:48,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271291423] [2019-10-13 21:23:48,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:48,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:48,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:48,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271291423] [2019-10-13 21:23:48,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:48,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:48,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9623807] [2019-10-13 21:23:48,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:48,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:48,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:48,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:48,580 INFO L87 Difference]: Start difference. First operand 16841 states and 25210 transitions. Second operand 4 states. [2019-10-13 21:23:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:49,254 INFO L93 Difference]: Finished difference Result 26903 states and 40236 transitions. [2019-10-13 21:23:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:49,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-13 21:23:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:49,292 INFO L225 Difference]: With dead ends: 26903 [2019-10-13 21:23:49,293 INFO L226 Difference]: Without dead ends: 13712 [2019-10-13 21:23:49,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13712 states. [2019-10-13 21:23:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13712 to 13712. [2019-10-13 21:23:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13712 states. [2019-10-13 21:23:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13712 states to 13712 states and 20437 transitions. [2019-10-13 21:23:50,738 INFO L78 Accepts]: Start accepts. Automaton has 13712 states and 20437 transitions. Word has length 158 [2019-10-13 21:23:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:50,739 INFO L462 AbstractCegarLoop]: Abstraction has 13712 states and 20437 transitions. [2019-10-13 21:23:50,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 13712 states and 20437 transitions. [2019-10-13 21:23:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:23:50,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:50,750 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:50,750 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:50,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:50,751 INFO L82 PathProgramCache]: Analyzing trace with hash 579616721, now seen corresponding path program 1 times [2019-10-13 21:23:50,751 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:50,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945818916] [2019-10-13 21:23:50,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:50,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:50,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:50,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945818916] [2019-10-13 21:23:50,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:50,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:50,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974878254] [2019-10-13 21:23:50,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:50,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:50,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:50,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:50,957 INFO L87 Difference]: Start difference. First operand 13712 states and 20437 transitions. Second operand 4 states. [2019-10-13 21:23:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:52,099 INFO L93 Difference]: Finished difference Result 40158 states and 59777 transitions. [2019-10-13 21:23:52,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:52,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-13 21:23:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:52,172 INFO L225 Difference]: With dead ends: 40158 [2019-10-13 21:23:52,172 INFO L226 Difference]: Without dead ends: 26489 [2019-10-13 21:23:52,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:52,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26489 states. [2019-10-13 21:23:53,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26489 to 26487. [2019-10-13 21:23:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26487 states. [2019-10-13 21:23:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26487 states to 26487 states and 39050 transitions. [2019-10-13 21:23:53,380 INFO L78 Accepts]: Start accepts. Automaton has 26487 states and 39050 transitions. Word has length 164 [2019-10-13 21:23:53,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:53,381 INFO L462 AbstractCegarLoop]: Abstraction has 26487 states and 39050 transitions. [2019-10-13 21:23:53,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 26487 states and 39050 transitions. [2019-10-13 21:23:53,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-13 21:23:53,409 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:53,409 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:53,409 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1599816613, now seen corresponding path program 1 times [2019-10-13 21:23:53,410 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:53,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856274718] [2019-10-13 21:23:53,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,411 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:53,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856274718] [2019-10-13 21:23:53,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:53,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:53,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988382907] [2019-10-13 21:23:53,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:53,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:53,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:53,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:53,482 INFO L87 Difference]: Start difference. First operand 26487 states and 39050 transitions. Second operand 3 states. [2019-10-13 21:23:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:55,917 INFO L93 Difference]: Finished difference Result 79261 states and 116893 transitions. [2019-10-13 21:23:55,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:55,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-13 21:23:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:56,060 INFO L225 Difference]: With dead ends: 79261 [2019-10-13 21:23:56,061 INFO L226 Difference]: Without dead ends: 52883 [2019-10-13 21:23:56,106 INFO L600 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-10-13 21:23:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52883 states. [2019-10-13 21:23:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52883 to 26493. [2019-10-13 21:23:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26493 states. [2019-10-13 21:23:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26493 states to 26493 states and 39056 transitions. [2019-10-13 21:23:57,629 INFO L78 Accepts]: Start accepts. Automaton has 26493 states and 39056 transitions. Word has length 165 [2019-10-13 21:23:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:57,630 INFO L462 AbstractCegarLoop]: Abstraction has 26493 states and 39056 transitions. [2019-10-13 21:23:57,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 26493 states and 39056 transitions. [2019-10-13 21:23:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-13 21:23:57,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:57,646 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:57,647 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:57,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:57,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1477917308, now seen corresponding path program 1 times [2019-10-13 21:23:57,647 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:57,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931171639] [2019-10-13 21:23:57,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:57,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931171639] [2019-10-13 21:23:57,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:57,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:57,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199760012] [2019-10-13 21:23:57,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:57,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:57,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:57,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:57,749 INFO L87 Difference]: Start difference. First operand 26493 states and 39056 transitions. Second operand 3 states. [2019-10-13 21:23:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:59,879 INFO L93 Difference]: Finished difference Result 76746 states and 113125 transitions. [2019-10-13 21:23:59,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:59,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-13 21:23:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:00,010 INFO L225 Difference]: With dead ends: 76746 [2019-10-13 21:24:00,011 INFO L226 Difference]: Without dead ends: 51200 [2019-10-13 21:24:00,065 INFO L600 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-10-13 21:24:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51200 states. [2019-10-13 21:24:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51200 to 51198. [2019-10-13 21:24:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51198 states. [2019-10-13 21:24:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51198 states to 51198 states and 74563 transitions. [2019-10-13 21:24:03,657 INFO L78 Accepts]: Start accepts. Automaton has 51198 states and 74563 transitions. Word has length 166 [2019-10-13 21:24:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:03,657 INFO L462 AbstractCegarLoop]: Abstraction has 51198 states and 74563 transitions. [2019-10-13 21:24:03,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 51198 states and 74563 transitions. [2019-10-13 21:24:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-13 21:24:03,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:03,681 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:03,682 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:03,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:03,682 INFO L82 PathProgramCache]: Analyzing trace with hash 561013721, now seen corresponding path program 1 times [2019-10-13 21:24:03,682 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:03,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660342403] [2019-10-13 21:24:03,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:03,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:03,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:03,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660342403] [2019-10-13 21:24:03,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:03,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:03,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033581129] [2019-10-13 21:24:03,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:03,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:03,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:03,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:03,835 INFO L87 Difference]: Start difference. First operand 51198 states and 74563 transitions. Second operand 4 states. [2019-10-13 21:24:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:05,615 INFO L93 Difference]: Finished difference Result 89658 states and 130557 transitions. [2019-10-13 21:24:05,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:05,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-10-13 21:24:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:05,658 INFO L225 Difference]: With dead ends: 89658 [2019-10-13 21:24:05,658 INFO L226 Difference]: Without dead ends: 39289 [2019-10-13 21:24:05,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39289 states. [2019-10-13 21:24:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39289 to 39289. [2019-10-13 21:24:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39289 states. [2019-10-13 21:24:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39289 states to 39289 states and 56981 transitions. [2019-10-13 21:24:07,604 INFO L78 Accepts]: Start accepts. Automaton has 39289 states and 56981 transitions. Word has length 166 [2019-10-13 21:24:07,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:07,605 INFO L462 AbstractCegarLoop]: Abstraction has 39289 states and 56981 transitions. [2019-10-13 21:24:07,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 39289 states and 56981 transitions. [2019-10-13 21:24:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-13 21:24:07,621 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:07,621 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:07,621 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:07,621 INFO L82 PathProgramCache]: Analyzing trace with hash 2055563735, now seen corresponding path program 1 times [2019-10-13 21:24:07,622 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:07,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061618081] [2019-10-13 21:24:07,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:07,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:07,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:07,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061618081] [2019-10-13 21:24:07,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:07,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:07,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156188570] [2019-10-13 21:24:07,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:07,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:07,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:07,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:07,708 INFO L87 Difference]: Start difference. First operand 39289 states and 56981 transitions. Second operand 3 states.