java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/systemc/token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:29:32,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:29:32,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:29:32,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:29:32,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:29:32,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:29:32,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:29:32,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:29:32,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:29:32,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:29:32,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:29:32,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:29:32,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:29:32,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:29:32,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:29:32,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:29:32,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:29:32,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:29:32,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:29:32,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:29:32,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:29:32,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:29:32,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:29:32,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:29:32,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:29:32,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:29:32,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:29:32,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:29:32,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:29:32,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:29:32,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:29:32,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:29:32,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:29:32,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:29:32,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:29:32,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:29:32,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:29:32,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:29:32,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:29:32,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:29:32,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:29:32,328 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:29:32,343 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:29:32,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:29:32,345 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:29:32,345 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:29:32,348 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:29:32,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:29:32,349 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:29:32,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:29:32,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:29:32,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:29:32,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:29:32,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:29:32,350 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:29:32,350 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:29:32,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:29:32,350 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:29:32,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:29:32,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:29:32,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:29:32,351 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:29:32,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:29:32,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:29:32,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:29:32,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:29:32,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:29:32,353 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:29:32,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:29:32,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:29:32,353 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:29:32,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:29:32,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:29:32,651 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:29:32,653 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:29:32,654 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:29:32,654 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-10-13 21:29:32,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56d44569e/2e19c08652874d60a91d17a5b4118095/FLAGf6feca578 [2019-10-13 21:29:33,324 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:29:33,325 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-10-13 21:29:33,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56d44569e/2e19c08652874d60a91d17a5b4118095/FLAGf6feca578 [2019-10-13 21:29:33,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56d44569e/2e19c08652874d60a91d17a5b4118095 [2019-10-13 21:29:33,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:29:33,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:29:33,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:33,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:29:33,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:29:33,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:33" (1/1) ... [2019-10-13 21:29:33,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e56186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:33, skipping insertion in model container [2019-10-13 21:29:33,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:33" (1/1) ... [2019-10-13 21:29:33,702 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:29:33,742 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:29:34,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:34,032 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:29:34,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:34,221 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:29:34,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:34 WrapperNode [2019-10-13 21:29:34,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:34,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:29:34,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:29:34,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:29:34,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:34" (1/1) ... [2019-10-13 21:29:34,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:34" (1/1) ... [2019-10-13 21:29:34,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:34" (1/1) ... [2019-10-13 21:29:34,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:34" (1/1) ... [2019-10-13 21:29:34,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:34" (1/1) ... [2019-10-13 21:29:34,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:34" (1/1) ... [2019-10-13 21:29:34,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:34" (1/1) ... [2019-10-13 21:29:34,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:29:34,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:29:34,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:29:34,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:29:34,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:29:34,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:29:34,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:29:34,335 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 21:29:34,335 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-13 21:29:34,335 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-13 21:29:34,335 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-13 21:29:34,336 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-13 21:29:34,336 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-13 21:29:34,337 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-13 21:29:34,337 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-13 21:29:34,338 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-13 21:29:34,338 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-13 21:29:34,338 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 21:29:34,339 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 21:29:34,339 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 21:29:34,340 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-13 21:29:34,342 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-13 21:29:34,342 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-13 21:29:34,342 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-13 21:29:34,342 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-13 21:29:34,342 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-13 21:29:34,343 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 21:29:34,343 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 21:29:34,343 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 21:29:34,343 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:29:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:29:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 21:29:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-13 21:29:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-13 21:29:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-13 21:29:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-13 21:29:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-13 21:29:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:29:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-13 21:29:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-13 21:29:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-13 21:29:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-13 21:29:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-13 21:29:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 21:29:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 21:29:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 21:29:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-13 21:29:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-13 21:29:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-13 21:29:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-13 21:29:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-13 21:29:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 21:29:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 21:29:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 21:29:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:29:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:29:34,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:29:35,037 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:29:35,037 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-13 21:29:35,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:35 BoogieIcfgContainer [2019-10-13 21:29:35,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:29:35,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:29:35,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:29:35,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:29:35,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:29:33" (1/3) ... [2019-10-13 21:29:35,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4347b233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:35, skipping insertion in model container [2019-10-13 21:29:35,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:34" (2/3) ... [2019-10-13 21:29:35,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4347b233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:35, skipping insertion in model container [2019-10-13 21:29:35,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:35" (3/3) ... [2019-10-13 21:29:35,049 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2019-10-13 21:29:35,061 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:29:35,070 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:29:35,083 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:29:35,115 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:29:35,115 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:29:35,115 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:29:35,116 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:29:35,116 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:29:35,116 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:29:35,116 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:29:35,117 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:29:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states. [2019-10-13 21:29:35,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:35,159 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:35,161 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] [2019-10-13 21:29:35,163 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:35,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:35,170 INFO L82 PathProgramCache]: Analyzing trace with hash -604727244, now seen corresponding path program 1 times [2019-10-13 21:29:35,179 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:35,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647759311] [2019-10-13 21:29:35,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:35,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:35,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:35,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647759311] [2019-10-13 21:29:35,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:35,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:35,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164030872] [2019-10-13 21:29:35,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:35,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:35,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:35,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:35,591 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 5 states. [2019-10-13 21:29:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:36,299 INFO L93 Difference]: Finished difference Result 438 states and 656 transitions. [2019-10-13 21:29:36,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:36,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:36,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:36,333 INFO L225 Difference]: With dead ends: 438 [2019-10-13 21:29:36,333 INFO L226 Difference]: Without dead ends: 236 [2019-10-13 21:29:36,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-13 21:29:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 202. [2019-10-13 21:29:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-13 21:29:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 280 transitions. [2019-10-13 21:29:36,419 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 280 transitions. Word has length 106 [2019-10-13 21:29:36,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:36,419 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 280 transitions. [2019-10-13 21:29:36,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 280 transitions. [2019-10-13 21:29:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:36,423 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:36,424 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] [2019-10-13 21:29:36,424 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:36,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:36,425 INFO L82 PathProgramCache]: Analyzing trace with hash 720128950, now seen corresponding path program 1 times [2019-10-13 21:29:36,425 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:36,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15221048] [2019-10-13 21:29:36,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:36,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:36,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:36,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15221048] [2019-10-13 21:29:36,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:36,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:36,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259152585] [2019-10-13 21:29:36,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:36,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:36,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:36,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:36,597 INFO L87 Difference]: Start difference. First operand 202 states and 280 transitions. Second operand 5 states. [2019-10-13 21:29:37,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:37,187 INFO L93 Difference]: Finished difference Result 417 states and 596 transitions. [2019-10-13 21:29:37,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:37,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:37,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:37,193 INFO L225 Difference]: With dead ends: 417 [2019-10-13 21:29:37,194 INFO L226 Difference]: Without dead ends: 236 [2019-10-13 21:29:37,199 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-13 21:29:37,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 202. [2019-10-13 21:29:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-13 21:29:37,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 279 transitions. [2019-10-13 21:29:37,247 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 279 transitions. Word has length 106 [2019-10-13 21:29:37,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:37,247 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 279 transitions. [2019-10-13 21:29:37,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:37,248 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 279 transitions. [2019-10-13 21:29:37,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:37,250 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:37,250 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] [2019-10-13 21:29:37,251 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:37,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:37,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2008080396, now seen corresponding path program 1 times [2019-10-13 21:29:37,251 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:37,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487734289] [2019-10-13 21:29:37,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:37,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:37,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:37,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487734289] [2019-10-13 21:29:37,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:37,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:37,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317125637] [2019-10-13 21:29:37,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:37,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:37,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:37,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:37,435 INFO L87 Difference]: Start difference. First operand 202 states and 279 transitions. Second operand 5 states. [2019-10-13 21:29:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:37,969 INFO L93 Difference]: Finished difference Result 415 states and 590 transitions. [2019-10-13 21:29:37,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:37,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:37,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:37,972 INFO L225 Difference]: With dead ends: 415 [2019-10-13 21:29:37,973 INFO L226 Difference]: Without dead ends: 234 [2019-10-13 21:29:37,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-13 21:29:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 202. [2019-10-13 21:29:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-13 21:29:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 278 transitions. [2019-10-13 21:29:37,998 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 278 transitions. Word has length 106 [2019-10-13 21:29:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:37,998 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 278 transitions. [2019-10-13 21:29:37,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 278 transitions. [2019-10-13 21:29:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:38,001 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:38,001 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] [2019-10-13 21:29:38,001 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:38,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1229048822, now seen corresponding path program 1 times [2019-10-13 21:29:38,002 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:38,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228809180] [2019-10-13 21:29:38,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:38,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:38,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:38,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228809180] [2019-10-13 21:29:38,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:38,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:38,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570187876] [2019-10-13 21:29:38,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:38,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:38,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:38,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:38,110 INFO L87 Difference]: Start difference. First operand 202 states and 278 transitions. Second operand 5 states. [2019-10-13 21:29:38,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:38,598 INFO L93 Difference]: Finished difference Result 433 states and 618 transitions. [2019-10-13 21:29:38,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:38,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:38,604 INFO L225 Difference]: With dead ends: 433 [2019-10-13 21:29:38,604 INFO L226 Difference]: Without dead ends: 252 [2019-10-13 21:29:38,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-10-13 21:29:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 202. [2019-10-13 21:29:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-13 21:29:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 277 transitions. [2019-10-13 21:29:38,669 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 277 transitions. Word has length 106 [2019-10-13 21:29:38,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:38,670 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 277 transitions. [2019-10-13 21:29:38,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 277 transitions. [2019-10-13 21:29:38,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:38,679 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:38,679 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] [2019-10-13 21:29:38,680 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:38,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:38,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1469288568, now seen corresponding path program 1 times [2019-10-13 21:29:38,681 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:38,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857007285] [2019-10-13 21:29:38,682 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:38,682 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:38,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:38,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857007285] [2019-10-13 21:29:38,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:38,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:38,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832195983] [2019-10-13 21:29:38,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:38,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:38,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:38,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:38,874 INFO L87 Difference]: Start difference. First operand 202 states and 277 transitions. Second operand 5 states. [2019-10-13 21:29:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:39,352 INFO L93 Difference]: Finished difference Result 427 states and 607 transitions. [2019-10-13 21:29:39,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:39,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:39,357 INFO L225 Difference]: With dead ends: 427 [2019-10-13 21:29:39,357 INFO L226 Difference]: Without dead ends: 246 [2019-10-13 21:29:39,358 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-13 21:29:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 202. [2019-10-13 21:29:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-13 21:29:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 276 transitions. [2019-10-13 21:29:39,383 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 276 transitions. Word has length 106 [2019-10-13 21:29:39,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:39,384 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 276 transitions. [2019-10-13 21:29:39,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 276 transitions. [2019-10-13 21:29:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:39,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:39,386 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] [2019-10-13 21:29:39,386 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:39,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:39,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1986645066, now seen corresponding path program 1 times [2019-10-13 21:29:39,387 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:39,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526017184] [2019-10-13 21:29:39,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:39,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:39,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:39,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526017184] [2019-10-13 21:29:39,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:39,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:39,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472963223] [2019-10-13 21:29:39,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:39,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:39,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:39,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:39,451 INFO L87 Difference]: Start difference. First operand 202 states and 276 transitions. Second operand 5 states. [2019-10-13 21:29:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:39,957 INFO L93 Difference]: Finished difference Result 429 states and 606 transitions. [2019-10-13 21:29:39,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:39,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:39,960 INFO L225 Difference]: With dead ends: 429 [2019-10-13 21:29:39,960 INFO L226 Difference]: Without dead ends: 248 [2019-10-13 21:29:39,961 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-13 21:29:39,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 202. [2019-10-13 21:29:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-13 21:29:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 275 transitions. [2019-10-13 21:29:39,982 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 275 transitions. Word has length 106 [2019-10-13 21:29:39,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:39,982 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 275 transitions. [2019-10-13 21:29:39,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 275 transitions. [2019-10-13 21:29:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:39,984 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:39,984 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] [2019-10-13 21:29:39,984 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:39,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:39,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1959579464, now seen corresponding path program 1 times [2019-10-13 21:29:39,985 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:39,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854809784] [2019-10-13 21:29:39,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:39,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:39,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:40,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854809784] [2019-10-13 21:29:40,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:40,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:40,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552014228] [2019-10-13 21:29:40,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:40,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:40,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:40,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:40,051 INFO L87 Difference]: Start difference. First operand 202 states and 275 transitions. Second operand 5 states. [2019-10-13 21:29:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:40,472 INFO L93 Difference]: Finished difference Result 427 states and 600 transitions. [2019-10-13 21:29:40,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:40,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:40,476 INFO L225 Difference]: With dead ends: 427 [2019-10-13 21:29:40,476 INFO L226 Difference]: Without dead ends: 246 [2019-10-13 21:29:40,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-13 21:29:40,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 202. [2019-10-13 21:29:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-13 21:29:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 274 transitions. [2019-10-13 21:29:40,497 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 274 transitions. Word has length 106 [2019-10-13 21:29:40,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:40,498 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 274 transitions. [2019-10-13 21:29:40,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 274 transitions. [2019-10-13 21:29:40,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:40,500 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:40,500 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] [2019-10-13 21:29:40,500 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:40,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:40,501 INFO L82 PathProgramCache]: Analyzing trace with hash 258050934, now seen corresponding path program 1 times [2019-10-13 21:29:40,501 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:40,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865792211] [2019-10-13 21:29:40,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:40,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:40,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:40,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865792211] [2019-10-13 21:29:40,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:40,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:40,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490752205] [2019-10-13 21:29:40,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:40,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:40,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:40,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:40,555 INFO L87 Difference]: Start difference. First operand 202 states and 274 transitions. Second operand 6 states. [2019-10-13 21:29:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:40,600 INFO L93 Difference]: Finished difference Result 398 states and 558 transitions. [2019-10-13 21:29:40,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:40,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2019-10-13 21:29:40,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:40,603 INFO L225 Difference]: With dead ends: 398 [2019-10-13 21:29:40,603 INFO L226 Difference]: Without dead ends: 218 [2019-10-13 21:29:40,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-13 21:29:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 207. [2019-10-13 21:29:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-10-13 21:29:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 279 transitions. [2019-10-13 21:29:40,642 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 279 transitions. Word has length 106 [2019-10-13 21:29:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:40,642 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 279 transitions. [2019-10-13 21:29:40,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 279 transitions. [2019-10-13 21:29:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:40,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:40,645 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:40,645 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash -159345672, now seen corresponding path program 1 times [2019-10-13 21:29:40,646 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:40,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54656725] [2019-10-13 21:29:40,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:40,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:40,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:40,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54656725] [2019-10-13 21:29:40,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:40,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:40,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060060071] [2019-10-13 21:29:40,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:40,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:40,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:40,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:40,708 INFO L87 Difference]: Start difference. First operand 207 states and 279 transitions. Second operand 6 states. [2019-10-13 21:29:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:40,751 INFO L93 Difference]: Finished difference Result 405 states and 563 transitions. [2019-10-13 21:29:40,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:40,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2019-10-13 21:29:40,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:40,754 INFO L225 Difference]: With dead ends: 405 [2019-10-13 21:29:40,754 INFO L226 Difference]: Without dead ends: 220 [2019-10-13 21:29:40,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-13 21:29:40,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 212. [2019-10-13 21:29:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-13 21:29:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2019-10-13 21:29:40,775 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 106 [2019-10-13 21:29:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:40,775 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2019-10-13 21:29:40,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2019-10-13 21:29:40,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:40,777 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:40,777 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] [2019-10-13 21:29:40,777 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:40,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:40,778 INFO L82 PathProgramCache]: Analyzing trace with hash 716673334, now seen corresponding path program 1 times [2019-10-13 21:29:40,778 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:40,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597288272] [2019-10-13 21:29:40,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:40,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:40,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:40,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597288272] [2019-10-13 21:29:40,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:40,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:40,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096198668] [2019-10-13 21:29:40,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:40,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:40,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:40,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:40,837 INFO L87 Difference]: Start difference. First operand 212 states and 284 transitions. Second operand 6 states. [2019-10-13 21:29:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:40,881 INFO L93 Difference]: Finished difference Result 412 states and 568 transitions. [2019-10-13 21:29:40,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:40,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2019-10-13 21:29:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:40,884 INFO L225 Difference]: With dead ends: 412 [2019-10-13 21:29:40,884 INFO L226 Difference]: Without dead ends: 222 [2019-10-13 21:29:40,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-13 21:29:40,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2019-10-13 21:29:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-13 21:29:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2019-10-13 21:29:40,905 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 106 [2019-10-13 21:29:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:40,906 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2019-10-13 21:29:40,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2019-10-13 21:29:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:40,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:40,908 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] [2019-10-13 21:29:40,908 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:40,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:40,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1610159672, now seen corresponding path program 1 times [2019-10-13 21:29:40,909 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:40,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271049321] [2019-10-13 21:29:40,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:40,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:40,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:40,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271049321] [2019-10-13 21:29:40,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:40,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:40,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095863792] [2019-10-13 21:29:40,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:40,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:40,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:40,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:40,968 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 6 states. [2019-10-13 21:29:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:41,012 INFO L93 Difference]: Finished difference Result 419 states and 573 transitions. [2019-10-13 21:29:41,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:41,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2019-10-13 21:29:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:41,015 INFO L225 Difference]: With dead ends: 419 [2019-10-13 21:29:41,015 INFO L226 Difference]: Without dead ends: 224 [2019-10-13 21:29:41,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-13 21:29:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2019-10-13 21:29:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-10-13 21:29:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 294 transitions. [2019-10-13 21:29:41,041 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 294 transitions. Word has length 106 [2019-10-13 21:29:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:41,042 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 294 transitions. [2019-10-13 21:29:41,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 294 transitions. [2019-10-13 21:29:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:41,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:41,044 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] [2019-10-13 21:29:41,044 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:41,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:41,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1215792886, now seen corresponding path program 1 times [2019-10-13 21:29:41,045 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:41,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797237613] [2019-10-13 21:29:41,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:41,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:41,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:41,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:41,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797237613] [2019-10-13 21:29:41,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:41,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:41,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640878770] [2019-10-13 21:29:41,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:41,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:41,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:41,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:41,146 INFO L87 Difference]: Start difference. First operand 222 states and 294 transitions. Second operand 5 states. [2019-10-13 21:29:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:41,726 INFO L93 Difference]: Finished difference Result 509 states and 675 transitions. [2019-10-13 21:29:41,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:41,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:41,729 INFO L225 Difference]: With dead ends: 509 [2019-10-13 21:29:41,729 INFO L226 Difference]: Without dead ends: 310 [2019-10-13 21:29:41,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-10-13 21:29:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 285. [2019-10-13 21:29:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-13 21:29:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 367 transitions. [2019-10-13 21:29:41,754 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 367 transitions. Word has length 106 [2019-10-13 21:29:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:41,754 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 367 transitions. [2019-10-13 21:29:41,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:41,755 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 367 transitions. [2019-10-13 21:29:41,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:41,756 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:41,756 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] [2019-10-13 21:29:41,757 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:41,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:41,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1490552500, now seen corresponding path program 1 times [2019-10-13 21:29:41,757 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:41,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327085922] [2019-10-13 21:29:41,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:41,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:41,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:41,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327085922] [2019-10-13 21:29:41,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:41,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:41,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560266279] [2019-10-13 21:29:41,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:41,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:41,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:41,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:41,829 INFO L87 Difference]: Start difference. First operand 285 states and 367 transitions. Second operand 5 states. [2019-10-13 21:29:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:42,256 INFO L93 Difference]: Finished difference Result 547 states and 706 transitions. [2019-10-13 21:29:42,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:42,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:42,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:42,259 INFO L225 Difference]: With dead ends: 547 [2019-10-13 21:29:42,259 INFO L226 Difference]: Without dead ends: 285 [2019-10-13 21:29:42,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:42,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-13 21:29:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2019-10-13 21:29:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-13 21:29:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 365 transitions. [2019-10-13 21:29:42,285 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 365 transitions. Word has length 106 [2019-10-13 21:29:42,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:42,285 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 365 transitions. [2019-10-13 21:29:42,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 365 transitions. [2019-10-13 21:29:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:42,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:42,287 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] [2019-10-13 21:29:42,287 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:42,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:42,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2102814922, now seen corresponding path program 1 times [2019-10-13 21:29:42,288 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:42,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109632645] [2019-10-13 21:29:42,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:42,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:42,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:42,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109632645] [2019-10-13 21:29:42,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:42,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:42,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688085681] [2019-10-13 21:29:42,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:42,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:42,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:42,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:42,364 INFO L87 Difference]: Start difference. First operand 285 states and 365 transitions. Second operand 5 states. [2019-10-13 21:29:42,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:42,814 INFO L93 Difference]: Finished difference Result 547 states and 702 transitions. [2019-10-13 21:29:42,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:42,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:42,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:42,818 INFO L225 Difference]: With dead ends: 547 [2019-10-13 21:29:42,818 INFO L226 Difference]: Without dead ends: 285 [2019-10-13 21:29:42,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-13 21:29:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2019-10-13 21:29:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-13 21:29:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 363 transitions. [2019-10-13 21:29:42,851 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 363 transitions. Word has length 106 [2019-10-13 21:29:42,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:42,852 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 363 transitions. [2019-10-13 21:29:42,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 363 transitions. [2019-10-13 21:29:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:42,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:42,855 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:42,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:42,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2080182668, now seen corresponding path program 1 times [2019-10-13 21:29:42,856 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:42,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979548263] [2019-10-13 21:29:42,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:42,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:42,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:42,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979548263] [2019-10-13 21:29:42,929 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:42,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:42,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413117951] [2019-10-13 21:29:42,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:42,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:42,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:42,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:42,931 INFO L87 Difference]: Start difference. First operand 285 states and 363 transitions. Second operand 5 states. [2019-10-13 21:29:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:43,485 INFO L93 Difference]: Finished difference Result 648 states and 835 transitions. [2019-10-13 21:29:43,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:43,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:43,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:43,489 INFO L225 Difference]: With dead ends: 648 [2019-10-13 21:29:43,489 INFO L226 Difference]: Without dead ends: 386 [2019-10-13 21:29:43,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-13 21:29:43,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-10-13 21:29:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 368. [2019-10-13 21:29:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-10-13 21:29:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 466 transitions. [2019-10-13 21:29:43,521 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 466 transitions. Word has length 106 [2019-10-13 21:29:43,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:43,521 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 466 transitions. [2019-10-13 21:29:43,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 466 transitions. [2019-10-13 21:29:43,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:43,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:43,524 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] [2019-10-13 21:29:43,524 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:43,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:43,524 INFO L82 PathProgramCache]: Analyzing trace with hash -693979274, now seen corresponding path program 1 times [2019-10-13 21:29:43,525 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:43,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135371316] [2019-10-13 21:29:43,525 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:43,525 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:43,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:43,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135371316] [2019-10-13 21:29:43,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:43,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:43,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470760853] [2019-10-13 21:29:43,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:43,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:43,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:43,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:43,597 INFO L87 Difference]: Start difference. First operand 368 states and 466 transitions. Second operand 5 states. [2019-10-13 21:29:44,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:44,272 INFO L93 Difference]: Finished difference Result 856 states and 1128 transitions. [2019-10-13 21:29:44,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:44,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:44,277 INFO L225 Difference]: With dead ends: 856 [2019-10-13 21:29:44,277 INFO L226 Difference]: Without dead ends: 511 [2019-10-13 21:29:44,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-13 21:29:44,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-10-13 21:29:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 419. [2019-10-13 21:29:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-10-13 21:29:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 522 transitions. [2019-10-13 21:29:44,326 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 522 transitions. Word has length 106 [2019-10-13 21:29:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:44,326 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 522 transitions. [2019-10-13 21:29:44,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:44,327 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 522 transitions. [2019-10-13 21:29:44,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:44,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:44,329 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] [2019-10-13 21:29:44,329 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:44,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:44,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1203452364, now seen corresponding path program 1 times [2019-10-13 21:29:44,330 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:44,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274138009] [2019-10-13 21:29:44,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:44,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:44,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:44,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274138009] [2019-10-13 21:29:44,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:44,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:44,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598460018] [2019-10-13 21:29:44,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:44,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:44,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:44,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:44,407 INFO L87 Difference]: Start difference. First operand 419 states and 522 transitions. Second operand 5 states. [2019-10-13 21:29:44,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:44,985 INFO L93 Difference]: Finished difference Result 929 states and 1208 transitions. [2019-10-13 21:29:44,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:44,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:44,990 INFO L225 Difference]: With dead ends: 929 [2019-10-13 21:29:44,991 INFO L226 Difference]: Without dead ends: 533 [2019-10-13 21:29:44,993 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-13 21:29:44,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-13 21:29:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 460. [2019-10-13 21:29:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-10-13 21:29:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 564 transitions. [2019-10-13 21:29:45,036 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 564 transitions. Word has length 106 [2019-10-13 21:29:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:45,037 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 564 transitions. [2019-10-13 21:29:45,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 564 transitions. [2019-10-13 21:29:45,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:45,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:45,039 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] [2019-10-13 21:29:45,039 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:45,040 INFO L82 PathProgramCache]: Analyzing trace with hash 719775670, now seen corresponding path program 1 times [2019-10-13 21:29:45,040 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:45,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244199500] [2019-10-13 21:29:45,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:45,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:45,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:45,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244199500] [2019-10-13 21:29:45,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:45,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:45,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865439497] [2019-10-13 21:29:45,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:45,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:45,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:45,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:45,157 INFO L87 Difference]: Start difference. First operand 460 states and 564 transitions. Second operand 5 states. [2019-10-13 21:29:45,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:45,757 INFO L93 Difference]: Finished difference Result 975 states and 1252 transitions. [2019-10-13 21:29:45,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:45,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:45,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:45,762 INFO L225 Difference]: With dead ends: 975 [2019-10-13 21:29:45,762 INFO L226 Difference]: Without dead ends: 538 [2019-10-13 21:29:45,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-10-13 21:29:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 491. [2019-10-13 21:29:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-10-13 21:29:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 592 transitions. [2019-10-13 21:29:45,807 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 592 transitions. Word has length 106 [2019-10-13 21:29:45,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:45,808 INFO L462 AbstractCegarLoop]: Abstraction has 491 states and 592 transitions. [2019-10-13 21:29:45,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 592 transitions. [2019-10-13 21:29:45,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:45,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:45,810 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] [2019-10-13 21:29:45,810 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:45,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:45,810 INFO L82 PathProgramCache]: Analyzing trace with hash 860324280, now seen corresponding path program 1 times [2019-10-13 21:29:45,810 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:45,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306100019] [2019-10-13 21:29:45,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:45,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:45,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:45,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306100019] [2019-10-13 21:29:45,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:45,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:45,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105494159] [2019-10-13 21:29:45,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:45,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:45,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:45,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:45,858 INFO L87 Difference]: Start difference. First operand 491 states and 592 transitions. Second operand 3 states. [2019-10-13 21:29:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:45,939 INFO L93 Difference]: Finished difference Result 1396 states and 1728 transitions. [2019-10-13 21:29:45,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:45,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-13 21:29:45,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:45,946 INFO L225 Difference]: With dead ends: 1396 [2019-10-13 21:29:45,946 INFO L226 Difference]: Without dead ends: 928 [2019-10-13 21:29:45,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-10-13 21:29:46,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 927. [2019-10-13 21:29:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-10-13 21:29:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1127 transitions. [2019-10-13 21:29:46,028 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1127 transitions. Word has length 106 [2019-10-13 21:29:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:46,029 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 1127 transitions. [2019-10-13 21:29:46,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1127 transitions. [2019-10-13 21:29:46,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-13 21:29:46,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:46,034 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:46,034 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:46,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:46,034 INFO L82 PathProgramCache]: Analyzing trace with hash -525557290, now seen corresponding path program 1 times [2019-10-13 21:29:46,035 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:46,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730621] [2019-10-13 21:29:46,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:46,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:46,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:29:46,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730621] [2019-10-13 21:29:46,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254192202] [2019-10-13 21:29:46,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:46,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:46,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:46,480 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:29:46,688 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:46,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [4] total 6 [2019-10-13 21:29:46,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177332446] [2019-10-13 21:29:46,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:46,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:46,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:46,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:46,692 INFO L87 Difference]: Start difference. First operand 927 states and 1127 transitions. Second operand 4 states. [2019-10-13 21:29:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:46,909 INFO L93 Difference]: Finished difference Result 1829 states and 2223 transitions. [2019-10-13 21:29:46,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:46,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-10-13 21:29:46,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:46,916 INFO L225 Difference]: With dead ends: 1829 [2019-10-13 21:29:46,916 INFO L226 Difference]: Without dead ends: 927 [2019-10-13 21:29:46,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-10-13 21:29:46,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 927. [2019-10-13 21:29:46,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-10-13 21:29:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1117 transitions. [2019-10-13 21:29:46,999 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1117 transitions. Word has length 172 [2019-10-13 21:29:46,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:46,999 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 1117 transitions. [2019-10-13 21:29:47,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1117 transitions. [2019-10-13 21:29:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-13 21:29:47,004 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:47,004 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:47,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:47,210 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:47,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:47,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1872823811, now seen corresponding path program 1 times [2019-10-13 21:29:47,211 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:47,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129633402] [2019-10-13 21:29:47,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:47,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:47,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-13 21:29:47,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129633402] [2019-10-13 21:29:47,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:47,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:47,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829896417] [2019-10-13 21:29:47,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:47,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:47,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:47,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:47,278 INFO L87 Difference]: Start difference. First operand 927 states and 1117 transitions. Second operand 4 states. [2019-10-13 21:29:47,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:47,666 INFO L93 Difference]: Finished difference Result 2601 states and 3154 transitions. [2019-10-13 21:29:47,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:47,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-10-13 21:29:47,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:47,677 INFO L225 Difference]: With dead ends: 2601 [2019-10-13 21:29:47,677 INFO L226 Difference]: Without dead ends: 1310 [2019-10-13 21:29:47,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:47,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-10-13 21:29:47,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1310. [2019-10-13 21:29:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-10-13 21:29:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1569 transitions. [2019-10-13 21:29:47,795 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1569 transitions. Word has length 171 [2019-10-13 21:29:47,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:47,796 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1569 transitions. [2019-10-13 21:29:47,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:47,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1569 transitions. [2019-10-13 21:29:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-13 21:29:47,801 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:47,802 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:47,802 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:47,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:47,802 INFO L82 PathProgramCache]: Analyzing trace with hash 88690440, now seen corresponding path program 1 times [2019-10-13 21:29:47,803 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:47,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402119268] [2019-10-13 21:29:47,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:47,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:47,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-13 21:29:47,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402119268] [2019-10-13 21:29:47,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330895100] [2019-10-13 21:29:47,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:48,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:48,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-13 21:29:48,161 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-13 21:29:48,452 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:48,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 7 [2019-10-13 21:29:48,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080324073] [2019-10-13 21:29:48,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:48,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:48,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:48,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:48,455 INFO L87 Difference]: Start difference. First operand 1310 states and 1569 transitions. Second operand 4 states. [2019-10-13 21:29:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:48,810 INFO L93 Difference]: Finished difference Result 3278 states and 4039 transitions. [2019-10-13 21:29:48,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:48,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2019-10-13 21:29:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:48,825 INFO L225 Difference]: With dead ends: 3278 [2019-10-13 21:29:48,825 INFO L226 Difference]: Without dead ends: 1991 [2019-10-13 21:29:48,831 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-10-13 21:29:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1987. [2019-10-13 21:29:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-10-13 21:29:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2327 transitions. [2019-10-13 21:29:49,028 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2327 transitions. Word has length 224 [2019-10-13 21:29:49,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:49,029 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 2327 transitions. [2019-10-13 21:29:49,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2327 transitions. [2019-10-13 21:29:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-13 21:29:49,037 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:49,038 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:49,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:49,244 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:49,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:49,245 INFO L82 PathProgramCache]: Analyzing trace with hash -217774392, now seen corresponding path program 1 times [2019-10-13 21:29:49,246 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:49,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886475000] [2019-10-13 21:29:49,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:49,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:49,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-13 21:29:49,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886475000] [2019-10-13 21:29:49,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837289201] [2019-10-13 21:29:49,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:49,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:49,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-13 21:29:49,640 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-13 21:29:49,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:49,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-10-13 21:29:49,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362450013] [2019-10-13 21:29:49,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:49,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:49,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:49,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:49,839 INFO L87 Difference]: Start difference. First operand 1987 states and 2327 transitions. Second operand 3 states. [2019-10-13 21:29:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:49,967 INFO L93 Difference]: Finished difference Result 3940 states and 4629 transitions. [2019-10-13 21:29:49,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:49,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-10-13 21:29:49,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:49,979 INFO L225 Difference]: With dead ends: 3940 [2019-10-13 21:29:49,980 INFO L226 Difference]: Without dead ends: 1978 [2019-10-13 21:29:49,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2019-10-13 21:29:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2019-10-13 21:29:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-10-13 21:29:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2303 transitions. [2019-10-13 21:29:50,168 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2303 transitions. Word has length 246 [2019-10-13 21:29:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:50,168 INFO L462 AbstractCegarLoop]: Abstraction has 1978 states and 2303 transitions. [2019-10-13 21:29:50,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2303 transitions. [2019-10-13 21:29:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-10-13 21:29:50,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:50,180 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:50,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:50,388 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:50,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:50,389 INFO L82 PathProgramCache]: Analyzing trace with hash -201466467, now seen corresponding path program 1 times [2019-10-13 21:29:50,389 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:50,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954482749] [2019-10-13 21:29:50,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:50,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:50,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 31 proven. 26 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-10-13 21:29:50,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954482749] [2019-10-13 21:29:50,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735310480] [2019-10-13 21:29:50,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:50,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:29:50,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:51,091 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-10-13 21:29:51,092 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-10-13 21:29:51,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:51,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 12 [2019-10-13 21:29:51,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257679042] [2019-10-13 21:29:51,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:51,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:51,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:51,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:29:51,485 INFO L87 Difference]: Start difference. First operand 1978 states and 2303 transitions. Second operand 6 states. [2019-10-13 21:29:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:51,726 INFO L93 Difference]: Finished difference Result 3538 states and 4145 transitions. [2019-10-13 21:29:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:29:51,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 353 [2019-10-13 21:29:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:51,741 INFO L225 Difference]: With dead ends: 3538 [2019-10-13 21:29:51,741 INFO L226 Difference]: Without dead ends: 1585 [2019-10-13 21:29:51,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 702 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:29:51,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-10-13 21:29:51,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1551. [2019-10-13 21:29:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551 states. [2019-10-13 21:29:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 1802 transitions. [2019-10-13 21:29:51,952 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 1802 transitions. Word has length 353 [2019-10-13 21:29:51,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:51,953 INFO L462 AbstractCegarLoop]: Abstraction has 1551 states and 1802 transitions. [2019-10-13 21:29:51,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:51,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 1802 transitions. [2019-10-13 21:29:51,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-13 21:29:51,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:51,965 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:52,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:52,173 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:52,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:52,173 INFO L82 PathProgramCache]: Analyzing trace with hash 228507631, now seen corresponding path program 1 times [2019-10-13 21:29:52,173 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:52,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44938686] [2019-10-13 21:29:52,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:52,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:52,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-13 21:29:52,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44938686] [2019-10-13 21:29:52,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568660282] [2019-10-13 21:29:52,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:52,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:52,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-13 21:29:52,590 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-13 21:29:52,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:52,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 7 [2019-10-13 21:29:52,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216253133] [2019-10-13 21:29:52,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:52,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:52,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:52,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:52,811 INFO L87 Difference]: Start difference. First operand 1551 states and 1802 transitions. Second operand 3 states. [2019-10-13 21:29:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:53,109 INFO L93 Difference]: Finished difference Result 4329 states and 5055 transitions. [2019-10-13 21:29:53,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:53,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-10-13 21:29:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:53,123 INFO L225 Difference]: With dead ends: 4329 [2019-10-13 21:29:53,123 INFO L226 Difference]: Without dead ends: 2282 [2019-10-13 21:29:53,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:53,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-10-13 21:29:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2278. [2019-10-13 21:29:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2278 states. [2019-10-13 21:29:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 2670 transitions. [2019-10-13 21:29:53,342 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 2670 transitions. Word has length 246 [2019-10-13 21:29:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:53,343 INFO L462 AbstractCegarLoop]: Abstraction has 2278 states and 2670 transitions. [2019-10-13 21:29:53,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 2670 transitions. [2019-10-13 21:29:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-13 21:29:53,352 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:53,352 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:53,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:53,559 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:53,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:53,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1290651702, now seen corresponding path program 1 times [2019-10-13 21:29:53,560 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:53,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118921518] [2019-10-13 21:29:53,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:53,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:53,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-10-13 21:29:53,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118921518] [2019-10-13 21:29:53,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485747949] [2019-10-13 21:29:53,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:54,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:54,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-13 21:29:54,145 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-13 21:29:54,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:54,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 5 [2019-10-13 21:29:54,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285381422] [2019-10-13 21:29:54,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:54,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:54,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:54,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:54,365 INFO L87 Difference]: Start difference. First operand 2278 states and 2670 transitions. Second operand 3 states. [2019-10-13 21:29:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:54,762 INFO L93 Difference]: Finished difference Result 6077 states and 7186 transitions. [2019-10-13 21:29:54,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:54,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-10-13 21:29:54,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:54,794 INFO L225 Difference]: With dead ends: 6077 [2019-10-13 21:29:54,794 INFO L226 Difference]: Without dead ends: 3912 [2019-10-13 21:29:54,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2019-10-13 21:29:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3896. [2019-10-13 21:29:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3896 states. [2019-10-13 21:29:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3896 states and 4581 transitions. [2019-10-13 21:29:55,390 INFO L78 Accepts]: Start accepts. Automaton has 3896 states and 4581 transitions. Word has length 300 [2019-10-13 21:29:55,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:55,391 INFO L462 AbstractCegarLoop]: Abstraction has 3896 states and 4581 transitions. [2019-10-13 21:29:55,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3896 states and 4581 transitions. [2019-10-13 21:29:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-10-13 21:29:55,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:55,411 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:55,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:55,617 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:55,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:55,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1251677997, now seen corresponding path program 1 times [2019-10-13 21:29:55,617 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:55,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604295451] [2019-10-13 21:29:55,618 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:55,618 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:55,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 64 proven. 46 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-10-13 21:29:55,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604295451] [2019-10-13 21:29:55,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061626786] [2019-10-13 21:29:55,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:56,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 1705 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:56,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-10-13 21:29:56,252 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 64 proven. 46 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-10-13 21:29:56,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:56,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-10-13 21:29:56,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243225558] [2019-10-13 21:29:56,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:56,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:56,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:56,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:56,700 INFO L87 Difference]: Start difference. First operand 3896 states and 4581 transitions. Second operand 3 states. [2019-10-13 21:29:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:57,258 INFO L93 Difference]: Finished difference Result 10995 states and 13551 transitions. [2019-10-13 21:29:57,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:57,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 436 [2019-10-13 21:29:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:57,307 INFO L225 Difference]: With dead ends: 10995 [2019-10-13 21:29:57,307 INFO L226 Difference]: Without dead ends: 7353 [2019-10-13 21:29:57,332 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 875 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7353 states. [2019-10-13 21:29:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7353 to 7323. [2019-10-13 21:29:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7323 states. [2019-10-13 21:29:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7323 states to 7323 states and 8831 transitions. [2019-10-13 21:29:58,104 INFO L78 Accepts]: Start accepts. Automaton has 7323 states and 8831 transitions. Word has length 436 [2019-10-13 21:29:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:58,105 INFO L462 AbstractCegarLoop]: Abstraction has 7323 states and 8831 transitions. [2019-10-13 21:29:58,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7323 states and 8831 transitions. [2019-10-13 21:29:58,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-13 21:29:58,133 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:58,134 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:58,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:58,341 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:58,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:58,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1206124256, now seen corresponding path program 1 times [2019-10-13 21:29:58,341 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:58,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202757810] [2019-10-13 21:29:58,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:58,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:58,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2019-10-13 21:29:58,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202757810] [2019-10-13 21:29:58,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357810835] [2019-10-13 21:29:58,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:58,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:58,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-13 21:29:58,790 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2019-10-13 21:29:59,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:59,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2019-10-13 21:29:59,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339903256] [2019-10-13 21:29:59,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:59,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:59,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:59,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:59,215 INFO L87 Difference]: Start difference. First operand 7323 states and 8831 transitions. Second operand 3 states. [2019-10-13 21:29:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:59,942 INFO L93 Difference]: Finished difference Result 16515 states and 20927 transitions. [2019-10-13 21:29:59,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:59,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-10-13 21:29:59,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:00,001 INFO L225 Difference]: With dead ends: 16515 [2019-10-13 21:30:00,001 INFO L226 Difference]: Without dead ends: 9639 [2019-10-13 21:30:00,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:00,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9639 states. [2019-10-13 21:30:00,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9639 to 9607. [2019-10-13 21:30:00,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9607 states. [2019-10-13 21:30:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9607 states to 9607 states and 11529 transitions. [2019-10-13 21:30:00,968 INFO L78 Accepts]: Start accepts. Automaton has 9607 states and 11529 transitions. Word has length 302 [2019-10-13 21:30:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:00,969 INFO L462 AbstractCegarLoop]: Abstraction has 9607 states and 11529 transitions. [2019-10-13 21:30:00,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:30:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 9607 states and 11529 transitions. [2019-10-13 21:30:01,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-13 21:30:01,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:01,014 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:01,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:30:01,227 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:01,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:01,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1246365813, now seen corresponding path program 1 times [2019-10-13 21:30:01,227 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:01,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897499060] [2019-10-13 21:30:01,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:01,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:01,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-10-13 21:30:01,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897499060] [2019-10-13 21:30:01,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:01,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:30:01,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879506593] [2019-10-13 21:30:01,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:30:01,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:01,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:30:01,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:30:01,313 INFO L87 Difference]: Start difference. First operand 9607 states and 11529 transitions. Second operand 4 states. [2019-10-13 21:30:01,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:01,834 INFO L93 Difference]: Finished difference Result 15720 states and 18772 transitions. [2019-10-13 21:30:01,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:30:01,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 301 [2019-10-13 21:30:01,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:01,868 INFO L225 Difference]: With dead ends: 15720 [2019-10-13 21:30:01,868 INFO L226 Difference]: Without dead ends: 6482 [2019-10-13 21:30:01,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:30:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6482 states. [2019-10-13 21:30:02,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6482 to 6482. [2019-10-13 21:30:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6482 states. [2019-10-13 21:30:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6482 states to 6482 states and 7660 transitions. [2019-10-13 21:30:02,970 INFO L78 Accepts]: Start accepts. Automaton has 6482 states and 7660 transitions. Word has length 301 [2019-10-13 21:30:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:02,970 INFO L462 AbstractCegarLoop]: Abstraction has 6482 states and 7660 transitions. [2019-10-13 21:30:02,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:30:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 6482 states and 7660 transitions. [2019-10-13 21:30:02,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-13 21:30:02,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:02,997 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:02,997 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:02,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:02,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1113317350, now seen corresponding path program 1 times [2019-10-13 21:30:03,000 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:03,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247519629] [2019-10-13 21:30:03,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:03,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:03,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:03,117 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-10-13 21:30:03,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247519629] [2019-10-13 21:30:03,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606447190] [2019-10-13 21:30:03,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:30:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:03,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:30:03,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:30:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-13 21:30:03,536 INFO L321 TraceCheckSpWp]: Computing backward predicates...