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/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:29:06,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:29:06,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:29:06,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:29:06,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:29:06,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:29:06,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:29:06,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:29:06,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:29:06,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:29:06,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:29:06,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:29:06,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:29:06,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:29:06,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:29:06,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:29:06,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:29:06,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:29:06,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:29:06,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:29:06,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:29:06,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:29:06,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:29:06,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:29:06,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:29:06,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:29:06,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:29:06,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:29:06,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:29:06,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:29:06,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:29:06,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:29:06,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:29:06,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:29:06,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:29:06,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:29:06,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:29:06,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:29:06,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:29:06,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:29:06,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:29:06,857 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:29:06,872 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:29:06,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:29:06,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:29:06,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:29:06,874 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:29:06,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:29:06,874 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:29:06,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:29:06,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:29:06,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:29:06,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:29:06,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:29:06,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:29:06,876 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:29:06,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:29:06,876 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:29:06,876 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:29:06,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:29:06,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:29:06,877 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:29:06,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:29:06,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:29:06,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:29:06,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:29:06,878 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:29:06,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:29:06,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:29:06,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:29:06,879 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:29:07,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:29:07,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:29:07,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:29:07,180 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:29:07,181 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:29:07,181 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-10-13 21:29:07,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889022d5e/a87a7b0d25b64a3d93581a2d9ed088a6/FLAG2bf42f291 [2019-10-13 21:29:07,734 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:29:07,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-10-13 21:29:07,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889022d5e/a87a7b0d25b64a3d93581a2d9ed088a6/FLAG2bf42f291 [2019-10-13 21:29:08,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889022d5e/a87a7b0d25b64a3d93581a2d9ed088a6 [2019-10-13 21:29:08,110 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:29:08,112 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:29:08,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:08,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:29:08,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:29:08,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:08" (1/1) ... [2019-10-13 21:29:08,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7f8ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:08, skipping insertion in model container [2019-10-13 21:29:08,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:08" (1/1) ... [2019-10-13 21:29:08,131 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:29:08,173 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:29:08,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:08,410 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:29:08,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:08,572 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:29:08,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:08 WrapperNode [2019-10-13 21:29:08,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:08,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:29:08,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:29:08,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:29:08,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:08" (1/1) ... [2019-10-13 21:29:08,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:08" (1/1) ... [2019-10-13 21:29:08,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:08" (1/1) ... [2019-10-13 21:29:08,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:08" (1/1) ... [2019-10-13 21:29:08,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:08" (1/1) ... [2019-10-13 21:29:08,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:08" (1/1) ... [2019-10-13 21:29:08,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:08" (1/1) ... [2019-10-13 21:29:08,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:29:08,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:29:08,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:29:08,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:29:08,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:08" (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:29:08,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:29:08,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:29:08,682 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 21:29:08,682 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-10-13 21:29:08,682 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-10-13 21:29:08,682 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-10-13 21:29:08,682 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-10-13 21:29:08,682 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-10-13 21:29:08,682 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 21:29:08,683 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 21:29:08,683 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 21:29:08,683 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 21:29:08,683 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 21:29:08,683 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 21:29:08,683 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:29:08,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:29:08,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:29:08,684 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 21:29:08,684 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-10-13 21:29:08,684 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-10-13 21:29:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-10-13 21:29:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-10-13 21:29:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-10-13 21:29:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 21:29:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 21:29:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 21:29:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 21:29:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 21:29:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 21:29:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:29:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:29:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:29:09,155 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:29:09,156 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 21:29:09,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:09 BoogieIcfgContainer [2019-10-13 21:29:09,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:29:09,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:29:09,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:29:09,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:29:09,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:29:08" (1/3) ... [2019-10-13 21:29:09,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8ab2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:09, skipping insertion in model container [2019-10-13 21:29:09,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:08" (2/3) ... [2019-10-13 21:29:09,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8ab2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:09, skipping insertion in model container [2019-10-13 21:29:09,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:09" (3/3) ... [2019-10-13 21:29:09,167 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-10-13 21:29:09,178 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:29:09,187 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:29:09,199 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:29:09,228 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:29:09,228 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:29:09,228 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:29:09,229 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:29:09,229 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:29:09,229 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:29:09,229 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:29:09,230 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:29:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-10-13 21:29:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 21:29:09,264 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,265 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] [2019-10-13 21:29:09,267 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,275 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2019-10-13 21:29:09,284 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:09,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41008848] [2019-10-13 21:29:09,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,286 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:09,594 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:29:09,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41008848] [2019-10-13 21:29:09,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:09,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:09,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079007702] [2019-10-13 21:29:09,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:09,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:09,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:09,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:09,622 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2019-10-13 21:29:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,766 INFO L93 Difference]: Finished difference Result 279 states and 395 transitions. [2019-10-13 21:29:09,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:09,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-10-13 21:29:09,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,790 INFO L225 Difference]: With dead ends: 279 [2019-10-13 21:29:09,790 INFO L226 Difference]: Without dead ends: 175 [2019-10-13 21:29:09,795 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:29:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-13 21:29:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2019-10-13 21:29:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-13 21:29:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2019-10-13 21:29:09,864 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 65 [2019-10-13 21:29:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:09,865 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2019-10-13 21:29:09,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2019-10-13 21:29:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 21:29:09,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,870 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] [2019-10-13 21:29:09,871 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,871 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2019-10-13 21:29:09,872 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:09,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731622228] [2019-10-13 21:29:09,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:10,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731622228] [2019-10-13 21:29:10,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:10,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125146143] [2019-10-13 21:29:10,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:10,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:10,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:10,094 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 4 states. [2019-10-13 21:29:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,343 INFO L93 Difference]: Finished difference Result 469 states and 653 transitions. [2019-10-13 21:29:10,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:10,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-13 21:29:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,349 INFO L225 Difference]: With dead ends: 469 [2019-10-13 21:29:10,350 INFO L226 Difference]: Without dead ends: 318 [2019-10-13 21:29:10,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-13 21:29:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2019-10-13 21:29:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-13 21:29:10,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 411 transitions. [2019-10-13 21:29:10,453 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 411 transitions. Word has length 66 [2019-10-13 21:29:10,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,454 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 411 transitions. [2019-10-13 21:29:10,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 411 transitions. [2019-10-13 21:29:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 21:29:10,465 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,465 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] [2019-10-13 21:29:10,465 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1424590262, now seen corresponding path program 1 times [2019-10-13 21:29:10,466 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148319077] [2019-10-13 21:29:10,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,572 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:29:10,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148319077] [2019-10-13 21:29:10,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:10,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437925793] [2019-10-13 21:29:10,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:10,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:10,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:10,575 INFO L87 Difference]: Start difference. First operand 314 states and 411 transitions. Second operand 4 states. [2019-10-13 21:29:10,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,677 INFO L93 Difference]: Finished difference Result 565 states and 734 transitions. [2019-10-13 21:29:10,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:10,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-13 21:29:10,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,681 INFO L225 Difference]: With dead ends: 565 [2019-10-13 21:29:10,682 INFO L226 Difference]: Without dead ends: 268 [2019-10-13 21:29:10,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-10-13 21:29:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-10-13 21:29:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-10-13 21:29:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 341 transitions. [2019-10-13 21:29:10,711 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 341 transitions. Word has length 66 [2019-10-13 21:29:10,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,711 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 341 transitions. [2019-10-13 21:29:10,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 341 transitions. [2019-10-13 21:29:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 21:29:10,713 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,713 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] [2019-10-13 21:29:10,714 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,714 INFO L82 PathProgramCache]: Analyzing trace with hash -822318239, now seen corresponding path program 1 times [2019-10-13 21:29:10,714 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118295978] [2019-10-13 21:29:10,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,822 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:29:10,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118295978] [2019-10-13 21:29:10,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:10,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670426630] [2019-10-13 21:29:10,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:10,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:10,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:10,825 INFO L87 Difference]: Start difference. First operand 268 states and 341 transitions. Second operand 6 states. [2019-10-13 21:29:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,883 INFO L93 Difference]: Finished difference Result 529 states and 694 transitions. [2019-10-13 21:29:10,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:10,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-10-13 21:29:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,887 INFO L225 Difference]: With dead ends: 529 [2019-10-13 21:29:10,887 INFO L226 Difference]: Without dead ends: 278 [2019-10-13 21:29:10,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:10,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-13 21:29:10,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-10-13 21:29:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-13 21:29:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 349 transitions. [2019-10-13 21:29:10,918 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 349 transitions. Word has length 66 [2019-10-13 21:29:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,918 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 349 transitions. [2019-10-13 21:29:10,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 349 transitions. [2019-10-13 21:29:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 21:29:10,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,921 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] [2019-10-13 21:29:10,921 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1843386593, now seen corresponding path program 1 times [2019-10-13 21:29:10,922 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158153333] [2019-10-13 21:29:10,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:11,007 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:29:11,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158153333] [2019-10-13 21:29:11,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:11,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:11,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399824310] [2019-10-13 21:29:11,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:11,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:11,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:11,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:11,013 INFO L87 Difference]: Start difference. First operand 278 states and 349 transitions. Second operand 6 states. [2019-10-13 21:29:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:11,591 INFO L93 Difference]: Finished difference Result 850 states and 1130 transitions. [2019-10-13 21:29:11,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:29:11,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-10-13 21:29:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:11,596 INFO L225 Difference]: With dead ends: 850 [2019-10-13 21:29:11,597 INFO L226 Difference]: Without dead ends: 589 [2019-10-13 21:29:11,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:29:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-13 21:29:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 577. [2019-10-13 21:29:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-13 21:29:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 713 transitions. [2019-10-13 21:29:11,642 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 713 transitions. Word has length 66 [2019-10-13 21:29:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:11,643 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 713 transitions. [2019-10-13 21:29:11,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:11,643 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 713 transitions. [2019-10-13 21:29:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 21:29:11,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:11,645 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] [2019-10-13 21:29:11,646 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:11,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:11,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1172255968, now seen corresponding path program 1 times [2019-10-13 21:29:11,646 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:11,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98000162] [2019-10-13 21:29:11,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:11,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:29:11,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98000162] [2019-10-13 21:29:11,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:11,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:11,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858436591] [2019-10-13 21:29:11,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:11,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:11,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:11,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:11,750 INFO L87 Difference]: Start difference. First operand 577 states and 713 transitions. Second operand 6 states. [2019-10-13 21:29:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:11,820 INFO L93 Difference]: Finished difference Result 1140 states and 1459 transitions. [2019-10-13 21:29:11,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:11,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-10-13 21:29:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:11,826 INFO L225 Difference]: With dead ends: 1140 [2019-10-13 21:29:11,826 INFO L226 Difference]: Without dead ends: 616 [2019-10-13 21:29:11,830 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-13 21:29:11,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 604. [2019-10-13 21:29:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-13 21:29:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 735 transitions. [2019-10-13 21:29:11,881 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 735 transitions. Word has length 66 [2019-10-13 21:29:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:11,883 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 735 transitions. [2019-10-13 21:29:11,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 735 transitions. [2019-10-13 21:29:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 21:29:11,885 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:11,886 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] [2019-10-13 21:29:11,886 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:11,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1347703966, now seen corresponding path program 1 times [2019-10-13 21:29:11,887 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:11,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405777181] [2019-10-13 21:29:11,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:12,010 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:29:12,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405777181] [2019-10-13 21:29:12,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:12,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:12,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117483677] [2019-10-13 21:29:12,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:12,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:12,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:12,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:12,014 INFO L87 Difference]: Start difference. First operand 604 states and 735 transitions. Second operand 4 states. [2019-10-13 21:29:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:12,188 INFO L93 Difference]: Finished difference Result 842 states and 1059 transitions. [2019-10-13 21:29:12,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:12,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-13 21:29:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:12,194 INFO L225 Difference]: With dead ends: 842 [2019-10-13 21:29:12,194 INFO L226 Difference]: Without dead ends: 839 [2019-10-13 21:29:12,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:29:12,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-10-13 21:29:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 675. [2019-10-13 21:29:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2019-10-13 21:29:12,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 829 transitions. [2019-10-13 21:29:12,265 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 829 transitions. Word has length 66 [2019-10-13 21:29:12,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:12,266 INFO L462 AbstractCegarLoop]: Abstraction has 675 states and 829 transitions. [2019-10-13 21:29:12,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:12,266 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 829 transitions. [2019-10-13 21:29:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-13 21:29:12,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:12,268 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] [2019-10-13 21:29:12,269 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:12,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:12,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1170545691, now seen corresponding path program 1 times [2019-10-13 21:29:12,269 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:12,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755413618] [2019-10-13 21:29:12,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:12,325 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:29:12,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755413618] [2019-10-13 21:29:12,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:12,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:12,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501896232] [2019-10-13 21:29:12,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:12,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:12,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:12,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:12,328 INFO L87 Difference]: Start difference. First operand 675 states and 829 transitions. Second operand 3 states. [2019-10-13 21:29:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:12,389 INFO L93 Difference]: Finished difference Result 1249 states and 1576 transitions. [2019-10-13 21:29:12,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:12,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-13 21:29:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:12,395 INFO L225 Difference]: With dead ends: 1249 [2019-10-13 21:29:12,395 INFO L226 Difference]: Without dead ends: 655 [2019-10-13 21:29:12,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:29:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-10-13 21:29:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 567. [2019-10-13 21:29:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-10-13 21:29:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 677 transitions. [2019-10-13 21:29:12,440 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 677 transitions. Word has length 67 [2019-10-13 21:29:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:12,440 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 677 transitions. [2019-10-13 21:29:12,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 677 transitions. [2019-10-13 21:29:12,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 21:29:12,442 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:12,443 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:12,443 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:12,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:12,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1338277302, now seen corresponding path program 1 times [2019-10-13 21:29:12,444 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:12,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694183146] [2019-10-13 21:29:12,444 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,444 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:29:12,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694183146] [2019-10-13 21:29:12,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793580568] [2019-10-13 21:29:12,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:12,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:12,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:12,788 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:29:12,927 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:12,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-10-13 21:29:12,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171245794] [2019-10-13 21:29:12,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:12,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:12,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:12,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:29:12,929 INFO L87 Difference]: Start difference. First operand 567 states and 677 transitions. Second operand 4 states. [2019-10-13 21:29:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:13,026 INFO L93 Difference]: Finished difference Result 1383 states and 1712 transitions. [2019-10-13 21:29:13,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:13,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-13 21:29:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:13,037 INFO L225 Difference]: With dead ends: 1383 [2019-10-13 21:29:13,037 INFO L226 Difference]: Without dead ends: 679 [2019-10-13 21:29:13,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:29:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-10-13 21:29:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 660. [2019-10-13 21:29:13,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-10-13 21:29:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 805 transitions. [2019-10-13 21:29:13,103 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 805 transitions. Word has length 87 [2019-10-13 21:29:13,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:13,103 INFO L462 AbstractCegarLoop]: Abstraction has 660 states and 805 transitions. [2019-10-13 21:29:13,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 805 transitions. [2019-10-13 21:29:13,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 21:29:13,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:13,106 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:13,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:13,320 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:13,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:13,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2019-10-13 21:29:13,321 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:13,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368361216] [2019-10-13 21:29:13,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,322 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 21:29:13,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368361216] [2019-10-13 21:29:13,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796891842] [2019-10-13 21:29:13,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:13,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-13 21:29:13,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:13,806 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:13,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:29:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 21:29:14,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [891568398] [2019-10-13 21:29:14,033 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 100 [2019-10-13 21:29:14,087 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:29:14,087 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:29:14,278 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 21:29:14,281 INFO L272 AbstractInterpreter]: Visited 79 different actions 103 times. Merged at 2 different actions 2 times. Never widened. Performed 372 root evaluator evaluations with a maximum evaluation depth of 4. Performed 372 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2019-10-13 21:29:14,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:14,286 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 21:29:14,467 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 79.53% of their original sizes. [2019-10-13 21:29:14,468 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 21:29:15,412 INFO L553 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-10-13 21:29:15,413 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 21:29:15,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:29:15,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [6, 8, 6] total 53 [2019-10-13 21:29:15,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868436757] [2019-10-13 21:29:15,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-13 21:29:15,415 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:15,415 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 21:29:15,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-13 21:29:15,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1480, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 21:29:15,417 INFO L87 Difference]: Start difference. First operand 660 states and 805 transitions. Second operand 41 states. [2019-10-13 21:29:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:23,923 INFO L93 Difference]: Finished difference Result 1460 states and 1852 transitions. [2019-10-13 21:29:23,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-13 21:29:23,923 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2019-10-13 21:29:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:23,929 INFO L225 Difference]: With dead ends: 1460 [2019-10-13 21:29:23,929 INFO L226 Difference]: Without dead ends: 817 [2019-10-13 21:29:23,933 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=415, Invalid=4141, Unknown=0, NotChecked=0, Total=4556 [2019-10-13 21:29:23,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-10-13 21:29:23,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 781. [2019-10-13 21:29:23,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-13 21:29:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 964 transitions. [2019-10-13 21:29:23,995 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 964 transitions. Word has length 99 [2019-10-13 21:29:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:23,996 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 964 transitions. [2019-10-13 21:29:23,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-13 21:29:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 964 transitions. [2019-10-13 21:29:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:29:24,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:24,000 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:24,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:24,206 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:24,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:24,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1499335660, now seen corresponding path program 1 times [2019-10-13 21:29:24,207 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:24,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555784504] [2019-10-13 21:29:24,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:24,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:24,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-13 21:29:24,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555784504] [2019-10-13 21:29:24,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743852415] [2019-10-13 21:29:24,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:24,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:24,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:29:24,687 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-13 21:29:24,829 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:24,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [16] total 18 [2019-10-13 21:29:24,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45577680] [2019-10-13 21:29:24,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:24,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:24,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:24,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:29:24,832 INFO L87 Difference]: Start difference. First operand 781 states and 964 transitions. Second operand 4 states. [2019-10-13 21:29:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:24,919 INFO L93 Difference]: Finished difference Result 1073 states and 1373 transitions. [2019-10-13 21:29:24,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:24,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-10-13 21:29:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:24,928 INFO L225 Difference]: With dead ends: 1073 [2019-10-13 21:29:24,928 INFO L226 Difference]: Without dead ends: 769 [2019-10-13 21:29:24,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 294 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:29:24,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-10-13 21:29:24,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2019-10-13 21:29:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-10-13 21:29:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 946 transitions. [2019-10-13 21:29:24,986 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 946 transitions. Word has length 149 [2019-10-13 21:29:24,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:24,987 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 946 transitions. [2019-10-13 21:29:24,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 946 transitions. [2019-10-13 21:29:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:29:24,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:24,996 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:25,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:25,208 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:25,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1238904761, now seen corresponding path program 1 times [2019-10-13 21:29:25,210 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:25,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50311346] [2019-10-13 21:29:25,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:25,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:25,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-13 21:29:25,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50311346] [2019-10-13 21:29:25,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441390896] [2019-10-13 21:29:25,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:25,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:29:25,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-13 21:29:25,630 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-13 21:29:25,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:25,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16, 6] total 20 [2019-10-13 21:29:25,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698674452] [2019-10-13 21:29:25,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:25,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:25,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:25,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-10-13 21:29:25,840 INFO L87 Difference]: Start difference. First operand 769 states and 946 transitions. Second operand 6 states. [2019-10-13 21:29:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:25,954 INFO L93 Difference]: Finished difference Result 1429 states and 1780 transitions. [2019-10-13 21:29:25,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:29:25,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-13 21:29:25,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:25,960 INFO L225 Difference]: With dead ends: 1429 [2019-10-13 21:29:25,960 INFO L226 Difference]: Without dead ends: 733 [2019-10-13 21:29:25,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 294 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-10-13 21:29:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-10-13 21:29:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 688. [2019-10-13 21:29:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-10-13 21:29:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 797 transitions. [2019-10-13 21:29:26,010 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 797 transitions. Word has length 150 [2019-10-13 21:29:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:26,010 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 797 transitions. [2019-10-13 21:29:26,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 797 transitions. [2019-10-13 21:29:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:29:26,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:26,014 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:26,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:26,219 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:26,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:26,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1156102443, now seen corresponding path program 1 times [2019-10-13 21:29:26,220 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:26,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959596064] [2019-10-13 21:29:26,220 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:26,220 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:26,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-13 21:29:26,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959596064] [2019-10-13 21:29:26,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553823317] [2019-10-13 21:29:26,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:26,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-13 21:29:26,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:29:26,683 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:26,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:29:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-13 21:29:26,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1297852424] [2019-10-13 21:29:26,895 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 121 [2019-10-13 21:29:26,906 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:29:26,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:29:27,065 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:29:27,066 INFO L272 AbstractInterpreter]: Visited 90 different actions 390 times. Merged at 28 different actions 73 times. Never widened. Performed 1689 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1689 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 3 different actions. Largest state had 36 variables. [2019-10-13 21:29:27,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:27,068 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:29:27,068 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:29:27,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 17 [2019-10-13 21:29:27,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786300299] [2019-10-13 21:29:27,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:29:27,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:27,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:29:27,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:29:27,072 INFO L87 Difference]: Start difference. First operand 688 states and 797 transitions. Second operand 17 states. [2019-10-13 21:29:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:30,642 INFO L93 Difference]: Finished difference Result 2388 states and 3661 transitions. [2019-10-13 21:29:30,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-13 21:29:30,642 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 120 [2019-10-13 21:29:30,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:30,659 INFO L225 Difference]: With dead ends: 2388 [2019-10-13 21:29:30,659 INFO L226 Difference]: Without dead ends: 2385 [2019-10-13 21:29:30,666 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 240 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=314, Invalid=1578, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:29:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-10-13 21:29:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2042. [2019-10-13 21:29:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-10-13 21:29:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2814 transitions. [2019-10-13 21:29:30,832 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2814 transitions. Word has length 120 [2019-10-13 21:29:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:30,832 INFO L462 AbstractCegarLoop]: Abstraction has 2042 states and 2814 transitions. [2019-10-13 21:29:30,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 21:29:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2814 transitions. [2019-10-13 21:29:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:29:30,837 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:30,837 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:31,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:31,047 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:31,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:31,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1612542371, now seen corresponding path program 1 times [2019-10-13 21:29:31,047 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:31,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729731776] [2019-10-13 21:29:31,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:31,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:31,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-13 21:29:31,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729731776] [2019-10-13 21:29:31,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338745105] [2019-10-13 21:29:31,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:31,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:31,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:29:31,327 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-13 21:29:31,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:31,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 11 [2019-10-13 21:29:31,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966118845] [2019-10-13 21:29:31,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:31,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:31,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:31,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:29:31,417 INFO L87 Difference]: Start difference. First operand 2042 states and 2814 transitions. Second operand 3 states. [2019-10-13 21:29:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:31,481 INFO L93 Difference]: Finished difference Result 2718 states and 3748 transitions. [2019-10-13 21:29:31,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:31,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-10-13 21:29:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:31,485 INFO L225 Difference]: With dead ends: 2718 [2019-10-13 21:29:31,486 INFO L226 Difference]: Without dead ends: 746 [2019-10-13 21:29:31,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 283 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:29:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-10-13 21:29:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 717. [2019-10-13 21:29:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-13 21:29:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 822 transitions. [2019-10-13 21:29:31,539 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 822 transitions. Word has length 143 [2019-10-13 21:29:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:31,539 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 822 transitions. [2019-10-13 21:29:31,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 822 transitions. [2019-10-13 21:29:31,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:29:31,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:31,542 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:31,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:31,755 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:31,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:31,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1571306911, now seen corresponding path program 2 times [2019-10-13 21:29:31,755 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:31,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773070599] [2019-10-13 21:29:31,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:31,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:31,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-13 21:29:31,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773070599] [2019-10-13 21:29:31,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:31,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:31,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983862334] [2019-10-13 21:29:31,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:31,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:31,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:31,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:31,867 INFO L87 Difference]: Start difference. First operand 717 states and 822 transitions. Second operand 3 states. [2019-10-13 21:29:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:31,900 INFO L93 Difference]: Finished difference Result 881 states and 1019 transitions. [2019-10-13 21:29:31,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:31,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-13 21:29:31,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:31,902 INFO L225 Difference]: With dead ends: 881 [2019-10-13 21:29:31,902 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:29:31,908 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:29:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:29:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:29:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:29:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:29:31,909 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 146 [2019-10-13 21:29:31,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:31,910 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:29:31,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:29:31,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:29:31,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:29:33,975 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-10-13 21:29:34,080 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-13 21:29:34,377 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-10-13 21:29:34,679 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2019-10-13 21:29:34,795 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-10-13 21:29:35,321 WARN L191 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 81 [2019-10-13 21:29:35,969 WARN L191 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 104 [2019-10-13 21:29:36,681 WARN L191 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 91 [2019-10-13 21:29:37,111 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 87 [2019-10-13 21:29:37,615 WARN L191 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 74 [2019-10-13 21:29:37,905 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-10-13 21:29:38,009 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-10-13 21:29:38,158 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-10-13 21:29:39,209 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 169 DAG size of output: 123 [2019-10-13 21:29:39,445 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-10-13 21:29:39,968 WARN L191 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 92 [2019-10-13 21:29:40,406 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-10-13 21:29:41,057 WARN L191 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 73 [2019-10-13 21:29:41,290 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 1