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 -i ../../../trunk/examples/svcomp/systemc/token_ring.14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:51:01,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:51:01,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:51:01,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:51:01,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:51:01,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:51:01,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:51:01,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:51:01,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:51:01,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:51:01,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:51:01,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:51:01,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:51:01,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:51:01,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:51:01,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:51:01,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:51:01,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:51:01,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:51:01,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:51:01,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:51:01,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:51:01,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:51:01,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:51:01,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:51:01,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:51:01,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:51:01,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:51:01,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:51:01,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:51:01,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:51:01,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:51:01,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:51:01,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:51:01,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:51:01,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:51:01,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:51:01,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:51:01,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:51:01,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:51:01,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:51:01,604 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-09-08 06:51:01,619 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:51:01,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:51:01,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:51:01,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:51:01,621 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:51:01,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:51:01,621 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:51:01,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:51:01,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:51:01,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:51:01,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:51:01,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:51:01,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:51:01,622 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:51:01,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:51:01,623 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:51:01,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:51:01,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:51:01,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:51:01,623 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:51:01,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:51:01,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:51:01,624 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:51:01,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:51:01,624 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:51:01,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:51:01,625 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:51:01,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:51:01,625 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:51:01,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:51:01,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:51:01,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:51:01,671 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:51:01,671 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:51:01,672 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.14.cil.c [2019-09-08 06:51:01,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe746875/efe613c7562042538b70dd16464a1abf/FLAGfc77e629c [2019-09-08 06:51:02,264 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:51:02,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.14.cil.c [2019-09-08 06:51:02,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe746875/efe613c7562042538b70dd16464a1abf/FLAGfc77e629c [2019-09-08 06:51:02,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe746875/efe613c7562042538b70dd16464a1abf [2019-09-08 06:51:02,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:51:02,583 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:51:02,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:51:02,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:51:02,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:51:02,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:51:02" (1/1) ... [2019-09-08 06:51:02,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3f43c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:02, skipping insertion in model container [2019-09-08 06:51:02,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:51:02" (1/1) ... [2019-09-08 06:51:02,603 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:51:02,671 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:51:03,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:51:03,150 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:51:03,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:51:03,272 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:51:03,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:03 WrapperNode [2019-09-08 06:51:03,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:51:03,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:51:03,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:51:03,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:51:03,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:03" (1/1) ... [2019-09-08 06:51:03,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:03" (1/1) ... [2019-09-08 06:51:03,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:03" (1/1) ... [2019-09-08 06:51:03,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:03" (1/1) ... [2019-09-08 06:51:03,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:03" (1/1) ... [2019-09-08 06:51:03,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:03" (1/1) ... [2019-09-08 06:51:03,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:03" (1/1) ... [2019-09-08 06:51:03,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:51:03,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:51:03,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:51:03,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:51:03,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:03" (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-09-08 06:51:03,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:51:03,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:51:03,438 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:51:03,438 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:51:03,439 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:51:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:51:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:51:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:51:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:51:03,441 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:51:03,441 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:51:03,441 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-08 06:51:03,442 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-08 06:51:03,442 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-08 06:51:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-08 06:51:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit12 [2019-09-08 06:51:03,445 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:51:03,445 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:51:03,445 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:51:03,446 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:51:03,446 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:51:03,446 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:51:03,447 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:51:03,447 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:51:03,447 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-08 06:51:03,447 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-08 06:51:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-08 06:51:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-08 06:51:03,450 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit12_triggered [2019-09-08 06:51:03,450 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:51:03,450 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:51:03,450 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:51:03,450 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:51:03,450 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:51:03,451 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:51:03,451 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:51:03,451 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:51:03,451 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:51:03,451 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:51:03,452 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:51:03,452 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:51:03,452 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:51:03,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:51:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:51:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:51:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:51:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:51:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:51:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:51:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:51:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:51:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:51:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:51:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-08 06:51:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-08 06:51:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-08 06:51:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-08 06:51:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit12_triggered [2019-09-08 06:51:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:51:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:51:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:51:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:51:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:51:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:51:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:51:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:51:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:51:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:51:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-08 06:51:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-08 06:51:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-08 06:51:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-08 06:51:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure transmit12 [2019-09-08 06:51:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:51:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:51:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:51:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:51:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:51:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:51:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:51:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:51:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:51:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:51:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:51:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:51:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:51:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:51:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:51:04,837 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:51:04,837 INFO L283 CfgBuilder]: Removed 15 assume(true) statements. [2019-09-08 06:51:04,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:51:04 BoogieIcfgContainer [2019-09-08 06:51:04,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:51:04,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:51:04,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:51:04,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:51:04,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:51:02" (1/3) ... [2019-09-08 06:51:04,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b51c264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:51:04, skipping insertion in model container [2019-09-08 06:51:04,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:03" (2/3) ... [2019-09-08 06:51:04,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b51c264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:51:04, skipping insertion in model container [2019-09-08 06:51:04,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:51:04" (3/3) ... [2019-09-08 06:51:04,853 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.14.cil.c [2019-09-08 06:51:04,863 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:51:04,886 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:51:04,905 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:51:04,951 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:51:04,952 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:51:04,953 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:51:04,953 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:51:04,954 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:51:04,954 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:51:04,954 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:51:04,954 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:51:04,954 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:51:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states. [2019-09-08 06:51:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:05,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:05,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:05,014 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:05,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:05,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1216430982, now seen corresponding path program 1 times [2019-09-08 06:51:05,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:05,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:05,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:05,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:05,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:05,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:05,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:05,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:05,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:05,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:05,661 INFO L87 Difference]: Start difference. First operand 479 states. Second operand 4 states. [2019-09-08 06:51:06,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:06,178 INFO L93 Difference]: Finished difference Result 941 states and 1460 transitions. [2019-09-08 06:51:06,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:06,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-08 06:51:06,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:06,199 INFO L225 Difference]: With dead ends: 941 [2019-09-08 06:51:06,200 INFO L226 Difference]: Without dead ends: 470 [2019-09-08 06:51:06,210 INFO L628 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-09-08 06:51:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-08 06:51:06,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2019-09-08 06:51:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 690 transitions. [2019-09-08 06:51:06,334 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 690 transitions. Word has length 232 [2019-09-08 06:51:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:06,336 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 690 transitions. [2019-09-08 06:51:06,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 690 transitions. [2019-09-08 06:51:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:06,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:06,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:06,343 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:06,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1273296328, now seen corresponding path program 1 times [2019-09-08 06:51:06,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:06,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:06,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:06,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:06,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:06,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:06,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:06,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:06,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:06,553 INFO L87 Difference]: Start difference. First operand 470 states and 690 transitions. Second operand 4 states. [2019-09-08 06:51:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:06,890 INFO L93 Difference]: Finished difference Result 917 states and 1348 transitions. [2019-09-08 06:51:06,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:06,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-08 06:51:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:06,895 INFO L225 Difference]: With dead ends: 917 [2019-09-08 06:51:06,895 INFO L226 Difference]: Without dead ends: 470 [2019-09-08 06:51:06,898 INFO L628 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-09-08 06:51:06,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-08 06:51:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2019-09-08 06:51:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 689 transitions. [2019-09-08 06:51:06,929 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 689 transitions. Word has length 232 [2019-09-08 06:51:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:06,929 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 689 transitions. [2019-09-08 06:51:06,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 689 transitions. [2019-09-08 06:51:06,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:06,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:06,934 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:06,935 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:06,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:06,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2146961930, now seen corresponding path program 1 times [2019-09-08 06:51:06,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:06,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:06,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:06,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:06,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:07,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:07,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:07,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:07,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:07,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:07,115 INFO L87 Difference]: Start difference. First operand 470 states and 689 transitions. Second operand 5 states. [2019-09-08 06:51:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:08,128 INFO L93 Difference]: Finished difference Result 980 states and 1469 transitions. [2019-09-08 06:51:08,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:08,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:08,135 INFO L225 Difference]: With dead ends: 980 [2019-09-08 06:51:08,135 INFO L226 Difference]: Without dead ends: 540 [2019-09-08 06:51:08,138 INFO L628 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-09-08 06:51:08,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-08 06:51:08,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 470. [2019-09-08 06:51:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 688 transitions. [2019-09-08 06:51:08,168 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 688 transitions. Word has length 232 [2019-09-08 06:51:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:08,169 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 688 transitions. [2019-09-08 06:51:08,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 688 transitions. [2019-09-08 06:51:08,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:08,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:08,173 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:08,173 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:08,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:08,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1934388280, now seen corresponding path program 1 times [2019-09-08 06:51:08,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:08,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:08,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:08,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:08,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:08,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:08,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:08,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:08,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:08,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:08,373 INFO L87 Difference]: Start difference. First operand 470 states and 688 transitions. Second operand 5 states. [2019-09-08 06:51:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:09,472 INFO L93 Difference]: Finished difference Result 980 states and 1468 transitions. [2019-09-08 06:51:09,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:09,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:09,478 INFO L225 Difference]: With dead ends: 980 [2019-09-08 06:51:09,478 INFO L226 Difference]: Without dead ends: 540 [2019-09-08 06:51:09,481 INFO L628 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-09-08 06:51:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-08 06:51:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 470. [2019-09-08 06:51:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:09,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 687 transitions. [2019-09-08 06:51:09,555 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 687 transitions. Word has length 232 [2019-09-08 06:51:09,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:09,555 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 687 transitions. [2019-09-08 06:51:09,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:09,556 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 687 transitions. [2019-09-08 06:51:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:09,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:09,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:09,560 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:09,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:09,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1650402742, now seen corresponding path program 1 times [2019-09-08 06:51:09,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:09,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:09,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:09,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:09,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:09,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:09,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:09,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:09,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:09,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:09,698 INFO L87 Difference]: Start difference. First operand 470 states and 687 transitions. Second operand 5 states. [2019-09-08 06:51:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:10,697 INFO L93 Difference]: Finished difference Result 978 states and 1462 transitions. [2019-09-08 06:51:10,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:10,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:10,702 INFO L225 Difference]: With dead ends: 978 [2019-09-08 06:51:10,702 INFO L226 Difference]: Without dead ends: 538 [2019-09-08 06:51:10,704 INFO L628 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-09-08 06:51:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-08 06:51:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 470. [2019-09-08 06:51:10,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 686 transitions. [2019-09-08 06:51:10,738 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 686 transitions. Word has length 232 [2019-09-08 06:51:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:10,739 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 686 transitions. [2019-09-08 06:51:10,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:10,739 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 686 transitions. [2019-09-08 06:51:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:10,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:10,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:10,743 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:10,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:10,744 INFO L82 PathProgramCache]: Analyzing trace with hash 714062728, now seen corresponding path program 1 times [2019-09-08 06:51:10,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:10,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:10,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:10,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:10,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:10,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:10,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:10,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:10,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:10,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:10,898 INFO L87 Difference]: Start difference. First operand 470 states and 686 transitions. Second operand 5 states. [2019-09-08 06:51:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:11,847 INFO L93 Difference]: Finished difference Result 976 states and 1456 transitions. [2019-09-08 06:51:11,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:11,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:11,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:11,853 INFO L225 Difference]: With dead ends: 976 [2019-09-08 06:51:11,854 INFO L226 Difference]: Without dead ends: 536 [2019-09-08 06:51:11,856 INFO L628 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-09-08 06:51:11,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-08 06:51:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 470. [2019-09-08 06:51:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 685 transitions. [2019-09-08 06:51:11,897 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 685 transitions. Word has length 232 [2019-09-08 06:51:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:11,899 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 685 transitions. [2019-09-08 06:51:11,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 685 transitions. [2019-09-08 06:51:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:11,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:11,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:11,904 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:11,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:11,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1010779510, now seen corresponding path program 1 times [2019-09-08 06:51:11,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:11,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:11,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:11,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:11,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:12,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-09-08 06:51:12,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:12,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:12,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:12,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:12,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:12,124 INFO L87 Difference]: Start difference. First operand 470 states and 685 transitions. Second operand 5 states. [2019-09-08 06:51:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:12,925 INFO L93 Difference]: Finished difference Result 974 states and 1450 transitions. [2019-09-08 06:51:12,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:12,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:12,929 INFO L225 Difference]: With dead ends: 974 [2019-09-08 06:51:12,929 INFO L226 Difference]: Without dead ends: 534 [2019-09-08 06:51:12,931 INFO L628 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-09-08 06:51:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-08 06:51:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 470. [2019-09-08 06:51:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 684 transitions. [2019-09-08 06:51:12,963 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 684 transitions. Word has length 232 [2019-09-08 06:51:12,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:12,963 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 684 transitions. [2019-09-08 06:51:12,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 684 transitions. [2019-09-08 06:51:12,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:12,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:12,966 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:12,967 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:12,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:12,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1288885064, now seen corresponding path program 1 times [2019-09-08 06:51:12,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:12,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:12,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:12,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:12,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:13,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:13,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:13,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:13,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:13,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:13,142 INFO L87 Difference]: Start difference. First operand 470 states and 684 transitions. Second operand 5 states. [2019-09-08 06:51:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:14,148 INFO L93 Difference]: Finished difference Result 972 states and 1444 transitions. [2019-09-08 06:51:14,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:14,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:14,153 INFO L225 Difference]: With dead ends: 972 [2019-09-08 06:51:14,153 INFO L226 Difference]: Without dead ends: 532 [2019-09-08 06:51:14,156 INFO L628 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-09-08 06:51:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-09-08 06:51:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 470. [2019-09-08 06:51:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 683 transitions. [2019-09-08 06:51:14,190 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 683 transitions. Word has length 232 [2019-09-08 06:51:14,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:14,191 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 683 transitions. [2019-09-08 06:51:14,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 683 transitions. [2019-09-08 06:51:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:14,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:14,196 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:14,196 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash -992236854, now seen corresponding path program 1 times [2019-09-08 06:51:14,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:14,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:14,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:14,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:14,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:14,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:14,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:14,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:14,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:14,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:14,322 INFO L87 Difference]: Start difference. First operand 470 states and 683 transitions. Second operand 5 states. [2019-09-08 06:51:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:15,274 INFO L93 Difference]: Finished difference Result 968 states and 1434 transitions. [2019-09-08 06:51:15,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:15,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:15,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:15,280 INFO L225 Difference]: With dead ends: 968 [2019-09-08 06:51:15,281 INFO L226 Difference]: Without dead ends: 528 [2019-09-08 06:51:15,283 INFO L628 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-09-08 06:51:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-08 06:51:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 470. [2019-09-08 06:51:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 682 transitions. [2019-09-08 06:51:15,322 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 682 transitions. Word has length 232 [2019-09-08 06:51:15,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:15,322 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 682 transitions. [2019-09-08 06:51:15,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 682 transitions. [2019-09-08 06:51:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:15,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:15,325 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:15,326 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:15,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:15,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1222146764, now seen corresponding path program 1 times [2019-09-08 06:51:15,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:15,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:15,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:15,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:15,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:15,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:15,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:15,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:15,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:15,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:15,475 INFO L87 Difference]: Start difference. First operand 470 states and 682 transitions. Second operand 5 states. [2019-09-08 06:51:16,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:16,378 INFO L93 Difference]: Finished difference Result 966 states and 1428 transitions. [2019-09-08 06:51:16,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:16,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:16,385 INFO L225 Difference]: With dead ends: 966 [2019-09-08 06:51:16,385 INFO L226 Difference]: Without dead ends: 526 [2019-09-08 06:51:16,389 INFO L628 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-09-08 06:51:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-09-08 06:51:16,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 470. [2019-09-08 06:51:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:16,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 681 transitions. [2019-09-08 06:51:16,447 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 681 transitions. Word has length 232 [2019-09-08 06:51:16,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:16,448 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 681 transitions. [2019-09-08 06:51:16,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 681 transitions. [2019-09-08 06:51:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:16,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:16,453 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:16,453 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:16,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:16,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1709220490, now seen corresponding path program 1 times [2019-09-08 06:51:16,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:16,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:16,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:16,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:16,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:16,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:16,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:16,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:16,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:16,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:16,681 INFO L87 Difference]: Start difference. First operand 470 states and 681 transitions. Second operand 5 states. [2019-09-08 06:51:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:17,645 INFO L93 Difference]: Finished difference Result 964 states and 1422 transitions. [2019-09-08 06:51:17,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:17,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:17,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:17,650 INFO L225 Difference]: With dead ends: 964 [2019-09-08 06:51:17,650 INFO L226 Difference]: Without dead ends: 524 [2019-09-08 06:51:17,652 INFO L628 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-09-08 06:51:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-09-08 06:51:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 470. [2019-09-08 06:51:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 680 transitions. [2019-09-08 06:51:17,689 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 680 transitions. Word has length 232 [2019-09-08 06:51:17,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:17,690 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 680 transitions. [2019-09-08 06:51:17,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 680 transitions. [2019-09-08 06:51:17,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:17,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:17,692 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:17,693 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:17,693 INFO L82 PathProgramCache]: Analyzing trace with hash -76182772, now seen corresponding path program 1 times [2019-09-08 06:51:17,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:17,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:17,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:17,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:17,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:17,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:17,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:17,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:17,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:17,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:17,836 INFO L87 Difference]: Start difference. First operand 470 states and 680 transitions. Second operand 5 states. [2019-09-08 06:51:18,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:18,859 INFO L93 Difference]: Finished difference Result 962 states and 1416 transitions. [2019-09-08 06:51:18,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:18,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:18,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:18,864 INFO L225 Difference]: With dead ends: 962 [2019-09-08 06:51:18,864 INFO L226 Difference]: Without dead ends: 522 [2019-09-08 06:51:18,866 INFO L628 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-09-08 06:51:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-08 06:51:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 470. [2019-09-08 06:51:18,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 679 transitions. [2019-09-08 06:51:18,922 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 679 transitions. Word has length 232 [2019-09-08 06:51:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:18,923 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 679 transitions. [2019-09-08 06:51:18,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 679 transitions. [2019-09-08 06:51:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:18,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:18,927 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:18,927 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:18,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:18,928 INFO L82 PathProgramCache]: Analyzing trace with hash -549418422, now seen corresponding path program 1 times [2019-09-08 06:51:18,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:18,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:18,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:18,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:18,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:19,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:19,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:19,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:19,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:19,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:19,059 INFO L87 Difference]: Start difference. First operand 470 states and 679 transitions. Second operand 5 states. [2019-09-08 06:51:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:20,004 INFO L93 Difference]: Finished difference Result 960 states and 1410 transitions. [2019-09-08 06:51:20,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:20,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:20,009 INFO L225 Difference]: With dead ends: 960 [2019-09-08 06:51:20,009 INFO L226 Difference]: Without dead ends: 520 [2019-09-08 06:51:20,011 INFO L628 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-09-08 06:51:20,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-08 06:51:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 470. [2019-09-08 06:51:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 678 transitions. [2019-09-08 06:51:20,072 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 678 transitions. Word has length 232 [2019-09-08 06:51:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:20,072 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 678 transitions. [2019-09-08 06:51:20,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 678 transitions. [2019-09-08 06:51:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:20,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:20,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:20,076 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:20,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash -426136756, now seen corresponding path program 1 times [2019-09-08 06:51:20,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:20,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:20,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:20,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:20,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:20,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:20,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:20,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:20,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:20,251 INFO L87 Difference]: Start difference. First operand 470 states and 678 transitions. Second operand 5 states. [2019-09-08 06:51:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:21,320 INFO L93 Difference]: Finished difference Result 958 states and 1404 transitions. [2019-09-08 06:51:21,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:21,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:21,324 INFO L225 Difference]: With dead ends: 958 [2019-09-08 06:51:21,324 INFO L226 Difference]: Without dead ends: 518 [2019-09-08 06:51:21,326 INFO L628 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-09-08 06:51:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-09-08 06:51:21,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 470. [2019-09-08 06:51:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 677 transitions. [2019-09-08 06:51:21,362 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 677 transitions. Word has length 232 [2019-09-08 06:51:21,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:21,362 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 677 transitions. [2019-09-08 06:51:21,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:21,363 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 677 transitions. [2019-09-08 06:51:21,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:21,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:21,364 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:21,365 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:21,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:21,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1794597386, now seen corresponding path program 1 times [2019-09-08 06:51:21,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:21,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:21,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:21,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:21,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:21,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:21,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:21,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:21,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:21,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:21,487 INFO L87 Difference]: Start difference. First operand 470 states and 677 transitions. Second operand 5 states. [2019-09-08 06:51:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:22,439 INFO L93 Difference]: Finished difference Result 1005 states and 1490 transitions. [2019-09-08 06:51:22,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:22,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:22,444 INFO L225 Difference]: With dead ends: 1005 [2019-09-08 06:51:22,444 INFO L226 Difference]: Without dead ends: 565 [2019-09-08 06:51:22,446 INFO L628 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-09-08 06:51:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-09-08 06:51:22,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 470. [2019-09-08 06:51:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 676 transitions. [2019-09-08 06:51:22,489 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 676 transitions. Word has length 232 [2019-09-08 06:51:22,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:22,489 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 676 transitions. [2019-09-08 06:51:22,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:22,489 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 676 transitions. [2019-09-08 06:51:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:22,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:22,491 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:22,492 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:22,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1597449332, now seen corresponding path program 1 times [2019-09-08 06:51:22,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:22,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:22,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:22,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:22,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:22,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:22,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:22,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:22,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:22,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:22,597 INFO L87 Difference]: Start difference. First operand 470 states and 676 transitions. Second operand 5 states. [2019-09-08 06:51:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:23,580 INFO L93 Difference]: Finished difference Result 1001 states and 1480 transitions. [2019-09-08 06:51:23,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:23,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:23,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:23,588 INFO L225 Difference]: With dead ends: 1001 [2019-09-08 06:51:23,588 INFO L226 Difference]: Without dead ends: 561 [2019-09-08 06:51:23,591 INFO L628 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-09-08 06:51:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-08 06:51:23,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 470. [2019-09-08 06:51:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 675 transitions. [2019-09-08 06:51:23,669 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 675 transitions. Word has length 232 [2019-09-08 06:51:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:23,669 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 675 transitions. [2019-09-08 06:51:23,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 675 transitions. [2019-09-08 06:51:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:23,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:23,673 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:23,673 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:23,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:23,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1605448306, now seen corresponding path program 1 times [2019-09-08 06:51:23,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:23,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:23,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:23,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:23,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:23,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:23,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:23,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:23,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:23,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:23,855 INFO L87 Difference]: Start difference. First operand 470 states and 675 transitions. Second operand 5 states. [2019-09-08 06:51:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:25,127 INFO L93 Difference]: Finished difference Result 999 states and 1474 transitions. [2019-09-08 06:51:25,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:25,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:25,134 INFO L225 Difference]: With dead ends: 999 [2019-09-08 06:51:25,135 INFO L226 Difference]: Without dead ends: 559 [2019-09-08 06:51:25,139 INFO L628 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-09-08 06:51:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-08 06:51:25,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 470. [2019-09-08 06:51:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 674 transitions. [2019-09-08 06:51:25,214 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 674 transitions. Word has length 232 [2019-09-08 06:51:25,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:25,215 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 674 transitions. [2019-09-08 06:51:25,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 674 transitions. [2019-09-08 06:51:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:25,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:25,218 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:25,219 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:25,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:25,220 INFO L82 PathProgramCache]: Analyzing trace with hash -81685684, now seen corresponding path program 1 times [2019-09-08 06:51:25,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:25,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:25,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:25,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:25,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:25,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:25,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:25,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:25,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:25,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:25,404 INFO L87 Difference]: Start difference. First operand 470 states and 674 transitions. Second operand 5 states. [2019-09-08 06:51:26,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:26,739 INFO L93 Difference]: Finished difference Result 997 states and 1468 transitions. [2019-09-08 06:51:26,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:26,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:26,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:26,744 INFO L225 Difference]: With dead ends: 997 [2019-09-08 06:51:26,745 INFO L226 Difference]: Without dead ends: 557 [2019-09-08 06:51:26,747 INFO L628 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-09-08 06:51:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-09-08 06:51:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 470. [2019-09-08 06:51:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 673 transitions. [2019-09-08 06:51:26,819 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 673 transitions. Word has length 232 [2019-09-08 06:51:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:26,819 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 673 transitions. [2019-09-08 06:51:26,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 673 transitions. [2019-09-08 06:51:26,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:26,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:26,823 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:26,823 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:26,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:26,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1075846606, now seen corresponding path program 1 times [2019-09-08 06:51:26,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:26,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:26,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:26,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:26,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:27,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:27,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:27,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:27,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:27,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:27,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:27,014 INFO L87 Difference]: Start difference. First operand 470 states and 673 transitions. Second operand 5 states. [2019-09-08 06:51:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:28,292 INFO L93 Difference]: Finished difference Result 995 states and 1462 transitions. [2019-09-08 06:51:28,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:28,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:28,300 INFO L225 Difference]: With dead ends: 995 [2019-09-08 06:51:28,300 INFO L226 Difference]: Without dead ends: 555 [2019-09-08 06:51:28,304 INFO L628 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-09-08 06:51:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-08 06:51:28,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 470. [2019-09-08 06:51:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 672 transitions. [2019-09-08 06:51:28,379 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 672 transitions. Word has length 232 [2019-09-08 06:51:28,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:28,379 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 672 transitions. [2019-09-08 06:51:28,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:28,380 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 672 transitions. [2019-09-08 06:51:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:28,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:28,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:28,383 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:28,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash -272286964, now seen corresponding path program 1 times [2019-09-08 06:51:28,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:28,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:28,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:28,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:28,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:28,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:28,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:28,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:28,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:28,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:28,537 INFO L87 Difference]: Start difference. First operand 470 states and 672 transitions. Second operand 5 states. [2019-09-08 06:51:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:29,500 INFO L93 Difference]: Finished difference Result 993 states and 1456 transitions. [2019-09-08 06:51:29,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:29,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:29,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:29,505 INFO L225 Difference]: With dead ends: 993 [2019-09-08 06:51:29,505 INFO L226 Difference]: Without dead ends: 553 [2019-09-08 06:51:29,507 INFO L628 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-09-08 06:51:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-09-08 06:51:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 470. [2019-09-08 06:51:29,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 671 transitions. [2019-09-08 06:51:29,554 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 671 transitions. Word has length 232 [2019-09-08 06:51:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:29,554 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 671 transitions. [2019-09-08 06:51:29,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 671 transitions. [2019-09-08 06:51:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:29,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:29,556 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:29,557 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:29,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:29,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1485340174, now seen corresponding path program 1 times [2019-09-08 06:51:29,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:29,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:29,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:29,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:29,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:29,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:29,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:29,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:29,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:29,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:29,678 INFO L87 Difference]: Start difference. First operand 470 states and 671 transitions. Second operand 5 states. [2019-09-08 06:51:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:30,688 INFO L93 Difference]: Finished difference Result 991 states and 1450 transitions. [2019-09-08 06:51:30,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:30,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:30,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:30,693 INFO L225 Difference]: With dead ends: 991 [2019-09-08 06:51:30,693 INFO L226 Difference]: Without dead ends: 551 [2019-09-08 06:51:30,694 INFO L628 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-09-08 06:51:30,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-08 06:51:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 470. [2019-09-08 06:51:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 670 transitions. [2019-09-08 06:51:30,744 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 670 transitions. Word has length 232 [2019-09-08 06:51:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:30,745 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 670 transitions. [2019-09-08 06:51:30,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 670 transitions. [2019-09-08 06:51:30,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:30,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:30,747 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:30,747 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:30,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:30,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1957679820, now seen corresponding path program 1 times [2019-09-08 06:51:30,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:30,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:30,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:30,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:30,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:30,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:30,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:30,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:30,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:30,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:30,859 INFO L87 Difference]: Start difference. First operand 470 states and 670 transitions. Second operand 5 states. [2019-09-08 06:51:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:31,895 INFO L93 Difference]: Finished difference Result 989 states and 1444 transitions. [2019-09-08 06:51:31,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:31,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:31,902 INFO L225 Difference]: With dead ends: 989 [2019-09-08 06:51:31,902 INFO L226 Difference]: Without dead ends: 549 [2019-09-08 06:51:31,904 INFO L628 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-09-08 06:51:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-09-08 06:51:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 470. [2019-09-08 06:51:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 669 transitions. [2019-09-08 06:51:31,987 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 669 transitions. Word has length 232 [2019-09-08 06:51:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:31,987 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 669 transitions. [2019-09-08 06:51:31,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 669 transitions. [2019-09-08 06:51:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:31,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:31,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:31,990 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:31,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:31,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1141632590, now seen corresponding path program 1 times [2019-09-08 06:51:31,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:31,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:31,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:31,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:31,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:32,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:32,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:32,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:32,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:32,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:32,094 INFO L87 Difference]: Start difference. First operand 470 states and 669 transitions. Second operand 5 states. [2019-09-08 06:51:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:33,017 INFO L93 Difference]: Finished difference Result 985 states and 1434 transitions. [2019-09-08 06:51:33,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:33,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:33,021 INFO L225 Difference]: With dead ends: 985 [2019-09-08 06:51:33,021 INFO L226 Difference]: Without dead ends: 545 [2019-09-08 06:51:33,023 INFO L628 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-09-08 06:51:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-09-08 06:51:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 470. [2019-09-08 06:51:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 668 transitions. [2019-09-08 06:51:33,075 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 668 transitions. Word has length 232 [2019-09-08 06:51:33,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:33,075 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 668 transitions. [2019-09-08 06:51:33,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 668 transitions. [2019-09-08 06:51:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:33,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:33,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:33,077 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:33,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1554185648, now seen corresponding path program 1 times [2019-09-08 06:51:33,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:33,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:33,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:33,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:33,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:33,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:33,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:33,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:33,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:33,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:33,181 INFO L87 Difference]: Start difference. First operand 470 states and 668 transitions. Second operand 5 states. [2019-09-08 06:51:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:34,191 INFO L93 Difference]: Finished difference Result 983 states and 1428 transitions. [2019-09-08 06:51:34,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:34,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:34,196 INFO L225 Difference]: With dead ends: 983 [2019-09-08 06:51:34,196 INFO L226 Difference]: Without dead ends: 543 [2019-09-08 06:51:34,197 INFO L628 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-09-08 06:51:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-08 06:51:34,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 470. [2019-09-08 06:51:34,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 667 transitions. [2019-09-08 06:51:34,251 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 667 transitions. Word has length 232 [2019-09-08 06:51:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:34,251 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 667 transitions. [2019-09-08 06:51:34,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:34,251 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 667 transitions. [2019-09-08 06:51:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:34,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:34,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:34,253 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:34,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:34,254 INFO L82 PathProgramCache]: Analyzing trace with hash -948410866, now seen corresponding path program 1 times [2019-09-08 06:51:34,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:34,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:34,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:34,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:34,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:34,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:34,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:34,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:34,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:34,403 INFO L87 Difference]: Start difference. First operand 470 states and 667 transitions. Second operand 5 states. [2019-09-08 06:51:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:35,347 INFO L93 Difference]: Finished difference Result 981 states and 1422 transitions. [2019-09-08 06:51:35,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:35,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:51:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:35,351 INFO L225 Difference]: With dead ends: 981 [2019-09-08 06:51:35,351 INFO L226 Difference]: Without dead ends: 541 [2019-09-08 06:51:35,353 INFO L628 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-09-08 06:51:35,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-08 06:51:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 470. [2019-09-08 06:51:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 06:51:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 666 transitions. [2019-09-08 06:51:35,409 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 666 transitions. Word has length 232 [2019-09-08 06:51:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:35,409 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 666 transitions. [2019-09-08 06:51:35,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 666 transitions. [2019-09-08 06:51:35,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:51:35,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:35,411 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:35,411 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:35,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:35,412 INFO L82 PathProgramCache]: Analyzing trace with hash -928869744, now seen corresponding path program 1 times [2019-09-08 06:51:35,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:35,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:35,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:35,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:35,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:35,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:35,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:35,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:35,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:35,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:35,511 INFO L87 Difference]: Start difference. First operand 470 states and 666 transitions. Second operand 4 states. [2019-09-08 06:51:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:36,010 INFO L93 Difference]: Finished difference Result 1336 states and 1956 transitions. [2019-09-08 06:51:36,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:36,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-08 06:51:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:36,016 INFO L225 Difference]: With dead ends: 1336 [2019-09-08 06:51:36,017 INFO L226 Difference]: Without dead ends: 897 [2019-09-08 06:51:36,019 INFO L628 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-09-08 06:51:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-08 06:51:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 896. [2019-09-08 06:51:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-09-08 06:51:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1266 transitions. [2019-09-08 06:51:36,138 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1266 transitions. Word has length 232 [2019-09-08 06:51:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:36,139 INFO L475 AbstractCegarLoop]: Abstraction has 896 states and 1266 transitions. [2019-09-08 06:51:36,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1266 transitions. [2019-09-08 06:51:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 06:51:36,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:36,143 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:36,143 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:36,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:36,144 INFO L82 PathProgramCache]: Analyzing trace with hash 147513171, now seen corresponding path program 1 times [2019-09-08 06:51:36,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:36,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:36,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:36,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:36,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 06:51:36,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:36,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:51:36,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:36,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 2531 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:36,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 06:51:36,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:36,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:36,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:36,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:36,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:36,903 INFO L87 Difference]: Start difference. First operand 896 states and 1266 transitions. Second operand 7 states. [2019-09-08 06:51:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:37,303 INFO L93 Difference]: Finished difference Result 2689 states and 4009 transitions. [2019-09-08 06:51:37,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:37,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 387 [2019-09-08 06:51:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:37,319 INFO L225 Difference]: With dead ends: 2689 [2019-09-08 06:51:37,320 INFO L226 Difference]: Without dead ends: 1824 [2019-09-08 06:51:37,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:51:37,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2019-09-08 06:51:37,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1738. [2019-09-08 06:51:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 06:51:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2512 transitions. [2019-09-08 06:51:37,629 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2512 transitions. Word has length 387 [2019-09-08 06:51:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:37,629 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2512 transitions. [2019-09-08 06:51:37,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2512 transitions. [2019-09-08 06:51:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-08 06:51:37,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:37,636 INFO L399 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:37,636 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:37,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1339736651, now seen corresponding path program 1 times [2019-09-08 06:51:37,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:37,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:37,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:37,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:37,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-08 06:51:37,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:37,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:51:37,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:51:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:38,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 2642 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:38,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 06:51:38,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:38,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:51:38,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:38,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:38,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:38,341 INFO L87 Difference]: Start difference. First operand 1738 states and 2512 transitions. Second operand 5 states. [2019-09-08 06:51:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:40,084 INFO L93 Difference]: Finished difference Result 7241 states and 11107 transitions. [2019-09-08 06:51:40,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:51:40,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 416 [2019-09-08 06:51:40,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:40,117 INFO L225 Difference]: With dead ends: 7241 [2019-09-08 06:51:40,117 INFO L226 Difference]: Without dead ends: 5549 [2019-09-08 06:51:40,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5549 states. [2019-09-08 06:51:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5549 to 5535. [2019-09-08 06:51:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5535 states. [2019-09-08 06:51:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 8023 transitions. [2019-09-08 06:51:40,922 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 8023 transitions. Word has length 416 [2019-09-08 06:51:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:40,923 INFO L475 AbstractCegarLoop]: Abstraction has 5535 states and 8023 transitions. [2019-09-08 06:51:40,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 8023 transitions. [2019-09-08 06:51:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 06:51:40,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:40,936 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:40,936 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:40,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:40,936 INFO L82 PathProgramCache]: Analyzing trace with hash -942007055, now seen corresponding path program 1 times [2019-09-08 06:51:40,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:40,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:40,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:40,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:40,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 06:51:41,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:41,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:41,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:41,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:41,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:41,073 INFO L87 Difference]: Start difference. First operand 5535 states and 8023 transitions. Second operand 4 states. [2019-09-08 06:51:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:41,741 INFO L93 Difference]: Finished difference Result 9660 states and 13929 transitions. [2019-09-08 06:51:41,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:41,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 387 [2019-09-08 06:51:41,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:41,781 INFO L225 Difference]: With dead ends: 9660 [2019-09-08 06:51:41,781 INFO L226 Difference]: Without dead ends: 4156 [2019-09-08 06:51:41,802 INFO L628 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-09-08 06:51:41,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4156 states. [2019-09-08 06:51:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4156 to 4156. [2019-09-08 06:51:42,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4156 states. [2019-09-08 06:51:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 5950 transitions. [2019-09-08 06:51:42,347 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 5950 transitions. Word has length 387 [2019-09-08 06:51:42,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:42,349 INFO L475 AbstractCegarLoop]: Abstraction has 4156 states and 5950 transitions. [2019-09-08 06:51:42,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 5950 transitions. [2019-09-08 06:51:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 06:51:42,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:42,360 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:42,360 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:42,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:42,361 INFO L82 PathProgramCache]: Analyzing trace with hash -283983568, now seen corresponding path program 1 times [2019-09-08 06:51:42,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:42,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:42,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:42,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:42,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 06:51:42,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:42,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:51:42,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:42,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 2530 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:42,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 06:51:43,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:43,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:43,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:43,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:43,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:43,066 INFO L87 Difference]: Start difference. First operand 4156 states and 5950 transitions. Second operand 7 states. [2019-09-08 06:51:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:43,954 INFO L93 Difference]: Finished difference Result 12698 states and 19483 transitions. [2019-09-08 06:51:43,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:43,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 388 [2019-09-08 06:51:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:43,999 INFO L225 Difference]: With dead ends: 12698 [2019-09-08 06:51:43,999 INFO L226 Difference]: Without dead ends: 8573 [2019-09-08 06:51:44,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:51:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8573 states. [2019-09-08 06:51:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8573 to 8542. [2019-09-08 06:51:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8542 states. [2019-09-08 06:51:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8542 states to 8542 states and 12781 transitions. [2019-09-08 06:51:45,865 INFO L78 Accepts]: Start accepts. Automaton has 8542 states and 12781 transitions. Word has length 388 [2019-09-08 06:51:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:45,866 INFO L475 AbstractCegarLoop]: Abstraction has 8542 states and 12781 transitions. [2019-09-08 06:51:45,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 8542 states and 12781 transitions. [2019-09-08 06:51:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-09-08 06:51:45,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:45,887 INFO L399 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:51:45,888 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:45,888 INFO L82 PathProgramCache]: Analyzing trace with hash -692312328, now seen corresponding path program 1 times [2019-09-08 06:51:45,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:45,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:45,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:45,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:45,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-09-08 06:51:46,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:46,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:46,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:46,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:46,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:46,051 INFO L87 Difference]: Start difference. First operand 8542 states and 12781 transitions. Second operand 4 states. [2019-09-08 06:51:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:47,082 INFO L93 Difference]: Finished difference Result 17038 states and 25490 transitions. [2019-09-08 06:51:47,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:47,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 419 [2019-09-08 06:51:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:47,120 INFO L225 Difference]: With dead ends: 17038 [2019-09-08 06:51:47,120 INFO L226 Difference]: Without dead ends: 8527 [2019-09-08 06:51:47,145 INFO L628 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-09-08 06:51:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8527 states. [2019-09-08 06:51:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8527 to 8527. [2019-09-08 06:51:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8527 states. [2019-09-08 06:51:48,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8527 states to 8527 states and 12752 transitions. [2019-09-08 06:51:48,055 INFO L78 Accepts]: Start accepts. Automaton has 8527 states and 12752 transitions. Word has length 419 [2019-09-08 06:51:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:48,055 INFO L475 AbstractCegarLoop]: Abstraction has 8527 states and 12752 transitions. [2019-09-08 06:51:48,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 8527 states and 12752 transitions. [2019-09-08 06:51:48,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-09-08 06:51:48,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:48,071 INFO L399 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:48,072 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:48,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:48,072 INFO L82 PathProgramCache]: Analyzing trace with hash -548089234, now seen corresponding path program 1 times [2019-09-08 06:51:48,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:48,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:48,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:48,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:48,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:48,229 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-09-08 06:51:48,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:48,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:51:48,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:48,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 2663 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:48,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:48,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:48,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:48,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:48,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:48,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:48,715 INFO L87 Difference]: Start difference. First operand 8527 states and 12752 transitions. Second operand 7 states. [2019-09-08 06:51:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:50,275 INFO L93 Difference]: Finished difference Result 21909 states and 35264 transitions. [2019-09-08 06:51:50,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:50,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 420 [2019-09-08 06:51:50,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:50,342 INFO L225 Difference]: With dead ends: 21909 [2019-09-08 06:51:50,343 INFO L226 Difference]: Without dead ends: 13413 [2019-09-08 06:51:50,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:51:50,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13413 states. [2019-09-08 06:51:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13413 to 13391. [2019-09-08 06:51:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13391 states. [2019-09-08 06:51:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13391 states to 13391 states and 20385 transitions. [2019-09-08 06:51:51,775 INFO L78 Accepts]: Start accepts. Automaton has 13391 states and 20385 transitions. Word has length 420 [2019-09-08 06:51:51,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:51,776 INFO L475 AbstractCegarLoop]: Abstraction has 13391 states and 20385 transitions. [2019-09-08 06:51:51,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 13391 states and 20385 transitions. [2019-09-08 06:51:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-08 06:51:51,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:51,807 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:51,807 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:51,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:51,808 INFO L82 PathProgramCache]: Analyzing trace with hash 663464882, now seen corresponding path program 1 times [2019-09-08 06:51:51,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:51,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:51,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:51,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:51,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 06:51:51,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:51,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:51:51,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:52,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 2533 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:52,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 06:51:52,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:52,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:52,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:52,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:52,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:52,398 INFO L87 Difference]: Start difference. First operand 13391 states and 20385 transitions. Second operand 7 states. [2019-09-08 06:51:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:55,813 INFO L93 Difference]: Finished difference Result 42227 states and 72686 transitions. [2019-09-08 06:51:55,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:55,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 389 [2019-09-08 06:51:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:55,959 INFO L225 Difference]: With dead ends: 42227 [2019-09-08 06:51:55,959 INFO L226 Difference]: Without dead ends: 28867 [2019-09-08 06:51:56,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:51:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28867 states. [2019-09-08 06:51:58,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28867 to 28782. [2019-09-08 06:51:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28782 states. [2019-09-08 06:51:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28782 states to 28782 states and 47012 transitions. [2019-09-08 06:51:59,090 INFO L78 Accepts]: Start accepts. Automaton has 28782 states and 47012 transitions. Word has length 389 [2019-09-08 06:51:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:59,090 INFO L475 AbstractCegarLoop]: Abstraction has 28782 states and 47012 transitions. [2019-09-08 06:51:59,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 28782 states and 47012 transitions. [2019-09-08 06:51:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-09-08 06:51:59,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:59,142 INFO L399 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:59,142 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:59,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:59,142 INFO L82 PathProgramCache]: Analyzing trace with hash -253218989, now seen corresponding path program 1 times [2019-09-08 06:51:59,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:59,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:59,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:59,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:59,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-08 06:51:59,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:59,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:51:59,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:59,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 2666 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:59,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:51:59,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:59,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:51:59,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:59,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:59,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:59,796 INFO L87 Difference]: Start difference. First operand 28782 states and 47012 transitions. Second operand 5 states. [2019-09-08 06:52:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:52:11,786 INFO L93 Difference]: Finished difference Result 137972 states and 273453 transitions. [2019-09-08 06:52:11,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:52:11,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 421 [2019-09-08 06:52:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:52:12,471 INFO L225 Difference]: With dead ends: 137972 [2019-09-08 06:52:12,471 INFO L226 Difference]: Without dead ends: 109234 [2019-09-08 06:52:12,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 423 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:52:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109234 states. [2019-09-08 06:52:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109234 to 108898. [2019-09-08 06:52:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108898 states. [2019-09-08 06:52:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108898 states to 108898 states and 191516 transitions. [2019-09-08 06:52:28,928 INFO L78 Accepts]: Start accepts. Automaton has 108898 states and 191516 transitions. Word has length 421 [2019-09-08 06:52:28,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:52:28,929 INFO L475 AbstractCegarLoop]: Abstraction has 108898 states and 191516 transitions. [2019-09-08 06:52:28,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:52:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 108898 states and 191516 transitions. [2019-09-08 06:52:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-08 06:52:29,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:52:29,090 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:52:29,091 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:52:29,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:52:29,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1976588976, now seen corresponding path program 1 times [2019-09-08 06:52:29,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:52:29,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:52:29,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:29,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:29,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:29,233 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 06:52:29,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:52:29,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:52:29,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:52:29,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:52:29,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:52:29,235 INFO L87 Difference]: Start difference. First operand 108898 states and 191516 transitions. Second operand 4 states. [2019-09-08 06:52:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:52:40,189 INFO L93 Difference]: Finished difference Result 191929 states and 332236 transitions. [2019-09-08 06:52:40,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:52:40,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 389 [2019-09-08 06:52:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:52:40,607 INFO L225 Difference]: With dead ends: 191929 [2019-09-08 06:52:40,607 INFO L226 Difference]: Without dead ends: 83064 [2019-09-08 06:52:41,541 INFO L628 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-09-08 06:52:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83064 states. [2019-09-08 06:52:49,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83064 to 83064. [2019-09-08 06:52:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83064 states. [2019-09-08 06:52:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83064 states to 83064 states and 140774 transitions. [2019-09-08 06:52:50,405 INFO L78 Accepts]: Start accepts. Automaton has 83064 states and 140774 transitions. Word has length 389 [2019-09-08 06:52:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:52:50,406 INFO L475 AbstractCegarLoop]: Abstraction has 83064 states and 140774 transitions. [2019-09-08 06:52:50,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:52:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 83064 states and 140774 transitions. [2019-09-08 06:52:50,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-08 06:52:50,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:52:50,500 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:52:50,500 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:52:50,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:52:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1963546095, now seen corresponding path program 1 times [2019-09-08 06:52:50,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:52:50,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:52:50,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:50,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:50,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 06:52:50,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:52:50,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:52:54,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:54,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 2532 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:52:54,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:52:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 06:52:54,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:52:54,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:52:54,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:52:54,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:52:54,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:52:54,491 INFO L87 Difference]: Start difference. First operand 83064 states and 140774 transitions. Second operand 7 states. [2019-09-08 06:53:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:53:11,755 INFO L93 Difference]: Finished difference Result 256482 states and 519135 transitions. [2019-09-08 06:53:11,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:53:11,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 390 [2019-09-08 06:53:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:53:12,743 INFO L225 Difference]: With dead ends: 256482 [2019-09-08 06:53:12,744 INFO L226 Difference]: Without dead ends: 173449 [2019-09-08 06:53:13,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:53:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173449 states. [2019-09-08 06:53:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173449 to 173202. [2019-09-08 06:53:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173202 states. [2019-09-08 06:53:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173202 states to 173202 states and 317645 transitions. [2019-09-08 06:53:40,277 INFO L78 Accepts]: Start accepts. Automaton has 173202 states and 317645 transitions. Word has length 390 [2019-09-08 06:53:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:53:40,277 INFO L475 AbstractCegarLoop]: Abstraction has 173202 states and 317645 transitions. [2019-09-08 06:53:40,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:53:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 173202 states and 317645 transitions. [2019-09-08 06:53:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-08 06:53:40,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:53:40,540 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:53:40,541 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:53:40,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:53:40,541 INFO L82 PathProgramCache]: Analyzing trace with hash -981092081, now seen corresponding path program 1 times [2019-09-08 06:53:40,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:53:40,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:53:40,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:40,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:53:40,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:53:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 06:53:40,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:53:40,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:53:40,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:53:40,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:53:40,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:53:40,654 INFO L87 Difference]: Start difference. First operand 173202 states and 317645 transitions. Second operand 4 states. [2019-09-08 06:54:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:01,078 INFO L93 Difference]: Finished difference Result 305502 states and 560325 transitions. [2019-09-08 06:54:01,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:01,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 390 [2019-09-08 06:54:01,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:01,794 INFO L225 Difference]: With dead ends: 305502 [2019-09-08 06:54:01,794 INFO L226 Difference]: Without dead ends: 132335 [2019-09-08 06:54:02,640 INFO L628 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-09-08 06:54:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132335 states. [2019-09-08 06:54:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132335 to 132335. [2019-09-08 06:54:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132335 states. [2019-09-08 06:54:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132335 states to 132335 states and 242737 transitions. [2019-09-08 06:54:24,422 INFO L78 Accepts]: Start accepts. Automaton has 132335 states and 242737 transitions. Word has length 390 [2019-09-08 06:54:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:24,423 INFO L475 AbstractCegarLoop]: Abstraction has 132335 states and 242737 transitions. [2019-09-08 06:54:24,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 132335 states and 242737 transitions. [2019-09-08 06:54:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 06:54:24,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:24,613 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:24,614 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:24,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:24,614 INFO L82 PathProgramCache]: Analyzing trace with hash 402003985, now seen corresponding path program 1 times [2019-09-08 06:54:24,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:24,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:24,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:24,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:24,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 06:54:30,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:54:30,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:54:30,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:30,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 2537 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:54:30,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:54:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 06:54:31,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:54:31,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:54:31,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:54:31,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:54:31,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:54:31,081 INFO L87 Difference]: Start difference. First operand 132335 states and 242737 transitions. Second operand 7 states. [2019-09-08 06:55:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:06,690 INFO L93 Difference]: Finished difference Result 424595 states and 992700 transitions. [2019-09-08 06:55:06,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:55:06,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 391 [2019-09-08 06:55:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:19,269 INFO L225 Difference]: With dead ends: 424595 [2019-09-08 06:55:19,270 INFO L226 Difference]: Without dead ends: 292291 [2019-09-08 06:55:21,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:55:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292291 states. [2019-09-08 06:56:12,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292291 to 291558. [2019-09-08 06:56:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291558 states. [2019-09-08 06:56:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291558 states to 291558 states and 619582 transitions. [2019-09-08 06:56:25,763 INFO L78 Accepts]: Start accepts. Automaton has 291558 states and 619582 transitions. Word has length 391 [2019-09-08 06:56:25,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:25,764 INFO L475 AbstractCegarLoop]: Abstraction has 291558 states and 619582 transitions. [2019-09-08 06:56:25,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:56:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 291558 states and 619582 transitions. [2019-09-08 06:56:37,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 06:56:37,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:37,286 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:56:37,286 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:37,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:37,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1887692559, now seen corresponding path program 1 times [2019-09-08 06:56:37,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:37,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:37,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:37,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:37,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 06:56:37,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:37,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:56:37,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:56:37,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:56:37,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:56:37,395 INFO L87 Difference]: Start difference. First operand 291558 states and 619582 transitions. Second operand 4 states. [2019-09-08 06:57:20,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:20,733 INFO L93 Difference]: Finished difference Result 583070 states and 1239062 transitions. [2019-09-08 06:57:20,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:57:20,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 391 [2019-09-08 06:57:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:36,763 INFO L225 Difference]: With dead ends: 583070 [2019-09-08 06:57:36,763 INFO L226 Difference]: Without dead ends: 291543 [2019-09-08 06:57:40,074 INFO L628 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-09-08 06:57:40,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291543 states. [2019-09-08 06:58:34,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291543 to 291543. [2019-09-08 06:58:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291543 states. [2019-09-08 06:58:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291543 states to 291543 states and 619537 transitions. [2019-09-08 06:58:39,558 INFO L78 Accepts]: Start accepts. Automaton has 291543 states and 619537 transitions. Word has length 391 [2019-09-08 06:58:39,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:39,558 INFO L475 AbstractCegarLoop]: Abstraction has 291543 states and 619537 transitions. [2019-09-08 06:58:39,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:58:39,558 INFO L276 IsEmpty]: Start isEmpty. Operand 291543 states and 619537 transitions. [2019-09-08 06:58:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 06:58:40,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:40,176 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:58:40,176 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:40,177 INFO L82 PathProgramCache]: Analyzing trace with hash -809342894, now seen corresponding path program 1 times [2019-09-08 06:58:40,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:40,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:40,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-08 06:58:40,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:58:40,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:58:40,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:40,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 2542 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:58:40,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:58:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-08 06:58:41,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:58:41,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:58:41,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:58:41,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:58:41,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:58:41,756 INFO L87 Difference]: Start difference. First operand 291543 states and 619537 transitions. Second operand 7 states.