java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:58,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:58,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:58,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:58,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:58,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:58,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:58,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:58,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:58,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:58,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:58,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:58,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:58,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:58,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:58,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:58,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:58,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:58,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:58,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:58,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:58,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:58,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:58,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:58,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:58,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:58,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:58,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:58,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:58,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:58,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:58,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:58,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:58,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:58,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:58,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:58,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:58,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:58,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:58,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:58,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:58,166 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-15 01:23:58,185 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:58,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:58,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:58,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:58,190 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:58,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:58,190 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:58,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:58,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:58,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:58,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:58,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:58,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:58,193 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:58,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:58,193 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:58,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:58,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:58,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:58,194 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:58,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:58,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:58,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:58,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:58,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:58,195 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:58,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:58,195 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:58,196 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-15 01:23:58,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:58,494 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:58,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:58,499 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:58,499 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:58,500 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-10-15 01:23:58,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3932d269b/1d85aa1fb41145be9d4c496c3c18d10c/FLAGe9f09a389 [2019-10-15 01:23:59,137 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:59,138 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-10-15 01:23:59,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3932d269b/1d85aa1fb41145be9d4c496c3c18d10c/FLAGe9f09a389 [2019-10-15 01:23:59,442 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3932d269b/1d85aa1fb41145be9d4c496c3c18d10c [2019-10-15 01:23:59,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:59,453 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:59,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:59,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:59,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:59,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:59" (1/1) ... [2019-10-15 01:23:59,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6885b406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:59, skipping insertion in model container [2019-10-15 01:23:59,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:59" (1/1) ... [2019-10-15 01:23:59,471 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:59,524 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:59,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:59,925 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:24:00,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:24:00,030 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:24:00,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:00 WrapperNode [2019-10-15 01:24:00,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:24:00,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:24:00,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:24:00,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:24:00,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:00" (1/1) ... [2019-10-15 01:24:00,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:00" (1/1) ... [2019-10-15 01:24:00,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:00" (1/1) ... [2019-10-15 01:24:00,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:00" (1/1) ... [2019-10-15 01:24:00,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:00" (1/1) ... [2019-10-15 01:24:00,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:00" (1/1) ... [2019-10-15 01:24:00,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:00" (1/1) ... [2019-10-15 01:24:00,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:24:00,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:24:00,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:24:00,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:24:00,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:00" (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-15 01:24:00,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:24:00,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:24:00,171 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-15 01:24:00,171 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-15 01:24:00,172 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-15 01:24:00,172 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-15 01:24:00,172 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-15 01:24:00,172 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-15 01:24:00,173 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-15 01:24:00,174 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-15 01:24:00,174 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-15 01:24:00,175 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-15 01:24:00,175 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-15 01:24:00,176 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-15 01:24:00,176 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-15 01:24:00,176 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-15 01:24:00,179 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-15 01:24:00,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:24:00,179 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-15 01:24:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:24:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:24:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:24:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:24:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:24:00,181 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:24:00,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:24:00,181 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-15 01:24:00,181 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-15 01:24:00,181 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-15 01:24:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-15 01:24:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-15 01:24:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-15 01:24:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-15 01:24:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-15 01:24:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:24:00,183 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-15 01:24:00,183 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-15 01:24:00,183 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-15 01:24:00,183 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-15 01:24:00,183 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-15 01:24:00,184 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:24:00,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:24:00,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:24:00,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:24:01,000 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:24:01,001 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:24:01,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:24:01 BoogieIcfgContainer [2019-10-15 01:24:01,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:24:01,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:24:01,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:24:01,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:24:01,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:59" (1/3) ... [2019-10-15 01:24:01,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f4ad88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:24:01, skipping insertion in model container [2019-10-15 01:24:01,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:00" (2/3) ... [2019-10-15 01:24:01,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f4ad88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:24:01, skipping insertion in model container [2019-10-15 01:24:01,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:24:01" (3/3) ... [2019-10-15 01:24:01,011 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-10-15 01:24:01,021 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:24:01,030 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:24:01,041 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:24:01,067 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:24:01,067 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:24:01,067 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:24:01,067 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:24:01,068 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:24:01,068 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:24:01,068 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:24:01,068 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:24:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states. [2019-10-15 01:24:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-15 01:24:01,103 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:01,104 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-15 01:24:01,106 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:01,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1497229254, now seen corresponding path program 1 times [2019-10-15 01:24:01,121 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:01,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811949903] [2019-10-15 01:24:01,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:01,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:01,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:01,565 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-15 01:24:01,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811949903] [2019-10-15 01:24:01,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:01,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:01,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501896232] [2019-10-15 01:24:01,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:01,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:01,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:01,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:01,596 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 4 states. [2019-10-15 01:24:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:01,717 INFO L93 Difference]: Finished difference Result 451 states and 690 transitions. [2019-10-15 01:24:01,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:01,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-15 01:24:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:01,732 INFO L225 Difference]: With dead ends: 451 [2019-10-15 01:24:01,732 INFO L226 Difference]: Without dead ends: 230 [2019-10-15 01:24:01,739 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-15 01:24:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-15 01:24:01,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-10-15 01:24:01,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-15 01:24:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 320 transitions. [2019-10-15 01:24:01,810 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 320 transitions. Word has length 65 [2019-10-15 01:24:01,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:01,811 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 320 transitions. [2019-10-15 01:24:01,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 320 transitions. [2019-10-15 01:24:01,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 01:24:01,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:01,816 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:01,816 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:01,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:01,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1347913347, now seen corresponding path program 1 times [2019-10-15 01:24:01,817 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:01,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230023078] [2019-10-15 01:24:01,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:01,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:01,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:02,009 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-15 01:24:02,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230023078] [2019-10-15 01:24:02,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:02,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:02,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783386948] [2019-10-15 01:24:02,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:02,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:02,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:02,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:02,013 INFO L87 Difference]: Start difference. First operand 230 states and 320 transitions. Second operand 4 states. [2019-10-15 01:24:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:02,139 INFO L93 Difference]: Finished difference Result 442 states and 628 transitions. [2019-10-15 01:24:02,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:02,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-15 01:24:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:02,144 INFO L225 Difference]: With dead ends: 442 [2019-10-15 01:24:02,145 INFO L226 Difference]: Without dead ends: 234 [2019-10-15 01:24:02,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-15 01:24:02,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2019-10-15 01:24:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-10-15 01:24:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 323 transitions. [2019-10-15 01:24:02,176 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 323 transitions. Word has length 76 [2019-10-15 01:24:02,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:02,176 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 323 transitions. [2019-10-15 01:24:02,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:02,177 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 323 transitions. [2019-10-15 01:24:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:24:02,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:02,181 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:02,182 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:02,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:02,182 INFO L82 PathProgramCache]: Analyzing trace with hash 607799179, now seen corresponding path program 1 times [2019-10-15 01:24:02,182 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:02,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524836160] [2019-10-15 01:24:02,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:02,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:02,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:02,434 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-15 01:24:02,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524836160] [2019-10-15 01:24:02,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:02,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:24:02,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635797921] [2019-10-15 01:24:02,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:24:02,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:02,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:24:02,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:02,439 INFO L87 Difference]: Start difference. First operand 234 states and 323 transitions. Second operand 7 states. [2019-10-15 01:24:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:03,794 INFO L93 Difference]: Finished difference Result 533 states and 738 transitions. [2019-10-15 01:24:03,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:24:03,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-15 01:24:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:03,800 INFO L225 Difference]: With dead ends: 533 [2019-10-15 01:24:03,800 INFO L226 Difference]: Without dead ends: 321 [2019-10-15 01:24:03,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:24:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-10-15 01:24:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 320. [2019-10-15 01:24:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-15 01:24:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 435 transitions. [2019-10-15 01:24:03,848 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 435 transitions. Word has length 94 [2019-10-15 01:24:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:03,848 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 435 transitions. [2019-10-15 01:24:03,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:24:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 435 transitions. [2019-10-15 01:24:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:24:03,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:03,854 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:03,855 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:03,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:03,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1371679745, now seen corresponding path program 1 times [2019-10-15 01:24:03,855 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:03,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170155826] [2019-10-15 01:24:03,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:03,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:03,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:04,003 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-15 01:24:04,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170155826] [2019-10-15 01:24:04,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:04,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:24:04,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37051326] [2019-10-15 01:24:04,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:24:04,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:04,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:24:04,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:04,006 INFO L87 Difference]: Start difference. First operand 320 states and 435 transitions. Second operand 7 states. [2019-10-15 01:24:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:05,167 INFO L93 Difference]: Finished difference Result 539 states and 746 transitions. [2019-10-15 01:24:05,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:24:05,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-15 01:24:05,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:05,171 INFO L225 Difference]: With dead ends: 539 [2019-10-15 01:24:05,171 INFO L226 Difference]: Without dead ends: 324 [2019-10-15 01:24:05,173 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:24:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-15 01:24:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 320. [2019-10-15 01:24:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-15 01:24:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 435 transitions. [2019-10-15 01:24:05,198 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 435 transitions. Word has length 95 [2019-10-15 01:24:05,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:05,199 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 435 transitions. [2019-10-15 01:24:05,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:24:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 435 transitions. [2019-10-15 01:24:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:24:05,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:05,201 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:05,202 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:05,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:05,202 INFO L82 PathProgramCache]: Analyzing trace with hash 141577624, now seen corresponding path program 1 times [2019-10-15 01:24:05,202 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:05,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032276625] [2019-10-15 01:24:05,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:05,281 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-15 01:24:05,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032276625] [2019-10-15 01:24:05,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:05,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:05,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680206165] [2019-10-15 01:24:05,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:05,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:05,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:05,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:05,285 INFO L87 Difference]: Start difference. First operand 320 states and 435 transitions. Second operand 3 states. [2019-10-15 01:24:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:05,333 INFO L93 Difference]: Finished difference Result 767 states and 1066 transitions. [2019-10-15 01:24:05,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:05,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-15 01:24:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:05,339 INFO L225 Difference]: With dead ends: 767 [2019-10-15 01:24:05,339 INFO L226 Difference]: Without dead ends: 552 [2019-10-15 01:24:05,341 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-15 01:24:05,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-10-15 01:24:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 534. [2019-10-15 01:24:05,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-15 01:24:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 738 transitions. [2019-10-15 01:24:05,392 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 738 transitions. Word has length 96 [2019-10-15 01:24:05,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:05,392 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 738 transitions. [2019-10-15 01:24:05,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 738 transitions. [2019-10-15 01:24:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:24:05,395 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:05,395 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:05,396 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1335466069, now seen corresponding path program 1 times [2019-10-15 01:24:05,396 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:05,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500892551] [2019-10-15 01:24:05,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:05,548 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-15 01:24:05,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500892551] [2019-10-15 01:24:05,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:05,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:05,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572064698] [2019-10-15 01:24:05,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:05,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:05,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:05,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:05,553 INFO L87 Difference]: Start difference. First operand 534 states and 738 transitions. Second operand 3 states. [2019-10-15 01:24:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:05,620 INFO L93 Difference]: Finished difference Result 1269 states and 1795 transitions. [2019-10-15 01:24:05,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:05,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-15 01:24:05,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:05,629 INFO L225 Difference]: With dead ends: 1269 [2019-10-15 01:24:05,629 INFO L226 Difference]: Without dead ends: 883 [2019-10-15 01:24:05,632 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-15 01:24:05,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-10-15 01:24:05,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 877. [2019-10-15 01:24:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-10-15 01:24:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1230 transitions. [2019-10-15 01:24:05,709 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1230 transitions. Word has length 97 [2019-10-15 01:24:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:05,711 INFO L462 AbstractCegarLoop]: Abstraction has 877 states and 1230 transitions. [2019-10-15 01:24:05,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1230 transitions. [2019-10-15 01:24:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:24:05,713 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:05,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, 1, 1, 1, 1, 1, 1, 1, 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-15 01:24:05,713 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:05,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:05,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2036530647, now seen corresponding path program 1 times [2019-10-15 01:24:05,714 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:05,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690894620] [2019-10-15 01:24:05,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:05,830 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-15 01:24:05,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690894620] [2019-10-15 01:24:05,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:05,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:05,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304599887] [2019-10-15 01:24:05,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:05,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:05,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:05,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:05,834 INFO L87 Difference]: Start difference. First operand 877 states and 1230 transitions. Second operand 3 states. [2019-10-15 01:24:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:05,891 INFO L93 Difference]: Finished difference Result 1479 states and 2087 transitions. [2019-10-15 01:24:05,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:05,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-15 01:24:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:05,896 INFO L225 Difference]: With dead ends: 1479 [2019-10-15 01:24:05,897 INFO L226 Difference]: Without dead ends: 718 [2019-10-15 01:24:05,900 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-15 01:24:05,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-10-15 01:24:05,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2019-10-15 01:24:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-10-15 01:24:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 998 transitions. [2019-10-15 01:24:05,949 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 998 transitions. Word has length 97 [2019-10-15 01:24:05,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:05,949 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 998 transitions. [2019-10-15 01:24:05,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 998 transitions. [2019-10-15 01:24:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:24:05,952 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:05,952 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:05,952 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:05,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2127297953, now seen corresponding path program 1 times [2019-10-15 01:24:05,953 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:05,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260072644] [2019-10-15 01:24:05,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:06,063 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-15 01:24:06,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260072644] [2019-10-15 01:24:06,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:06,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:06,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781036521] [2019-10-15 01:24:06,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:06,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:06,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:06,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:06,065 INFO L87 Difference]: Start difference. First operand 718 states and 998 transitions. Second operand 4 states. [2019-10-15 01:24:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:06,122 INFO L93 Difference]: Finished difference Result 1300 states and 1833 transitions. [2019-10-15 01:24:06,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:06,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-15 01:24:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:06,128 INFO L225 Difference]: With dead ends: 1300 [2019-10-15 01:24:06,129 INFO L226 Difference]: Without dead ends: 733 [2019-10-15 01:24:06,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-10-15 01:24:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2019-10-15 01:24:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-10-15 01:24:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1010 transitions. [2019-10-15 01:24:06,216 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1010 transitions. Word has length 97 [2019-10-15 01:24:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:06,217 INFO L462 AbstractCegarLoop]: Abstraction has 733 states and 1010 transitions. [2019-10-15 01:24:06,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1010 transitions. [2019-10-15 01:24:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:24:06,219 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:06,219 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:06,220 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:06,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:06,220 INFO L82 PathProgramCache]: Analyzing trace with hash 344185535, now seen corresponding path program 1 times [2019-10-15 01:24:06,220 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:06,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136081601] [2019-10-15 01:24:06,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:06,310 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-15 01:24:06,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136081601] [2019-10-15 01:24:06,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:06,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:06,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228605332] [2019-10-15 01:24:06,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:06,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:06,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:06,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:06,313 INFO L87 Difference]: Start difference. First operand 733 states and 1010 transitions. Second operand 4 states. [2019-10-15 01:24:06,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:06,394 INFO L93 Difference]: Finished difference Result 1330 states and 1866 transitions. [2019-10-15 01:24:06,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:06,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-15 01:24:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:06,400 INFO L225 Difference]: With dead ends: 1330 [2019-10-15 01:24:06,400 INFO L226 Difference]: Without dead ends: 748 [2019-10-15 01:24:06,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-15 01:24:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-15 01:24:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-15 01:24:06,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1022 transitions. [2019-10-15 01:24:06,445 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1022 transitions. Word has length 105 [2019-10-15 01:24:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:06,446 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1022 transitions. [2019-10-15 01:24:06,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1022 transitions. [2019-10-15 01:24:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:24:06,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:06,449 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:06,449 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:06,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:06,449 INFO L82 PathProgramCache]: Analyzing trace with hash -325164599, now seen corresponding path program 1 times [2019-10-15 01:24:06,449 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:06,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320108664] [2019-10-15 01:24:06,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:06,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320108664] [2019-10-15 01:24:06,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:06,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:06,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331741909] [2019-10-15 01:24:06,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:06,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:06,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:06,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:06,521 INFO L87 Difference]: Start difference. First operand 748 states and 1022 transitions. Second operand 4 states. [2019-10-15 01:24:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:06,587 INFO L93 Difference]: Finished difference Result 1357 states and 1878 transitions. [2019-10-15 01:24:06,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:06,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-15 01:24:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:06,593 INFO L225 Difference]: With dead ends: 1357 [2019-10-15 01:24:06,594 INFO L226 Difference]: Without dead ends: 760 [2019-10-15 01:24:06,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-10-15 01:24:06,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2019-10-15 01:24:06,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-10-15 01:24:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1031 transitions. [2019-10-15 01:24:06,636 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1031 transitions. Word has length 113 [2019-10-15 01:24:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:06,637 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1031 transitions. [2019-10-15 01:24:06,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1031 transitions. [2019-10-15 01:24:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:24:06,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:06,639 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:06,640 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:06,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:06,640 INFO L82 PathProgramCache]: Analyzing trace with hash -201213723, now seen corresponding path program 1 times [2019-10-15 01:24:06,640 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:06,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583808529] [2019-10-15 01:24:06,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:06,723 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-15 01:24:06,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583808529] [2019-10-15 01:24:06,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:06,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:06,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255991181] [2019-10-15 01:24:06,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:06,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:06,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:06,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:06,727 INFO L87 Difference]: Start difference. First operand 760 states and 1031 transitions. Second operand 4 states. [2019-10-15 01:24:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:06,825 INFO L93 Difference]: Finished difference Result 1384 states and 1908 transitions. [2019-10-15 01:24:06,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:06,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-15 01:24:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:06,834 INFO L225 Difference]: With dead ends: 1384 [2019-10-15 01:24:06,835 INFO L226 Difference]: Without dead ends: 775 [2019-10-15 01:24:06,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-10-15 01:24:06,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2019-10-15 01:24:06,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-10-15 01:24:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1043 transitions. [2019-10-15 01:24:06,900 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1043 transitions. Word has length 113 [2019-10-15 01:24:06,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:06,901 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1043 transitions. [2019-10-15 01:24:06,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1043 transitions. [2019-10-15 01:24:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:24:06,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:06,930 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:06,931 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:06,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1920752919, now seen corresponding path program 1 times [2019-10-15 01:24:06,931 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:06,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046389004] [2019-10-15 01:24:06,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:24:07,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046389004] [2019-10-15 01:24:07,038 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:07,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:07,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298145020] [2019-10-15 01:24:07,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:07,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:07,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:07,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:07,041 INFO L87 Difference]: Start difference. First operand 775 states and 1043 transitions. Second operand 4 states. [2019-10-15 01:24:07,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:07,129 INFO L93 Difference]: Finished difference Result 1417 states and 1929 transitions. [2019-10-15 01:24:07,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:07,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-15 01:24:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:07,135 INFO L225 Difference]: With dead ends: 1417 [2019-10-15 01:24:07,136 INFO L226 Difference]: Without dead ends: 793 [2019-10-15 01:24:07,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:07,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-10-15 01:24:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 793. [2019-10-15 01:24:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-10-15 01:24:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1058 transitions. [2019-10-15 01:24:07,198 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1058 transitions. Word has length 121 [2019-10-15 01:24:07,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:07,199 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1058 transitions. [2019-10-15 01:24:07,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1058 transitions. [2019-10-15 01:24:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-15 01:24:07,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:07,203 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:07,204 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:07,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:07,204 INFO L82 PathProgramCache]: Analyzing trace with hash 934778704, now seen corresponding path program 1 times [2019-10-15 01:24:07,204 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:07,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284358946] [2019-10-15 01:24:07,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:07,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:07,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:24:07,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284358946] [2019-10-15 01:24:07,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:07,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:24:07,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366649656] [2019-10-15 01:24:07,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:24:07,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:07,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:24:07,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:24:07,496 INFO L87 Difference]: Start difference. First operand 793 states and 1058 transitions. Second operand 10 states. [2019-10-15 01:24:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:10,603 INFO L93 Difference]: Finished difference Result 2073 states and 2746 transitions. [2019-10-15 01:24:10,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:24:10,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2019-10-15 01:24:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:10,613 INFO L225 Difference]: With dead ends: 2073 [2019-10-15 01:24:10,613 INFO L226 Difference]: Without dead ends: 1422 [2019-10-15 01:24:10,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:24:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2019-10-15 01:24:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1325. [2019-10-15 01:24:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2019-10-15 01:24:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1736 transitions. [2019-10-15 01:24:10,707 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1736 transitions. Word has length 126 [2019-10-15 01:24:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:10,707 INFO L462 AbstractCegarLoop]: Abstraction has 1325 states and 1736 transitions. [2019-10-15 01:24:10,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:24:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1736 transitions. [2019-10-15 01:24:10,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:24:10,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:10,710 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:10,710 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:10,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:10,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1043125097, now seen corresponding path program 1 times [2019-10-15 01:24:10,711 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:10,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352663210] [2019-10-15 01:24:10,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:24:10,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352663210] [2019-10-15 01:24:10,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:10,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:10,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053924478] [2019-10-15 01:24:10,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:10,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:10,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:10,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:10,787 INFO L87 Difference]: Start difference. First operand 1325 states and 1736 transitions. Second operand 4 states. [2019-10-15 01:24:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:10,871 INFO L93 Difference]: Finished difference Result 2408 states and 3177 transitions. [2019-10-15 01:24:10,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:10,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-10-15 01:24:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:10,880 INFO L225 Difference]: With dead ends: 2408 [2019-10-15 01:24:10,880 INFO L226 Difference]: Without dead ends: 1337 [2019-10-15 01:24:10,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-10-15 01:24:10,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1331. [2019-10-15 01:24:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2019-10-15 01:24:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1723 transitions. [2019-10-15 01:24:10,971 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1723 transitions. Word has length 128 [2019-10-15 01:24:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:10,971 INFO L462 AbstractCegarLoop]: Abstraction has 1331 states and 1723 transitions. [2019-10-15 01:24:10,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1723 transitions. [2019-10-15 01:24:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 01:24:10,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:10,974 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:10,974 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:10,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash -580362228, now seen corresponding path program 1 times [2019-10-15 01:24:10,975 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:10,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853475987] [2019-10-15 01:24:10,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-15 01:24:11,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853475987] [2019-10-15 01:24:11,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:11,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:11,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206693757] [2019-10-15 01:24:11,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:11,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:11,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:11,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:11,117 INFO L87 Difference]: Start difference. First operand 1331 states and 1723 transitions. Second operand 9 states. [2019-10-15 01:24:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:13,184 INFO L93 Difference]: Finished difference Result 2743 states and 3525 transitions. [2019-10-15 01:24:13,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:24:13,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-10-15 01:24:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:13,195 INFO L225 Difference]: With dead ends: 2743 [2019-10-15 01:24:13,195 INFO L226 Difference]: Without dead ends: 1717 [2019-10-15 01:24:13,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:24:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2019-10-15 01:24:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1454. [2019-10-15 01:24:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-10-15 01:24:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1857 transitions. [2019-10-15 01:24:13,297 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1857 transitions. Word has length 130 [2019-10-15 01:24:13,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:13,298 INFO L462 AbstractCegarLoop]: Abstraction has 1454 states and 1857 transitions. [2019-10-15 01:24:13,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1857 transitions. [2019-10-15 01:24:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-15 01:24:13,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:13,301 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:13,301 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:13,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:13,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1422012878, now seen corresponding path program 1 times [2019-10-15 01:24:13,302 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:13,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940241422] [2019-10-15 01:24:13,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:13,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:13,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:24:13,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940241422] [2019-10-15 01:24:13,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:13,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:24:13,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851759133] [2019-10-15 01:24:13,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:24:13,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:13,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:24:13,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:13,435 INFO L87 Difference]: Start difference. First operand 1454 states and 1857 transitions. Second operand 7 states. [2019-10-15 01:24:13,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:13,548 INFO L93 Difference]: Finished difference Result 1555 states and 2000 transitions. [2019-10-15 01:24:13,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:24:13,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2019-10-15 01:24:13,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:13,560 INFO L225 Difference]: With dead ends: 1555 [2019-10-15 01:24:13,560 INFO L226 Difference]: Without dead ends: 1553 [2019-10-15 01:24:13,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2019-10-15 01:24:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1475. [2019-10-15 01:24:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2019-10-15 01:24:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1880 transitions. [2019-10-15 01:24:13,652 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1880 transitions. Word has length 129 [2019-10-15 01:24:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:13,652 INFO L462 AbstractCegarLoop]: Abstraction has 1475 states and 1880 transitions. [2019-10-15 01:24:13,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:24:13,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1880 transitions. [2019-10-15 01:24:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 01:24:13,655 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:13,655 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:13,655 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:13,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1958552652, now seen corresponding path program 1 times [2019-10-15 01:24:13,656 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:13,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444226502] [2019-10-15 01:24:13,656 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:13,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:13,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:24:13,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444226502] [2019-10-15 01:24:13,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:13,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:24:13,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534930268] [2019-10-15 01:24:13,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:24:13,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:13,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:24:13,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:24:13,907 INFO L87 Difference]: Start difference. First operand 1475 states and 1880 transitions. Second operand 10 states. [2019-10-15 01:24:17,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:17,123 INFO L93 Difference]: Finished difference Result 3875 states and 4917 transitions. [2019-10-15 01:24:17,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:24:17,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2019-10-15 01:24:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:17,138 INFO L225 Difference]: With dead ends: 3875 [2019-10-15 01:24:17,138 INFO L226 Difference]: Without dead ends: 2747 [2019-10-15 01:24:17,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:24:17,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2019-10-15 01:24:17,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 1900. [2019-10-15 01:24:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-10-15 01:24:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2410 transitions. [2019-10-15 01:24:17,274 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2410 transitions. Word has length 134 [2019-10-15 01:24:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:17,275 INFO L462 AbstractCegarLoop]: Abstraction has 1900 states and 2410 transitions. [2019-10-15 01:24:17,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:24:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2410 transitions. [2019-10-15 01:24:17,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:24:17,278 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:17,278 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:17,278 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:17,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:17,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2040574201, now seen corresponding path program 1 times [2019-10-15 01:24:17,279 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:17,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636337115] [2019-10-15 01:24:17,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:17,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:17,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:17,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636337115] [2019-10-15 01:24:17,395 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:17,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:17,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724169536] [2019-10-15 01:24:17,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:17,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:17,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:17,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:17,397 INFO L87 Difference]: Start difference. First operand 1900 states and 2410 transitions. Second operand 5 states. [2019-10-15 01:24:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:17,935 INFO L93 Difference]: Finished difference Result 6574 states and 8450 transitions. [2019-10-15 01:24:17,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:24:17,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:24:17,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:17,960 INFO L225 Difference]: With dead ends: 6574 [2019-10-15 01:24:17,961 INFO L226 Difference]: Without dead ends: 4966 [2019-10-15 01:24:17,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4966 states. [2019-10-15 01:24:18,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4966 to 4508. [2019-10-15 01:24:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4508 states. [2019-10-15 01:24:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 5738 transitions. [2019-10-15 01:24:18,218 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 5738 transitions. Word has length 135 [2019-10-15 01:24:18,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:18,219 INFO L462 AbstractCegarLoop]: Abstraction has 4508 states and 5738 transitions. [2019-10-15 01:24:18,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 5738 transitions. [2019-10-15 01:24:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:24:18,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:18,224 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:18,225 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:18,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:18,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1055165671, now seen corresponding path program 1 times [2019-10-15 01:24:18,225 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:18,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562512144] [2019-10-15 01:24:18,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:18,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:18,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:18,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562512144] [2019-10-15 01:24:18,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:18,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:18,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545931776] [2019-10-15 01:24:18,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:18,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:18,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:18,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:18,321 INFO L87 Difference]: Start difference. First operand 4508 states and 5738 transitions. Second operand 4 states. [2019-10-15 01:24:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:18,750 INFO L93 Difference]: Finished difference Result 8468 states and 10813 transitions. [2019-10-15 01:24:18,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:18,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-15 01:24:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:18,776 INFO L225 Difference]: With dead ends: 8468 [2019-10-15 01:24:18,776 INFO L226 Difference]: Without dead ends: 4549 [2019-10-15 01:24:18,790 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-15 01:24:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2019-10-15 01:24:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 4126. [2019-10-15 01:24:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4126 states. [2019-10-15 01:24:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4126 states to 4126 states and 5253 transitions. [2019-10-15 01:24:19,078 INFO L78 Accepts]: Start accepts. Automaton has 4126 states and 5253 transitions. Word has length 139 [2019-10-15 01:24:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:19,078 INFO L462 AbstractCegarLoop]: Abstraction has 4126 states and 5253 transitions. [2019-10-15 01:24:19,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4126 states and 5253 transitions. [2019-10-15 01:24:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 01:24:19,082 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:19,082 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:19,082 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:19,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:19,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1098266395, now seen corresponding path program 1 times [2019-10-15 01:24:19,083 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:19,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122889550] [2019-10-15 01:24:19,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:19,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:19,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:24:19,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122889550] [2019-10-15 01:24:19,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:19,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:19,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475555595] [2019-10-15 01:24:19,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:19,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:19,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:19,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:19,264 INFO L87 Difference]: Start difference. First operand 4126 states and 5253 transitions. Second operand 9 states. [2019-10-15 01:24:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:20,658 INFO L93 Difference]: Finished difference Result 7560 states and 9692 transitions. [2019-10-15 01:24:20,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:24:20,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-10-15 01:24:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:20,688 INFO L225 Difference]: With dead ends: 7560 [2019-10-15 01:24:20,688 INFO L226 Difference]: Without dead ends: 3845 [2019-10-15 01:24:20,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:24:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2019-10-15 01:24:20,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3486. [2019-10-15 01:24:20,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2019-10-15 01:24:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4428 transitions. [2019-10-15 01:24:20,889 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4428 transitions. Word has length 136 [2019-10-15 01:24:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:20,889 INFO L462 AbstractCegarLoop]: Abstraction has 3486 states and 4428 transitions. [2019-10-15 01:24:20,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4428 transitions. [2019-10-15 01:24:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 01:24:20,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:20,892 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:20,892 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:20,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:20,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1626245539, now seen corresponding path program 1 times [2019-10-15 01:24:20,893 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:20,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237961322] [2019-10-15 01:24:20,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:20,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:20,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:24:21,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237961322] [2019-10-15 01:24:21,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:21,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:21,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060353593] [2019-10-15 01:24:21,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:21,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:21,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:21,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:21,037 INFO L87 Difference]: Start difference. First operand 3486 states and 4428 transitions. Second operand 9 states. [2019-10-15 01:24:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:22,670 INFO L93 Difference]: Finished difference Result 7084 states and 9147 transitions. [2019-10-15 01:24:22,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:24:22,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-10-15 01:24:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:22,686 INFO L225 Difference]: With dead ends: 7084 [2019-10-15 01:24:22,686 INFO L226 Difference]: Without dead ends: 3948 [2019-10-15 01:24:22,696 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:24:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2019-10-15 01:24:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3385. [2019-10-15 01:24:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2019-10-15 01:24:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4299 transitions. [2019-10-15 01:24:22,898 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4299 transitions. Word has length 137 [2019-10-15 01:24:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:22,898 INFO L462 AbstractCegarLoop]: Abstraction has 3385 states and 4299 transitions. [2019-10-15 01:24:22,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4299 transitions. [2019-10-15 01:24:22,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:24:22,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:22,901 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:22,901 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:22,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:22,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1745306833, now seen corresponding path program 1 times [2019-10-15 01:24:22,902 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:22,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957232943] [2019-10-15 01:24:22,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:22,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:22,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:22,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957232943] [2019-10-15 01:24:22,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:22,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:22,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934379260] [2019-10-15 01:24:22,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:22,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:22,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:22,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:22,976 INFO L87 Difference]: Start difference. First operand 3385 states and 4299 transitions. Second operand 5 states. [2019-10-15 01:24:23,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:23,634 INFO L93 Difference]: Finished difference Result 10429 states and 13371 transitions. [2019-10-15 01:24:23,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:24:23,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-15 01:24:23,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:23,678 INFO L225 Difference]: With dead ends: 10429 [2019-10-15 01:24:23,678 INFO L226 Difference]: Without dead ends: 7553 [2019-10-15 01:24:23,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7553 states. [2019-10-15 01:24:24,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7553 to 5192. [2019-10-15 01:24:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5192 states. [2019-10-15 01:24:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5192 states to 5192 states and 6585 transitions. [2019-10-15 01:24:24,032 INFO L78 Accepts]: Start accepts. Automaton has 5192 states and 6585 transitions. Word has length 138 [2019-10-15 01:24:24,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:24,033 INFO L462 AbstractCegarLoop]: Abstraction has 5192 states and 6585 transitions. [2019-10-15 01:24:24,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:24,033 INFO L276 IsEmpty]: Start isEmpty. Operand 5192 states and 6585 transitions. [2019-10-15 01:24:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:24:24,037 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:24,037 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:24,037 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:24,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1474814422, now seen corresponding path program 1 times [2019-10-15 01:24:24,038 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:24,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274583629] [2019-10-15 01:24:24,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:24,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274583629] [2019-10-15 01:24:24,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:24,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:24,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623293387] [2019-10-15 01:24:24,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:24,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:24,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:24,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:24,131 INFO L87 Difference]: Start difference. First operand 5192 states and 6585 transitions. Second operand 5 states. [2019-10-15 01:24:24,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:24,708 INFO L93 Difference]: Finished difference Result 12052 states and 15352 transitions. [2019-10-15 01:24:24,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:24:24,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-15 01:24:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:24,797 INFO L225 Difference]: With dead ends: 12052 [2019-10-15 01:24:24,797 INFO L226 Difference]: Without dead ends: 7504 [2019-10-15 01:24:24,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:24,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2019-10-15 01:24:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 6956. [2019-10-15 01:24:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6956 states. [2019-10-15 01:24:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6956 states to 6956 states and 8776 transitions. [2019-10-15 01:24:25,171 INFO L78 Accepts]: Start accepts. Automaton has 6956 states and 8776 transitions. Word has length 138 [2019-10-15 01:24:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,172 INFO L462 AbstractCegarLoop]: Abstraction has 6956 states and 8776 transitions. [2019-10-15 01:24:25,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 6956 states and 8776 transitions. [2019-10-15 01:24:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:24:25,176 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,176 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:25,177 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash -831933549, now seen corresponding path program 1 times [2019-10-15 01:24:25,177 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666077118] [2019-10-15 01:24:25,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:25,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666077118] [2019-10-15 01:24:25,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:25,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705677090] [2019-10-15 01:24:25,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:25,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:25,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:25,227 INFO L87 Difference]: Start difference. First operand 6956 states and 8776 transitions. Second operand 3 states. [2019-10-15 01:24:25,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,651 INFO L93 Difference]: Finished difference Result 13401 states and 16983 transitions. [2019-10-15 01:24:25,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:25,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-15 01:24:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,677 INFO L225 Difference]: With dead ends: 13401 [2019-10-15 01:24:25,678 INFO L226 Difference]: Without dead ends: 7025 [2019-10-15 01:24:25,695 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-15 01:24:25,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7025 states. [2019-10-15 01:24:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7025 to 6962. [2019-10-15 01:24:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6962 states. [2019-10-15 01:24:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6962 states to 6962 states and 8782 transitions. [2019-10-15 01:24:26,206 INFO L78 Accepts]: Start accepts. Automaton has 6962 states and 8782 transitions. Word has length 139 [2019-10-15 01:24:26,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:26,206 INFO L462 AbstractCegarLoop]: Abstraction has 6962 states and 8782 transitions. [2019-10-15 01:24:26,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 6962 states and 8782 transitions. [2019-10-15 01:24:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:24:26,210 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:26,210 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:26,211 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:26,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1719336114, now seen corresponding path program 1 times [2019-10-15 01:24:26,211 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:26,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428229567] [2019-10-15 01:24:26,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:26,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428229567] [2019-10-15 01:24:26,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:26,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:24:26,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543162135] [2019-10-15 01:24:26,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:24:26,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:26,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:24:26,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:24:26,605 INFO L87 Difference]: Start difference. First operand 6962 states and 8782 transitions. Second operand 12 states. [2019-10-15 01:24:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:30,250 INFO L93 Difference]: Finished difference Result 14034 states and 17725 transitions. [2019-10-15 01:24:30,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 01:24:30,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2019-10-15 01:24:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:30,274 INFO L225 Difference]: With dead ends: 14034 [2019-10-15 01:24:30,274 INFO L226 Difference]: Without dead ends: 7229 [2019-10-15 01:24:30,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2019-10-15 01:24:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2019-10-15 01:24:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 7020. [2019-10-15 01:24:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7020 states. [2019-10-15 01:24:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7020 states to 7020 states and 8846 transitions. [2019-10-15 01:24:30,887 INFO L78 Accepts]: Start accepts. Automaton has 7020 states and 8846 transitions. Word has length 140 [2019-10-15 01:24:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:30,887 INFO L462 AbstractCegarLoop]: Abstraction has 7020 states and 8846 transitions. [2019-10-15 01:24:30,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:24:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 7020 states and 8846 transitions. [2019-10-15 01:24:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:24:30,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:30,892 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:30,893 INFO L410 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash -221245900, now seen corresponding path program 1 times [2019-10-15 01:24:30,893 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:30,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486574505] [2019-10-15 01:24:30,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:30,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:30,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:31,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486574505] [2019-10-15 01:24:31,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:31,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 01:24:31,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155329992] [2019-10-15 01:24:31,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 01:24:31,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:31,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 01:24:31,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:24:31,240 INFO L87 Difference]: Start difference. First operand 7020 states and 8846 transitions. Second operand 14 states.