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.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:33,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:33,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:33,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:33,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:33,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:33,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:33,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:33,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:33,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:33,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:33,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:33,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:33,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:33,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:33,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:33,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:33,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:33,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:33,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:33,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:33,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:33,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:33,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:33,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:33,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:33,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:33,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:33,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:33,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:33,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:33,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:33,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:33,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:33,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:33,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:33,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:33,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:33,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:33,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:33,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:33,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:28:33,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:33,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:33,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:33,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:33,570 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:33,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:33,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:33,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:33,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:33,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:33,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:33,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:33,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:33,572 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:33,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:33,572 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:33,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:33,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:33,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:33,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:33,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:33,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:33,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:33,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:33,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:33,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:33,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:33,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:33,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:28:33,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:33,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:33,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:33,905 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:33,905 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:33,905 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2019-10-15 01:28:33,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9814649d/21ec631aa73b430fabfe0e79052ba9cd/FLAGad78c805c [2019-10-15 01:28:34,383 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:34,384 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2019-10-15 01:28:34,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9814649d/21ec631aa73b430fabfe0e79052ba9cd/FLAGad78c805c [2019-10-15 01:28:34,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9814649d/21ec631aa73b430fabfe0e79052ba9cd [2019-10-15 01:28:34,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:34,798 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:34,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:34,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:34,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:34,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:34" (1/1) ... [2019-10-15 01:28:34,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7492c7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:34, skipping insertion in model container [2019-10-15 01:28:34,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:34" (1/1) ... [2019-10-15 01:28:34,817 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:34,860 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:35,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:35,116 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:35,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:35,256 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:35,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:35 WrapperNode [2019-10-15 01:28:35,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:35,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:35,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:35,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:35,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:35" (1/1) ... [2019-10-15 01:28:35,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:35" (1/1) ... [2019-10-15 01:28:35,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:35" (1/1) ... [2019-10-15 01:28:35,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:35" (1/1) ... [2019-10-15 01:28:35,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:35" (1/1) ... [2019-10-15 01:28:35,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:35" (1/1) ... [2019-10-15 01:28:35,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:35" (1/1) ... [2019-10-15 01:28:35,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:35,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:35,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:35,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:35,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:35,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:35,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:35,367 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:28:35,368 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-15 01:28:35,368 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-15 01:28:35,368 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-15 01:28:35,368 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-15 01:28:35,368 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-15 01:28:35,368 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-15 01:28:35,369 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-15 01:28:35,369 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-15 01:28:35,369 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-15 01:28:35,369 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:28:35,369 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-15 01:28:35,369 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-15 01:28:35,370 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-15 01:28:35,370 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-15 01:28:35,370 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-15 01:28:35,370 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-15 01:28:35,370 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-15 01:28:35,370 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-15 01:28:35,370 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:28:35,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:35,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:35,371 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:28:35,371 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-15 01:28:35,371 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-15 01:28:35,371 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-15 01:28:35,372 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-15 01:28:35,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:35,372 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-15 01:28:35,372 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-15 01:28:35,372 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-15 01:28:35,372 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-15 01:28:35,373 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-15 01:28:35,373 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-15 01:28:35,373 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:28:35,373 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-15 01:28:35,373 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-15 01:28:35,373 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-15 01:28:35,373 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-15 01:28:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-15 01:28:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-15 01:28:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-15 01:28:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:28:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:35,965 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:35,966 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-15 01:28:35,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:35 BoogieIcfgContainer [2019-10-15 01:28:35,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:35,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:35,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:35,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:35,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:34" (1/3) ... [2019-10-15 01:28:35,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7beb9446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:35, skipping insertion in model container [2019-10-15 01:28:35,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:35" (2/3) ... [2019-10-15 01:28:35,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7beb9446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:35, skipping insertion in model container [2019-10-15 01:28:35,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:35" (3/3) ... [2019-10-15 01:28:35,976 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2019-10-15 01:28:35,986 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:35,994 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:36,006 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:36,034 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:36,035 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:36,035 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:36,035 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:36,035 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:36,036 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:36,036 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:36,036 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:36,060 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2019-10-15 01:28:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:28:36,073 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:36,074 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] [2019-10-15 01:28:36,076 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:36,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:36,082 INFO L82 PathProgramCache]: Analyzing trace with hash -67309704, now seen corresponding path program 1 times [2019-10-15 01:28:36,091 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:36,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040824768] [2019-10-15 01:28:36,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:36,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:36,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:36,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040824768] [2019-10-15 01:28:36,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:36,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:36,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111394985] [2019-10-15 01:28:36,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:36,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:36,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:36,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:36,471 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 5 states. [2019-10-15 01:28:37,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:37,094 INFO L93 Difference]: Finished difference Result 375 states and 554 transitions. [2019-10-15 01:28:37,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:37,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-15 01:28:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:37,112 INFO L225 Difference]: With dead ends: 375 [2019-10-15 01:28:37,112 INFO L226 Difference]: Without dead ends: 202 [2019-10-15 01:28:37,118 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-15 01:28:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-15 01:28:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 172. [2019-10-15 01:28:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-15 01:28:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 234 transitions. [2019-10-15 01:28:37,228 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 234 transitions. Word has length 92 [2019-10-15 01:28:37,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:37,228 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 234 transitions. [2019-10-15 01:28:37,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 234 transitions. [2019-10-15 01:28:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:28:37,234 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:37,234 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] [2019-10-15 01:28:37,235 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:37,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:37,235 INFO L82 PathProgramCache]: Analyzing trace with hash -559935878, now seen corresponding path program 1 times [2019-10-15 01:28:37,235 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:37,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296603678] [2019-10-15 01:28:37,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:37,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:37,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:37,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296603678] [2019-10-15 01:28:37,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:37,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:37,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424756072] [2019-10-15 01:28:37,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:37,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:37,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:37,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:37,427 INFO L87 Difference]: Start difference. First operand 172 states and 234 transitions. Second operand 5 states. [2019-10-15 01:28:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:37,915 INFO L93 Difference]: Finished difference Result 352 states and 494 transitions. [2019-10-15 01:28:37,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:37,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-15 01:28:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:37,924 INFO L225 Difference]: With dead ends: 352 [2019-10-15 01:28:37,925 INFO L226 Difference]: Without dead ends: 200 [2019-10-15 01:28:37,927 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-15 01:28:37,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-10-15 01:28:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 172. [2019-10-15 01:28:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-15 01:28:37,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 233 transitions. [2019-10-15 01:28:37,974 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 233 transitions. Word has length 92 [2019-10-15 01:28:37,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:37,975 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 233 transitions. [2019-10-15 01:28:37,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:37,975 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 233 transitions. [2019-10-15 01:28:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:28:37,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:37,980 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] [2019-10-15 01:28:37,980 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:37,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:37,981 INFO L82 PathProgramCache]: Analyzing trace with hash 394004280, now seen corresponding path program 1 times [2019-10-15 01:28:37,981 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:37,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038104298] [2019-10-15 01:28:37,983 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:37,983 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:37,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:38,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:38,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038104298] [2019-10-15 01:28:38,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:38,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:38,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146527167] [2019-10-15 01:28:38,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:38,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:38,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:38,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:38,125 INFO L87 Difference]: Start difference. First operand 172 states and 233 transitions. Second operand 5 states. [2019-10-15 01:28:38,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:38,516 INFO L93 Difference]: Finished difference Result 369 states and 520 transitions. [2019-10-15 01:28:38,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:38,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-15 01:28:38,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:38,524 INFO L225 Difference]: With dead ends: 369 [2019-10-15 01:28:38,525 INFO L226 Difference]: Without dead ends: 217 [2019-10-15 01:28:38,525 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-15 01:28:38,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-15 01:28:38,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 172. [2019-10-15 01:28:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-15 01:28:38,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 232 transitions. [2019-10-15 01:28:38,557 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 232 transitions. Word has length 92 [2019-10-15 01:28:38,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:38,558 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 232 transitions. [2019-10-15 01:28:38,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:38,558 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 232 transitions. [2019-10-15 01:28:38,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:28:38,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:38,560 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] [2019-10-15 01:28:38,561 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:38,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:38,561 INFO L82 PathProgramCache]: Analyzing trace with hash -822149446, now seen corresponding path program 1 times [2019-10-15 01:28:38,561 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:38,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251703268] [2019-10-15 01:28:38,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:38,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:38,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:38,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:38,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251703268] [2019-10-15 01:28:38,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:38,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:38,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902048826] [2019-10-15 01:28:38,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:38,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:38,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:38,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:38,646 INFO L87 Difference]: Start difference. First operand 172 states and 232 transitions. Second operand 5 states. [2019-10-15 01:28:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:39,021 INFO L93 Difference]: Finished difference Result 363 states and 509 transitions. [2019-10-15 01:28:39,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:39,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-15 01:28:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:39,026 INFO L225 Difference]: With dead ends: 363 [2019-10-15 01:28:39,026 INFO L226 Difference]: Without dead ends: 211 [2019-10-15 01:28:39,027 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-15 01:28:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-15 01:28:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 172. [2019-10-15 01:28:39,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-15 01:28:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 231 transitions. [2019-10-15 01:28:39,046 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 231 transitions. Word has length 92 [2019-10-15 01:28:39,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:39,046 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 231 transitions. [2019-10-15 01:28:39,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:39,047 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 231 transitions. [2019-10-15 01:28:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:28:39,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:39,049 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] [2019-10-15 01:28:39,049 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:39,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:39,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1554116872, now seen corresponding path program 1 times [2019-10-15 01:28:39,050 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:39,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24306684] [2019-10-15 01:28:39,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:39,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:39,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:39,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24306684] [2019-10-15 01:28:39,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:39,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:39,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833829522] [2019-10-15 01:28:39,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:39,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:39,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:39,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:39,124 INFO L87 Difference]: Start difference. First operand 172 states and 231 transitions. Second operand 5 states. [2019-10-15 01:28:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:39,494 INFO L93 Difference]: Finished difference Result 365 states and 508 transitions. [2019-10-15 01:28:39,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:39,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-15 01:28:39,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:39,497 INFO L225 Difference]: With dead ends: 365 [2019-10-15 01:28:39,498 INFO L226 Difference]: Without dead ends: 213 [2019-10-15 01:28:39,499 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-15 01:28:39,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-15 01:28:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 172. [2019-10-15 01:28:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-15 01:28:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2019-10-15 01:28:39,517 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 92 [2019-10-15 01:28:39,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:39,517 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2019-10-15 01:28:39,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2019-10-15 01:28:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:28:39,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:39,519 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] [2019-10-15 01:28:39,519 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:39,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:39,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1054670586, now seen corresponding path program 1 times [2019-10-15 01:28:39,520 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:39,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538900492] [2019-10-15 01:28:39,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:39,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:39,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:39,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538900492] [2019-10-15 01:28:39,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:39,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:39,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056849986] [2019-10-15 01:28:39,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:39,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:39,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:39,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:39,572 INFO L87 Difference]: Start difference. First operand 172 states and 230 transitions. Second operand 4 states. [2019-10-15 01:28:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:39,759 INFO L93 Difference]: Finished difference Result 460 states and 640 transitions. [2019-10-15 01:28:39,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:39,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-15 01:28:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:39,762 INFO L225 Difference]: With dead ends: 460 [2019-10-15 01:28:39,763 INFO L226 Difference]: Without dead ends: 309 [2019-10-15 01:28:39,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-10-15 01:28:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2019-10-15 01:28:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-10-15 01:28:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 408 transitions. [2019-10-15 01:28:39,798 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 408 transitions. Word has length 92 [2019-10-15 01:28:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:39,798 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 408 transitions. [2019-10-15 01:28:39,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:39,798 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 408 transitions. [2019-10-15 01:28:39,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:28:39,801 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:39,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:39,802 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:39,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:39,802 INFO L82 PathProgramCache]: Analyzing trace with hash -922442114, now seen corresponding path program 1 times [2019-10-15 01:28:39,802 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:39,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122650034] [2019-10-15 01:28:39,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:39,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:39,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-15 01:28:39,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122650034] [2019-10-15 01:28:39,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53603099] [2019-10-15 01:28:39,892 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-15 01:28:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:40,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:40,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:28:40,122 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:28:40,269 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:40,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:28:40,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792096210] [2019-10-15 01:28:40,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:40,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:40,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:40,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:40,271 INFO L87 Difference]: Start difference. First operand 308 states and 408 transitions. Second operand 3 states. [2019-10-15 01:28:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:40,331 INFO L93 Difference]: Finished difference Result 868 states and 1193 transitions. [2019-10-15 01:28:40,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:40,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-15 01:28:40,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:40,342 INFO L225 Difference]: With dead ends: 868 [2019-10-15 01:28:40,342 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 01:28:40,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 01:28:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 572. [2019-10-15 01:28:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-10-15 01:28:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 787 transitions. [2019-10-15 01:28:40,419 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 787 transitions. Word has length 147 [2019-10-15 01:28:40,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:40,420 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 787 transitions. [2019-10-15 01:28:40,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:40,420 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 787 transitions. [2019-10-15 01:28:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-15 01:28:40,424 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:40,424 INFO L380 BasicCegarLoop]: trace histogram [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, 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] [2019-10-15 01:28:40,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:40,628 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:40,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:40,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2126273741, now seen corresponding path program 1 times [2019-10-15 01:28:40,630 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:40,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254879915] [2019-10-15 01:28:40,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-15 01:28:40,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254879915] [2019-10-15 01:28:40,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798712406] [2019-10-15 01:28:40,697 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-15 01:28:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:40,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:40,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:28:40,885 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-15 01:28:41,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:41,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 3] total 7 [2019-10-15 01:28:41,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268140420] [2019-10-15 01:28:41,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:41,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:41,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:41,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:41,035 INFO L87 Difference]: Start difference. First operand 572 states and 787 transitions. Second operand 3 states. [2019-10-15 01:28:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:41,138 INFO L93 Difference]: Finished difference Result 1615 states and 2336 transitions. [2019-10-15 01:28:41,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:41,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-15 01:28:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:41,151 INFO L225 Difference]: With dead ends: 1615 [2019-10-15 01:28:41,151 INFO L226 Difference]: Without dead ends: 1071 [2019-10-15 01:28:41,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2019-10-15 01:28:41,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1069. [2019-10-15 01:28:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-10-15 01:28:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1531 transitions. [2019-10-15 01:28:41,242 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1531 transitions. Word has length 166 [2019-10-15 01:28:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:41,243 INFO L462 AbstractCegarLoop]: Abstraction has 1069 states and 1531 transitions. [2019-10-15 01:28:41,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1531 transitions. [2019-10-15 01:28:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-15 01:28:41,248 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:41,248 INFO L380 BasicCegarLoop]: trace histogram [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, 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] [2019-10-15 01:28:41,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:41,453 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:41,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:41,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1486719875, now seen corresponding path program 1 times [2019-10-15 01:28:41,454 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:41,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639239076] [2019-10-15 01:28:41,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-15 01:28:41,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639239076] [2019-10-15 01:28:41,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:41,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:41,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128512254] [2019-10-15 01:28:41,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:41,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:41,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:41,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:41,504 INFO L87 Difference]: Start difference. First operand 1069 states and 1531 transitions. Second operand 4 states. [2019-10-15 01:28:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:41,661 INFO L93 Difference]: Finished difference Result 1925 states and 2719 transitions. [2019-10-15 01:28:41,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:41,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-10-15 01:28:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:41,669 INFO L225 Difference]: With dead ends: 1925 [2019-10-15 01:28:41,670 INFO L226 Difference]: Without dead ends: 882 [2019-10-15 01:28:41,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-10-15 01:28:41,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2019-10-15 01:28:41,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-10-15 01:28:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1223 transitions. [2019-10-15 01:28:41,756 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1223 transitions. Word has length 167 [2019-10-15 01:28:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:41,756 INFO L462 AbstractCegarLoop]: Abstraction has 882 states and 1223 transitions. [2019-10-15 01:28:41,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1223 transitions. [2019-10-15 01:28:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-15 01:28:41,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:41,762 INFO L380 BasicCegarLoop]: trace histogram [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, 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-15 01:28:41,762 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:41,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:41,763 INFO L82 PathProgramCache]: Analyzing trace with hash -964966267, now seen corresponding path program 1 times [2019-10-15 01:28:41,763 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:41,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512069851] [2019-10-15 01:28:41,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-15 01:28:41,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512069851] [2019-10-15 01:28:41,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708424141] [2019-10-15 01:28:41,884 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-15 01:28:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:42,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:42,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:42,060 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:42,060 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-15 01:28:42,220 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:42,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 8 [2019-10-15 01:28:42,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402059502] [2019-10-15 01:28:42,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:42,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:42,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:42,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:42,222 INFO L87 Difference]: Start difference. First operand 882 states and 1223 transitions. Second operand 4 states. [2019-10-15 01:28:42,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:42,635 INFO L93 Difference]: Finished difference Result 2569 states and 3838 transitions. [2019-10-15 01:28:42,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:42,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-10-15 01:28:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:42,654 INFO L225 Difference]: With dead ends: 2569 [2019-10-15 01:28:42,655 INFO L226 Difference]: Without dead ends: 1713 [2019-10-15 01:28:42,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2019-10-15 01:28:42,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1703. [2019-10-15 01:28:42,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-10-15 01:28:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2357 transitions. [2019-10-15 01:28:42,892 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2357 transitions. Word has length 167 [2019-10-15 01:28:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:42,896 INFO L462 AbstractCegarLoop]: Abstraction has 1703 states and 2357 transitions. [2019-10-15 01:28:42,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2357 transitions. [2019-10-15 01:28:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:28:42,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:42,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:43,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:43,111 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:43,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:43,111 INFO L82 PathProgramCache]: Analyzing trace with hash 872540862, now seen corresponding path program 1 times [2019-10-15 01:28:43,111 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:43,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192313063] [2019-10-15 01:28:43,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-15 01:28:43,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192313063] [2019-10-15 01:28:43,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:43,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:43,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512463885] [2019-10-15 01:28:43,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:43,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:43,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:43,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:43,172 INFO L87 Difference]: Start difference. First operand 1703 states and 2357 transitions. Second operand 4 states. [2019-10-15 01:28:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:43,358 INFO L93 Difference]: Finished difference Result 2974 states and 4091 transitions. [2019-10-15 01:28:43,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:43,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-15 01:28:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:43,369 INFO L225 Difference]: With dead ends: 2974 [2019-10-15 01:28:43,369 INFO L226 Difference]: Without dead ends: 1292 [2019-10-15 01:28:43,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:43,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-10-15 01:28:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2019-10-15 01:28:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2019-10-15 01:28:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1759 transitions. [2019-10-15 01:28:43,503 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1759 transitions. Word has length 147 [2019-10-15 01:28:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:43,504 INFO L462 AbstractCegarLoop]: Abstraction has 1292 states and 1759 transitions. [2019-10-15 01:28:43,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1759 transitions. [2019-10-15 01:28:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:28:43,508 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:43,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:43,508 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:43,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:43,509 INFO L82 PathProgramCache]: Analyzing trace with hash 627343757, now seen corresponding path program 1 times [2019-10-15 01:28:43,509 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:43,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156105218] [2019-10-15 01:28:43,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-15 01:28:43,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156105218] [2019-10-15 01:28:43,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299333765] [2019-10-15 01:28:43,569 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-15 01:28:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:43,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:43,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:28:43,775 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-15 01:28:43,949 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:43,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 9 [2019-10-15 01:28:43,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007122132] [2019-10-15 01:28:43,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:43,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:43,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:43,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:43,955 INFO L87 Difference]: Start difference. First operand 1292 states and 1759 transitions. Second operand 5 states. [2019-10-15 01:28:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:44,359 INFO L93 Difference]: Finished difference Result 2185 states and 3022 transitions. [2019-10-15 01:28:44,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:44,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-15 01:28:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:44,369 INFO L225 Difference]: With dead ends: 2185 [2019-10-15 01:28:44,369 INFO L226 Difference]: Without dead ends: 1402 [2019-10-15 01:28:44,374 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-10-15 01:28:44,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1399. [2019-10-15 01:28:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1399 states. [2019-10-15 01:28:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1870 transitions. [2019-10-15 01:28:44,640 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1870 transitions. Word has length 148 [2019-10-15 01:28:44,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:44,641 INFO L462 AbstractCegarLoop]: Abstraction has 1399 states and 1870 transitions. [2019-10-15 01:28:44,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1870 transitions. [2019-10-15 01:28:44,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-15 01:28:44,647 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:44,647 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, 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] [2019-10-15 01:28:44,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:44,857 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:44,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:44,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2107263254, now seen corresponding path program 1 times [2019-10-15 01:28:44,858 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:44,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159498923] [2019-10-15 01:28:44,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:44,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:44,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-15 01:28:44,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159498923] [2019-10-15 01:28:44,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395318162] [2019-10-15 01:28:44,990 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-15 01:28:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:45,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 01:28:45,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-15 01:28:45,243 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-15 01:28:45,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:45,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 8 [2019-10-15 01:28:45,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190966218] [2019-10-15 01:28:45,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:45,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:45,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:45,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:45,424 INFO L87 Difference]: Start difference. First operand 1399 states and 1870 transitions. Second operand 3 states. [2019-10-15 01:28:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:45,661 INFO L93 Difference]: Finished difference Result 4086 states and 5674 transitions. [2019-10-15 01:28:45,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:45,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-15 01:28:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:45,679 INFO L225 Difference]: With dead ends: 4086 [2019-10-15 01:28:45,680 INFO L226 Difference]: Without dead ends: 2708 [2019-10-15 01:28:45,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 377 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:45,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2019-10-15 01:28:45,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2680. [2019-10-15 01:28:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2680 states. [2019-10-15 01:28:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3605 transitions. [2019-10-15 01:28:45,959 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 3605 transitions. Word has length 192 [2019-10-15 01:28:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:45,960 INFO L462 AbstractCegarLoop]: Abstraction has 2680 states and 3605 transitions. [2019-10-15 01:28:45,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3605 transitions. [2019-10-15 01:28:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-15 01:28:45,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:45,973 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, 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] [2019-10-15 01:28:46,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:46,180 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:46,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash 723058041, now seen corresponding path program 1 times [2019-10-15 01:28:46,181 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:46,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241644471] [2019-10-15 01:28:46,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-15 01:28:46,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241644471] [2019-10-15 01:28:46,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424848140] [2019-10-15 01:28:46,307 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-15 01:28:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:46,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-15 01:28:46,562 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-15 01:28:46,788 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:46,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 8 [2019-10-15 01:28:46,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807197312] [2019-10-15 01:28:46,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:46,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:46,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:46,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:46,790 INFO L87 Difference]: Start difference. First operand 2680 states and 3605 transitions. Second operand 4 states. [2019-10-15 01:28:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:47,143 INFO L93 Difference]: Finished difference Result 5612 states and 7769 transitions. [2019-10-15 01:28:47,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:47,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-10-15 01:28:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:47,169 INFO L225 Difference]: With dead ends: 5612 [2019-10-15 01:28:47,169 INFO L226 Difference]: Without dead ends: 2954 [2019-10-15 01:28:47,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 415 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-10-15 01:28:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2676. [2019-10-15 01:28:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2019-10-15 01:28:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3522 transitions. [2019-10-15 01:28:47,440 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3522 transitions. Word has length 211 [2019-10-15 01:28:47,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:47,441 INFO L462 AbstractCegarLoop]: Abstraction has 2676 states and 3522 transitions. [2019-10-15 01:28:47,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3522 transitions. [2019-10-15 01:28:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-15 01:28:47,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:47,455 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:47,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:47,660 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:47,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:47,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1123816457, now seen corresponding path program 1 times [2019-10-15 01:28:47,661 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:47,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670350055] [2019-10-15 01:28:47,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-10-15 01:28:47,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670350055] [2019-10-15 01:28:47,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202682883] [2019-10-15 01:28:47,825 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-15 01:28:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:28:48,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-15 01:28:48,118 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-15 01:28:48,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:48,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-15 01:28:48,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977962189] [2019-10-15 01:28:48,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:48,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:48,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:48,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:28:48,447 INFO L87 Difference]: Start difference. First operand 2676 states and 3522 transitions. Second operand 5 states. [2019-10-15 01:28:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:49,191 INFO L93 Difference]: Finished difference Result 6129 states and 8647 transitions. [2019-10-15 01:28:49,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:49,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 305 [2019-10-15 01:28:49,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:49,216 INFO L225 Difference]: With dead ends: 6129 [2019-10-15 01:28:49,216 INFO L226 Difference]: Without dead ends: 3475 [2019-10-15 01:28:49,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 601 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:28:49,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3475 states. [2019-10-15 01:28:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3475 to 3025. [2019-10-15 01:28:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3025 states. [2019-10-15 01:28:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 3869 transitions. [2019-10-15 01:28:49,593 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 3869 transitions. Word has length 305 [2019-10-15 01:28:49,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:49,594 INFO L462 AbstractCegarLoop]: Abstraction has 3025 states and 3869 transitions. [2019-10-15 01:28:49,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 3869 transitions. [2019-10-15 01:28:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-15 01:28:49,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:49,614 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:49,828 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:49,828 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:49,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:49,829 INFO L82 PathProgramCache]: Analyzing trace with hash -121475737, now seen corresponding path program 1 times [2019-10-15 01:28:49,830 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:49,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564360550] [2019-10-15 01:28:49,830 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,830 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-10-15 01:28:50,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564360550] [2019-10-15 01:28:50,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405340494] [2019-10-15 01:28:50,025 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-15 01:28:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:50,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:28:50,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-10-15 01:28:50,382 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-15 01:28:50,670 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:50,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-15 01:28:50,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998187460] [2019-10-15 01:28:50,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:50,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:50,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:50,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:28:50,672 INFO L87 Difference]: Start difference. First operand 3025 states and 3869 transitions. Second operand 5 states. [2019-10-15 01:28:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:51,733 INFO L93 Difference]: Finished difference Result 9483 states and 12412 transitions. [2019-10-15 01:28:51,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:28:51,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 306 [2019-10-15 01:28:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:51,783 INFO L225 Difference]: With dead ends: 9483 [2019-10-15 01:28:51,784 INFO L226 Difference]: Without dead ends: 6478 [2019-10-15 01:28:51,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 603 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:28:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6478 states. [2019-10-15 01:28:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6478 to 6024. [2019-10-15 01:28:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6024 states. [2019-10-15 01:28:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6024 states to 6024 states and 7676 transitions. [2019-10-15 01:28:52,418 INFO L78 Accepts]: Start accepts. Automaton has 6024 states and 7676 transitions. Word has length 306 [2019-10-15 01:28:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:52,418 INFO L462 AbstractCegarLoop]: Abstraction has 6024 states and 7676 transitions. [2019-10-15 01:28:52,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 6024 states and 7676 transitions. [2019-10-15 01:28:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-15 01:28:52,431 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:52,431 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:52,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:52,638 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:52,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:52,639 INFO L82 PathProgramCache]: Analyzing trace with hash 250432485, now seen corresponding path program 1 times [2019-10-15 01:28:52,639 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:52,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795423385] [2019-10-15 01:28:52,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-10-15 01:28:52,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795423385] [2019-10-15 01:28:52,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249544189] [2019-10-15 01:28:52,739 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-15 01:28:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:53,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:28:53,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-10-15 01:28:53,178 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-15 01:28:53,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:53,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-15 01:28:53,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684089802] [2019-10-15 01:28:53,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:53,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:53,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:53,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:28:53,598 INFO L87 Difference]: Start difference. First operand 6024 states and 7676 transitions. Second operand 5 states. [2019-10-15 01:28:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:54,659 INFO L93 Difference]: Finished difference Result 12026 states and 15416 transitions. [2019-10-15 01:28:54,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:54,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 306 [2019-10-15 01:28:54,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:54,731 INFO L225 Difference]: With dead ends: 12026 [2019-10-15 01:28:54,731 INFO L226 Difference]: Without dead ends: 6024 [2019-10-15 01:28:54,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 603 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:28:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2019-10-15 01:28:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 6024. [2019-10-15 01:28:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6024 states. [2019-10-15 01:28:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6024 states to 6024 states and 7586 transitions. [2019-10-15 01:28:55,454 INFO L78 Accepts]: Start accepts. Automaton has 6024 states and 7586 transitions. Word has length 306 [2019-10-15 01:28:55,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:55,455 INFO L462 AbstractCegarLoop]: Abstraction has 6024 states and 7586 transitions. [2019-10-15 01:28:55,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:55,455 INFO L276 IsEmpty]: Start isEmpty. Operand 6024 states and 7586 transitions. [2019-10-15 01:28:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-15 01:28:55,468 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:55,469 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, 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] [2019-10-15 01:28:55,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:55,675 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:55,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:55,676 INFO L82 PathProgramCache]: Analyzing trace with hash 94328995, now seen corresponding path program 1 times [2019-10-15 01:28:55,676 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:55,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729201728] [2019-10-15 01:28:55,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-15 01:28:55,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729201728] [2019-10-15 01:28:55,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697330586] [2019-10-15 01:28:55,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:56,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:56,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:28:56,132 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-15 01:28:56,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:56,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2019-10-15 01:28:56,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739088884] [2019-10-15 01:28:56,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:56,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:56,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:56,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:56,268 INFO L87 Difference]: Start difference. First operand 6024 states and 7586 transitions. Second operand 3 states. [2019-10-15 01:28:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:56,629 INFO L93 Difference]: Finished difference Result 10442 states and 13298 transitions. [2019-10-15 01:28:56,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:56,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-10-15 01:28:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:56,672 INFO L225 Difference]: With dead ends: 10442 [2019-10-15 01:28:56,672 INFO L226 Difference]: Without dead ends: 6414 [2019-10-15 01:28:56,692 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6414 states. [2019-10-15 01:28:57,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6414 to 6410. [2019-10-15 01:28:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6410 states. [2019-10-15 01:28:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6410 states to 6410 states and 7948 transitions. [2019-10-15 01:28:57,233 INFO L78 Accepts]: Start accepts. Automaton has 6410 states and 7948 transitions. Word has length 213 [2019-10-15 01:28:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:57,234 INFO L462 AbstractCegarLoop]: Abstraction has 6410 states and 7948 transitions. [2019-10-15 01:28:57,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 6410 states and 7948 transitions. [2019-10-15 01:28:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-15 01:28:57,246 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:57,246 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, 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] [2019-10-15 01:28:57,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:57,452 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:57,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:57,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1546223984, now seen corresponding path program 1 times [2019-10-15 01:28:57,453 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:57,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693872411] [2019-10-15 01:28:57,453 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,454 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-15 01:28:57,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693872411] [2019-10-15 01:28:57,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118621624] [2019-10-15 01:28:57,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:57,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:57,777 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:28:57,777 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-15 01:28:57,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:57,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 3] total 8 [2019-10-15 01:28:57,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977069546] [2019-10-15 01:28:57,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:57,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:57,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:57,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:57,899 INFO L87 Difference]: Start difference. First operand 6410 states and 7948 transitions. Second operand 3 states. [2019-10-15 01:28:58,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:58,401 INFO L93 Difference]: Finished difference Result 18183 states and 23443 transitions. [2019-10-15 01:28:58,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:58,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-10-15 01:28:58,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:58,450 INFO L225 Difference]: With dead ends: 18183 [2019-10-15 01:28:58,451 INFO L226 Difference]: Without dead ends: 11795 [2019-10-15 01:28:58,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11795 states. [2019-10-15 01:28:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11795 to 11791. [2019-10-15 01:28:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11791 states. [2019-10-15 01:28:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11791 states to 11791 states and 14995 transitions. [2019-10-15 01:28:59,164 INFO L78 Accepts]: Start accepts. Automaton has 11791 states and 14995 transitions. Word has length 213 [2019-10-15 01:28:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:59,164 INFO L462 AbstractCegarLoop]: Abstraction has 11791 states and 14995 transitions. [2019-10-15 01:28:59,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 11791 states and 14995 transitions. [2019-10-15 01:28:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-15 01:28:59,182 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:59,182 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:59,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:59,388 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:59,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1320112735, now seen corresponding path program 1 times [2019-10-15 01:28:59,389 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:59,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779666030] [2019-10-15 01:28:59,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-10-15 01:28:59,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779666030] [2019-10-15 01:28:59,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746994354] [2019-10-15 01:28:59,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:28:59,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-10-15 01:28:59,958 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-15 01:29:00,228 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:00,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-15 01:29:00,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857999115] [2019-10-15 01:29:00,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:00,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:00,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:00,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:29:00,229 INFO L87 Difference]: Start difference. First operand 11791 states and 14995 transitions. Second operand 5 states. [2019-10-15 01:29:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:01,827 INFO L93 Difference]: Finished difference Result 25331 states and 35322 transitions. [2019-10-15 01:29:01,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:01,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 306 [2019-10-15 01:29:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:01,879 INFO L225 Difference]: With dead ends: 25331 [2019-10-15 01:29:01,880 INFO L226 Difference]: Without dead ends: 13567 [2019-10-15 01:29:01,905 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 603 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:29:01,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13567 states. [2019-10-15 01:29:02,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13567 to 12271. [2019-10-15 01:29:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12271 states. [2019-10-15 01:29:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12271 states to 12271 states and 15639 transitions. [2019-10-15 01:29:02,556 INFO L78 Accepts]: Start accepts. Automaton has 12271 states and 15639 transitions. Word has length 306 [2019-10-15 01:29:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:02,557 INFO L462 AbstractCegarLoop]: Abstraction has 12271 states and 15639 transitions. [2019-10-15 01:29:02,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 12271 states and 15639 transitions. [2019-10-15 01:29:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-15 01:29:02,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:02,571 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:02,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:02,776 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2058631651, now seen corresponding path program 1 times [2019-10-15 01:29:02,776 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:02,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928586249] [2019-10-15 01:29:02,777 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,777 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-10-15 01:29:02,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928586249] [2019-10-15 01:29:02,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249478808] [2019-10-15 01:29:02,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:03,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 01:29:03,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-15 01:29:03,489 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 35 proven. 12 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-10-15 01:29:03,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:03,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 10 [2019-10-15 01:29:03,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538599212] [2019-10-15 01:29:03,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:29:03,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:03,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:29:03,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:29:03,706 INFO L87 Difference]: Start difference. First operand 12271 states and 15639 transitions. Second operand 6 states. [2019-10-15 01:29:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:04,047 INFO L93 Difference]: Finished difference Result 18191 states and 23345 transitions. [2019-10-15 01:29:04,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:29:04,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 306 [2019-10-15 01:29:04,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:04,071 INFO L225 Difference]: With dead ends: 18191 [2019-10-15 01:29:04,071 INFO L226 Difference]: Without dead ends: 5947 [2019-10-15 01:29:04,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 605 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:29:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2019-10-15 01:29:04,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 5663. [2019-10-15 01:29:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5663 states. [2019-10-15 01:29:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5663 states to 5663 states and 6918 transitions. [2019-10-15 01:29:04,447 INFO L78 Accepts]: Start accepts. Automaton has 5663 states and 6918 transitions. Word has length 306 [2019-10-15 01:29:04,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:04,447 INFO L462 AbstractCegarLoop]: Abstraction has 5663 states and 6918 transitions. [2019-10-15 01:29:04,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:29:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 5663 states and 6918 transitions. [2019-10-15 01:29:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-15 01:29:04,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:04,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:04,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:04,660 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:04,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:04,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1188415299, now seen corresponding path program 1 times [2019-10-15 01:29:04,661 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:04,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675695827] [2019-10-15 01:29:04,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:04,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:04,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-15 01:29:04,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675695827] [2019-10-15 01:29:04,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867944832] [2019-10-15 01:29:04,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:04,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 926 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-15 01:29:04,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-15 01:29:04,995 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:05,251 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-10-15 01:29:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-15 01:29:05,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:05,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2019-10-15 01:29:05,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541131213] [2019-10-15 01:29:05,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:29:05,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:05,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:29:05,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:05,309 INFO L87 Difference]: Start difference. First operand 5663 states and 6918 transitions. Second operand 6 states. [2019-10-15 01:29:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:05,740 INFO L93 Difference]: Finished difference Result 9884 states and 12291 transitions. [2019-10-15 01:29:05,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:05,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2019-10-15 01:29:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:05,755 INFO L225 Difference]: With dead ends: 9884 [2019-10-15 01:29:05,756 INFO L226 Difference]: Without dead ends: 4302 [2019-10-15 01:29:05,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 427 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-15 01:29:05,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4302 states. [2019-10-15 01:29:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4302 to 4302. [2019-10-15 01:29:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4302 states. [2019-10-15 01:29:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 5095 transitions. [2019-10-15 01:29:06,038 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 5095 transitions. Word has length 213 [2019-10-15 01:29:06,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:06,039 INFO L462 AbstractCegarLoop]: Abstraction has 4302 states and 5095 transitions. [2019-10-15 01:29:06,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:29:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 5095 transitions. [2019-10-15 01:29:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-15 01:29:06,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:06,044 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, 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] [2019-10-15 01:29:06,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:06,252 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:06,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:06,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1479206909, now seen corresponding path program 1 times [2019-10-15 01:29:06,252 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:06,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000789803] [2019-10-15 01:29:06,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-15 01:29:06,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000789803] [2019-10-15 01:29:06,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:06,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:06,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499697095] [2019-10-15 01:29:06,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:06,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:06,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:06,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:06,309 INFO L87 Difference]: Start difference. First operand 4302 states and 5095 transitions. Second operand 4 states. [2019-10-15 01:29:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:06,540 INFO L93 Difference]: Finished difference Result 7614 states and 9025 transitions. [2019-10-15 01:29:06,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:06,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-10-15 01:29:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:06,552 INFO L225 Difference]: With dead ends: 7614 [2019-10-15 01:29:06,553 INFO L226 Difference]: Without dead ends: 3371 [2019-10-15 01:29:06,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:06,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states.