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.12.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:49:16,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:49:16,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:49:16,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:49:16,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:49:16,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:49:16,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:49:16,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:49:16,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:49:16,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:49:16,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:49:16,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:49:16,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:49:16,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:49:16,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:49:16,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:49:16,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:49:16,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:49:16,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:49:16,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:49:16,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:49:16,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:49:16,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:49:16,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:49:16,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:49:16,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:49:16,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:49:16,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:49:16,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:49:16,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:49:16,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:49:16,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:49:16,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:49:16,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:49:16,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:49:16,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:49:16,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:49:16,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:49:16,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:49:16,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:49:16,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:49:16,586 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:49:16,602 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:49:16,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:49:16,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:49:16,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:49:16,603 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:49:16,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:49:16,604 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:49:16,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:49:16,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:49:16,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:49:16,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:49:16,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:49:16,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:49:16,605 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:49:16,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:49:16,606 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:49:16,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:49:16,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:49:16,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:49:16,606 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:49:16,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:49:16,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:49:16,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:49:16,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:49:16,607 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:49:16,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:49:16,608 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:49:16,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:49:16,608 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:49:16,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:49:16,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:49:16,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:49:16,661 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:49:16,662 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:49:16,662 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.12.cil-1.c [2019-09-08 06:49:16,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603eab275/989c761ecae141f3b62c4c8a4e20db06/FLAGe9235ac40 [2019-09-08 06:49:17,256 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:49:17,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.12.cil-1.c [2019-09-08 06:49:17,286 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603eab275/989c761ecae141f3b62c4c8a4e20db06/FLAGe9235ac40 [2019-09-08 06:49:17,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603eab275/989c761ecae141f3b62c4c8a4e20db06 [2019-09-08 06:49:17,623 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:49:17,625 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:49:17,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:49:17,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:49:17,630 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:49:17,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:49:17" (1/1) ... [2019-09-08 06:49:17,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd0805f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:17, skipping insertion in model container [2019-09-08 06:49:17,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:49:17" (1/1) ... [2019-09-08 06:49:17,641 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:49:17,709 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:49:18,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:49:18,138 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:49:18,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:49:18,303 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:49:18,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:18 WrapperNode [2019-09-08 06:49:18,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:49:18,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:49:18,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:49:18,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:49:18,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:18" (1/1) ... [2019-09-08 06:49:18,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:18" (1/1) ... [2019-09-08 06:49:18,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:18" (1/1) ... [2019-09-08 06:49:18,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:18" (1/1) ... [2019-09-08 06:49:18,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:18" (1/1) ... [2019-09-08 06:49:18,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:18" (1/1) ... [2019-09-08 06:49:18,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:18" (1/1) ... [2019-09-08 06:49:18,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:49:18,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:49:18,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:49:18,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:49:18,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:18" (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:49:18,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:49:18,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:49:18,458 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:49:18,458 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:49:18,459 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:49:18,459 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:49:18,459 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:49:18,459 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:49:18,460 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:49:18,460 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:49:18,460 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:49:18,460 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-08 06:49:18,460 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-08 06:49:18,460 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-08 06:49:18,461 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-08 06:49:18,461 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit12 [2019-09-08 06:49:18,461 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:49:18,461 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:49:18,461 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:49:18,462 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:49:18,462 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:49:18,462 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:49:18,462 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:49:18,462 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:49:18,462 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-08 06:49:18,462 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-08 06:49:18,463 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-08 06:49:18,463 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-08 06:49:18,463 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit12_triggered [2019-09-08 06:49:18,463 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:49:18,463 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:49:18,464 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:49:18,464 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:49:18,464 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:49:18,464 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:49:18,464 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:49:18,464 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:49:18,465 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:49:18,465 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:49:18,465 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:49:18,465 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:49:18,465 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:49:18,465 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:49:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:49:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:49:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:49:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:49:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:49:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:49:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:49:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:49:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:49:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:49:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-08 06:49:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-08 06:49:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-08 06:49:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-08 06:49:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit12_triggered [2019-09-08 06:49:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:49:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:49:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:49:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:49:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:49:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:49:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:49:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:49:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:49:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:49:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-08 06:49:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-08 06:49:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-08 06:49:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-08 06:49:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure transmit12 [2019-09-08 06:49:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:49:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:49:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:49:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:49:18,471 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:49:18,471 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:49:18,471 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:49:18,471 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:49:18,471 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:49:18,471 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:49:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:49:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:49:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:49:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:49:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:49:19,635 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:49:19,635 INFO L283 CfgBuilder]: Removed 15 assume(true) statements. [2019-09-08 06:49:19,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:49:19 BoogieIcfgContainer [2019-09-08 06:49:19,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:49:19,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:49:19,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:49:19,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:49:19,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:49:17" (1/3) ... [2019-09-08 06:49:19,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621cf07c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:49:19, skipping insertion in model container [2019-09-08 06:49:19,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:18" (2/3) ... [2019-09-08 06:49:19,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621cf07c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:49:19, skipping insertion in model container [2019-09-08 06:49:19,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:49:19" (3/3) ... [2019-09-08 06:49:19,645 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.12.cil-1.c [2019-09-08 06:49:19,655 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:49:19,664 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:49:19,680 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:49:19,715 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:49:19,716 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:49:19,716 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:49:19,716 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:49:19,717 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:49:19,717 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:49:19,717 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:49:19,717 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:49:19,717 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:49:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states. [2019-09-08 06:49:19,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:19,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:19,769 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:49:19,772 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:19,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:19,778 INFO L82 PathProgramCache]: Analyzing trace with hash -162003659, now seen corresponding path program 1 times [2019-09-08 06:49:19,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:19,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:19,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:19,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:19,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:20,294 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:49:20,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:20,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:49:20,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:49:20,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:49:20,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:49:20,320 INFO L87 Difference]: Start difference. First operand 481 states. Second operand 4 states. [2019-09-08 06:49:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:20,870 INFO L93 Difference]: Finished difference Result 945 states and 1468 transitions. [2019-09-08 06:49:20,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:49:20,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-08 06:49:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:20,904 INFO L225 Difference]: With dead ends: 945 [2019-09-08 06:49:20,905 INFO L226 Difference]: Without dead ends: 472 [2019-09-08 06:49:20,923 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:49:20,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-08 06:49:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-09-08 06:49:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 694 transitions. [2019-09-08 06:49:21,043 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 694 transitions. Word has length 232 [2019-09-08 06:49:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:21,045 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 694 transitions. [2019-09-08 06:49:21,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:49:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 694 transitions. [2019-09-08 06:49:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:21,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:21,057 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:49:21,057 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash -105138313, now seen corresponding path program 1 times [2019-09-08 06:49:21,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:21,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:21,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:21,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:21,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:21,290 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:49:21,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:21,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:49:21,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:49:21,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:49:21,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:49:21,294 INFO L87 Difference]: Start difference. First operand 472 states and 694 transitions. Second operand 4 states. [2019-09-08 06:49:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:21,618 INFO L93 Difference]: Finished difference Result 921 states and 1356 transitions. [2019-09-08 06:49:21,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:49:21,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-08 06:49:21,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:21,622 INFO L225 Difference]: With dead ends: 921 [2019-09-08 06:49:21,622 INFO L226 Difference]: Without dead ends: 472 [2019-09-08 06:49:21,625 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:49:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-08 06:49:21,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-09-08 06:49:21,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 693 transitions. [2019-09-08 06:49:21,660 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 693 transitions. Word has length 232 [2019-09-08 06:49:21,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:21,660 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 693 transitions. [2019-09-08 06:49:21,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:49:21,661 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 693 transitions. [2019-09-08 06:49:21,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:21,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:21,665 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:49:21,665 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:21,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:21,666 INFO L82 PathProgramCache]: Analyzing trace with hash 768527289, now seen corresponding path program 1 times [2019-09-08 06:49:21,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:21,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:21,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:21,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:21,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:21,840 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:49:21,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:21,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:21,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:21,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:21,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:21,843 INFO L87 Difference]: Start difference. First operand 472 states and 693 transitions. Second operand 5 states. [2019-09-08 06:49:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:22,805 INFO L93 Difference]: Finished difference Result 984 states and 1477 transitions. [2019-09-08 06:49:22,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:22,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:22,810 INFO L225 Difference]: With dead ends: 984 [2019-09-08 06:49:22,810 INFO L226 Difference]: Without dead ends: 542 [2019-09-08 06:49:22,812 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:49:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-09-08 06:49:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 472. [2019-09-08 06:49:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 692 transitions. [2019-09-08 06:49:22,845 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 692 transitions. Word has length 232 [2019-09-08 06:49:22,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:22,846 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 692 transitions. [2019-09-08 06:49:22,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:22,846 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 692 transitions. [2019-09-08 06:49:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:22,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:22,851 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:49:22,851 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:22,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:22,852 INFO L82 PathProgramCache]: Analyzing trace with hash 982144375, now seen corresponding path program 1 times [2019-09-08 06:49:22,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:22,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:22,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:22,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:22,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:23,054 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:49:23,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:23,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:23,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:23,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:23,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:23,057 INFO L87 Difference]: Start difference. First operand 472 states and 692 transitions. Second operand 5 states. [2019-09-08 06:49:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:23,962 INFO L93 Difference]: Finished difference Result 984 states and 1476 transitions. [2019-09-08 06:49:23,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:23,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:23,968 INFO L225 Difference]: With dead ends: 984 [2019-09-08 06:49:23,968 INFO L226 Difference]: Without dead ends: 542 [2019-09-08 06:49:23,970 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:49:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-09-08 06:49:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 472. [2019-09-08 06:49:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 691 transitions. [2019-09-08 06:49:24,006 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 691 transitions. Word has length 232 [2019-09-08 06:49:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:24,007 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 691 transitions. [2019-09-08 06:49:24,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 691 transitions. [2019-09-08 06:49:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:24,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:24,013 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:49:24,013 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:24,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:24,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1266129913, now seen corresponding path program 1 times [2019-09-08 06:49:24,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:24,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:24,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:24,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:24,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:24,218 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:49:24,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:24,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:24,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:24,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:24,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:24,230 INFO L87 Difference]: Start difference. First operand 472 states and 691 transitions. Second operand 5 states. [2019-09-08 06:49:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:25,158 INFO L93 Difference]: Finished difference Result 982 states and 1470 transitions. [2019-09-08 06:49:25,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:25,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:25,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:25,164 INFO L225 Difference]: With dead ends: 982 [2019-09-08 06:49:25,165 INFO L226 Difference]: Without dead ends: 540 [2019-09-08 06:49:25,168 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:49:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-08 06:49:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 472. [2019-09-08 06:49:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 690 transitions. [2019-09-08 06:49:25,216 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 690 transitions. Word has length 232 [2019-09-08 06:49:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:25,217 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 690 transitions. [2019-09-08 06:49:25,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:25,217 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 690 transitions. [2019-09-08 06:49:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:25,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:25,223 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:49:25,224 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:25,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:25,225 INFO L82 PathProgramCache]: Analyzing trace with hash -664371913, now seen corresponding path program 1 times [2019-09-08 06:49:25,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:25,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:25,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:25,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:25,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:25,383 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:49:25,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:25,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:25,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:25,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:25,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:25,385 INFO L87 Difference]: Start difference. First operand 472 states and 690 transitions. Second operand 5 states. [2019-09-08 06:49:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:26,382 INFO L93 Difference]: Finished difference Result 980 states and 1464 transitions. [2019-09-08 06:49:26,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:26,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:26,389 INFO L225 Difference]: With dead ends: 980 [2019-09-08 06:49:26,389 INFO L226 Difference]: Without dead ends: 538 [2019-09-08 06:49:26,392 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:49:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-08 06:49:26,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 472. [2019-09-08 06:49:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 689 transitions. [2019-09-08 06:49:26,443 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 689 transitions. Word has length 232 [2019-09-08 06:49:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:26,443 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 689 transitions. [2019-09-08 06:49:26,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 689 transitions. [2019-09-08 06:49:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:26,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:26,450 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:49:26,451 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:26,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1905753145, now seen corresponding path program 1 times [2019-09-08 06:49:26,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:26,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:26,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:26,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:26,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:26,710 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:49:26,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:26,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:26,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:26,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:26,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:26,713 INFO L87 Difference]: Start difference. First operand 472 states and 689 transitions. Second operand 5 states. [2019-09-08 06:49:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:27,976 INFO L93 Difference]: Finished difference Result 978 states and 1458 transitions. [2019-09-08 06:49:27,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:27,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:27,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:27,981 INFO L225 Difference]: With dead ends: 978 [2019-09-08 06:49:27,981 INFO L226 Difference]: Without dead ends: 536 [2019-09-08 06:49:27,983 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:49:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-08 06:49:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 472. [2019-09-08 06:49:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 688 transitions. [2019-09-08 06:49:28,023 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 688 transitions. Word has length 232 [2019-09-08 06:49:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:28,025 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 688 transitions. [2019-09-08 06:49:28,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 688 transitions. [2019-09-08 06:49:28,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:28,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:28,029 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:49:28,029 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:28,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:28,030 INFO L82 PathProgramCache]: Analyzing trace with hash -89549577, now seen corresponding path program 1 times [2019-09-08 06:49:28,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:28,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:28,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:28,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:28,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:28,212 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:49:28,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:28,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:28,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:28,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:28,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:28,216 INFO L87 Difference]: Start difference. First operand 472 states and 688 transitions. Second operand 5 states. [2019-09-08 06:49:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:29,171 INFO L93 Difference]: Finished difference Result 976 states and 1452 transitions. [2019-09-08 06:49:29,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:29,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:29,176 INFO L225 Difference]: With dead ends: 976 [2019-09-08 06:49:29,176 INFO L226 Difference]: Without dead ends: 534 [2019-09-08 06:49:29,178 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:49:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-08 06:49:29,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 472. [2019-09-08 06:49:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 687 transitions. [2019-09-08 06:49:29,208 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 687 transitions. Word has length 232 [2019-09-08 06:49:29,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:29,209 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 687 transitions. [2019-09-08 06:49:29,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:29,209 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 687 transitions. [2019-09-08 06:49:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:29,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:29,213 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:49:29,213 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:29,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:29,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1924295801, now seen corresponding path program 1 times [2019-09-08 06:49:29,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:29,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:29,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:29,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:29,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:29,328 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:49:29,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:29,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:29,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:29,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:29,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:29,330 INFO L87 Difference]: Start difference. First operand 472 states and 687 transitions. Second operand 5 states. [2019-09-08 06:49:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:30,251 INFO L93 Difference]: Finished difference Result 972 states and 1442 transitions. [2019-09-08 06:49:30,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:30,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:30,258 INFO L225 Difference]: With dead ends: 972 [2019-09-08 06:49:30,259 INFO L226 Difference]: Without dead ends: 530 [2019-09-08 06:49:30,263 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:49:30,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-09-08 06:49:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 472. [2019-09-08 06:49:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 686 transitions. [2019-09-08 06:49:30,318 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 686 transitions. Word has length 232 [2019-09-08 06:49:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:30,319 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 686 transitions. [2019-09-08 06:49:30,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 686 transitions. [2019-09-08 06:49:30,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:30,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:30,327 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:49:30,327 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:30,328 INFO L82 PathProgramCache]: Analyzing trace with hash -156287877, now seen corresponding path program 1 times [2019-09-08 06:49:30,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:30,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:30,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:30,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:30,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:30,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:49:30,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:30,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:30,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:30,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:30,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:30,550 INFO L87 Difference]: Start difference. First operand 472 states and 686 transitions. Second operand 5 states. [2019-09-08 06:49:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:31,775 INFO L93 Difference]: Finished difference Result 970 states and 1436 transitions. [2019-09-08 06:49:31,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:31,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:31,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:31,783 INFO L225 Difference]: With dead ends: 970 [2019-09-08 06:49:31,784 INFO L226 Difference]: Without dead ends: 528 [2019-09-08 06:49:31,786 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:49:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-08 06:49:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 472. [2019-09-08 06:49:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 685 transitions. [2019-09-08 06:49:31,842 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 685 transitions. Word has length 232 [2019-09-08 06:49:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:31,843 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 685 transitions. [2019-09-08 06:49:31,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 685 transitions. [2019-09-08 06:49:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:31,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:31,851 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:49:31,852 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:31,852 INFO L82 PathProgramCache]: Analyzing trace with hash 330785849, now seen corresponding path program 1 times [2019-09-08 06:49:31,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:31,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:31,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:31,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:31,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:32,197 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:49:32,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:32,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:32,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:32,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:32,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:32,200 INFO L87 Difference]: Start difference. First operand 472 states and 685 transitions. Second operand 5 states. [2019-09-08 06:49:33,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:33,122 INFO L93 Difference]: Finished difference Result 968 states and 1430 transitions. [2019-09-08 06:49:33,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:33,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:33,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:33,131 INFO L225 Difference]: With dead ends: 968 [2019-09-08 06:49:33,131 INFO L226 Difference]: Without dead ends: 526 [2019-09-08 06:49:33,133 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:49:33,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-09-08 06:49:33,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 472. [2019-09-08 06:49:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 684 transitions. [2019-09-08 06:49:33,169 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 684 transitions. Word has length 232 [2019-09-08 06:49:33,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:33,171 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 684 transitions. [2019-09-08 06:49:33,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 684 transitions. [2019-09-08 06:49:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:33,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:33,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:49:33,173 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:33,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:33,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1454617413, now seen corresponding path program 1 times [2019-09-08 06:49:33,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:33,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:33,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:33,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:33,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:33,299 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:49:33,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:33,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:33,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:33,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:33,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:33,302 INFO L87 Difference]: Start difference. First operand 472 states and 684 transitions. Second operand 5 states. [2019-09-08 06:49:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:34,251 INFO L93 Difference]: Finished difference Result 966 states and 1424 transitions. [2019-09-08 06:49:34,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:34,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:34,257 INFO L225 Difference]: With dead ends: 966 [2019-09-08 06:49:34,257 INFO L226 Difference]: Without dead ends: 524 [2019-09-08 06:49:34,262 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:49:34,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-09-08 06:49:34,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 472. [2019-09-08 06:49:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 683 transitions. [2019-09-08 06:49:34,306 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 683 transitions. Word has length 232 [2019-09-08 06:49:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:34,307 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 683 transitions. [2019-09-08 06:49:34,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 683 transitions. [2019-09-08 06:49:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:34,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:34,313 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:49:34,313 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:34,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:34,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1927853063, now seen corresponding path program 1 times [2019-09-08 06:49:34,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:34,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:34,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:34,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:34,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:34,480 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:49:34,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:34,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:34,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:34,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:34,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:34,483 INFO L87 Difference]: Start difference. First operand 472 states and 683 transitions. Second operand 5 states. [2019-09-08 06:49:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:35,484 INFO L93 Difference]: Finished difference Result 964 states and 1418 transitions. [2019-09-08 06:49:35,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:35,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:35,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:35,492 INFO L225 Difference]: With dead ends: 964 [2019-09-08 06:49:35,492 INFO L226 Difference]: Without dead ends: 522 [2019-09-08 06:49:35,495 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:49:35,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-08 06:49:35,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 472. [2019-09-08 06:49:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 682 transitions. [2019-09-08 06:49:35,535 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 682 transitions. Word has length 232 [2019-09-08 06:49:35,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:35,535 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 682 transitions. [2019-09-08 06:49:35,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:35,536 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 682 transitions. [2019-09-08 06:49:35,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:35,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:35,538 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:49:35,538 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:35,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:35,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1804571397, now seen corresponding path program 1 times [2019-09-08 06:49:35,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:35,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:35,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:35,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:35,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:35,667 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:49:35,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:35,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:35,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:35,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:35,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:35,669 INFO L87 Difference]: Start difference. First operand 472 states and 682 transitions. Second operand 5 states. [2019-09-08 06:49:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:36,891 INFO L93 Difference]: Finished difference Result 962 states and 1412 transitions. [2019-09-08 06:49:36,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:36,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:36,898 INFO L225 Difference]: With dead ends: 962 [2019-09-08 06:49:36,898 INFO L226 Difference]: Without dead ends: 520 [2019-09-08 06:49:36,901 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:49:36,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-08 06:49:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 472. [2019-09-08 06:49:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 681 transitions. [2019-09-08 06:49:36,960 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 681 transitions. Word has length 232 [2019-09-08 06:49:36,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:36,961 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 681 transitions. [2019-09-08 06:49:36,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 681 transitions. [2019-09-08 06:49:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:36,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:36,965 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:49:36,965 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:36,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:36,966 INFO L82 PathProgramCache]: Analyzing trace with hash 416162745, now seen corresponding path program 1 times [2019-09-08 06:49:36,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:36,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:36,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:36,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:36,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:37,148 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:49:37,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:37,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:37,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:37,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:37,151 INFO L87 Difference]: Start difference. First operand 472 states and 681 transitions. Second operand 5 states. [2019-09-08 06:49:38,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:38,453 INFO L93 Difference]: Finished difference Result 1009 states and 1498 transitions. [2019-09-08 06:49:38,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:38,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:38,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:38,459 INFO L225 Difference]: With dead ends: 1009 [2019-09-08 06:49:38,459 INFO L226 Difference]: Without dead ends: 567 [2019-09-08 06:49:38,464 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:49:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-08 06:49:38,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 472. [2019-09-08 06:49:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:38,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 680 transitions. [2019-09-08 06:49:38,532 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 680 transitions. Word has length 232 [2019-09-08 06:49:38,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:38,532 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 680 transitions. [2019-09-08 06:49:38,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 680 transitions. [2019-09-08 06:49:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:38,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:38,536 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:49:38,537 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:38,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:38,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1319083323, now seen corresponding path program 1 times [2019-09-08 06:49:38,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:38,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:38,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:38,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:38,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:38,732 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:49:38,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:38,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:38,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:38,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:38,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:38,738 INFO L87 Difference]: Start difference. First operand 472 states and 680 transitions. Second operand 5 states. [2019-09-08 06:49:39,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:39,727 INFO L93 Difference]: Finished difference Result 1005 states and 1488 transitions. [2019-09-08 06:49:39,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:39,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:39,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:39,732 INFO L225 Difference]: With dead ends: 1005 [2019-09-08 06:49:39,733 INFO L226 Difference]: Without dead ends: 563 [2019-09-08 06:49:39,734 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:49:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-09-08 06:49:39,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 472. [2019-09-08 06:49:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 679 transitions. [2019-09-08 06:49:39,775 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 679 transitions. Word has length 232 [2019-09-08 06:49:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:39,775 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 679 transitions. [2019-09-08 06:49:39,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 679 transitions. [2019-09-08 06:49:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:39,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:39,777 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:49:39,778 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:39,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:39,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1311084349, now seen corresponding path program 1 times [2019-09-08 06:49:39,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:39,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:39,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:39,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:39,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:39,907 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:49:39,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:39,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:39,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:39,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:39,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:39,908 INFO L87 Difference]: Start difference. First operand 472 states and 679 transitions. Second operand 5 states. [2019-09-08 06:49:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:40,797 INFO L93 Difference]: Finished difference Result 1003 states and 1482 transitions. [2019-09-08 06:49:40,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:40,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:40,804 INFO L225 Difference]: With dead ends: 1003 [2019-09-08 06:49:40,804 INFO L226 Difference]: Without dead ends: 561 [2019-09-08 06:49:40,809 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:49:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-08 06:49:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 472. [2019-09-08 06:49:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 678 transitions. [2019-09-08 06:49:40,866 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 678 transitions. Word has length 232 [2019-09-08 06:49:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:40,866 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 678 transitions. [2019-09-08 06:49:40,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 678 transitions. [2019-09-08 06:49:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:40,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:40,869 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:49:40,869 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:40,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:40,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1460120325, now seen corresponding path program 1 times [2019-09-08 06:49:40,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:40,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:40,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:40,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:40,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:41,002 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:49:41,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:41,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:41,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:41,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:41,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:41,005 INFO L87 Difference]: Start difference. First operand 472 states and 678 transitions. Second operand 5 states. [2019-09-08 06:49:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:41,989 INFO L93 Difference]: Finished difference Result 1001 states and 1476 transitions. [2019-09-08 06:49:41,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:41,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:41,994 INFO L225 Difference]: With dead ends: 1001 [2019-09-08 06:49:41,994 INFO L226 Difference]: Without dead ends: 559 [2019-09-08 06:49:41,996 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:49:41,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-08 06:49:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 472. [2019-09-08 06:49:42,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 677 transitions. [2019-09-08 06:49:42,038 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 677 transitions. Word has length 232 [2019-09-08 06:49:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:42,039 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 677 transitions. [2019-09-08 06:49:42,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 677 transitions. [2019-09-08 06:49:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:42,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:42,041 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:49:42,041 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:42,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:42,042 INFO L82 PathProgramCache]: Analyzing trace with hash -302588035, now seen corresponding path program 1 times [2019-09-08 06:49:42,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:42,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:42,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:42,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:42,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:42,161 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:49:42,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:42,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:42,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:42,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:42,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:42,164 INFO L87 Difference]: Start difference. First operand 472 states and 677 transitions. Second operand 5 states. [2019-09-08 06:49:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:43,085 INFO L93 Difference]: Finished difference Result 999 states and 1470 transitions. [2019-09-08 06:49:43,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:43,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:43,091 INFO L225 Difference]: With dead ends: 999 [2019-09-08 06:49:43,091 INFO L226 Difference]: Without dead ends: 557 [2019-09-08 06:49:43,093 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:49:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-09-08 06:49:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 472. [2019-09-08 06:49:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 676 transitions. [2019-09-08 06:49:43,139 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 676 transitions. Word has length 232 [2019-09-08 06:49:43,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:43,140 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 676 transitions. [2019-09-08 06:49:43,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 676 transitions. [2019-09-08 06:49:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:43,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:43,142 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:49:43,142 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:43,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:43,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1650721605, now seen corresponding path program 1 times [2019-09-08 06:49:43,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:43,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:43,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:43,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:43,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:43,248 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:49:43,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:43,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:43,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:43,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:43,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:43,250 INFO L87 Difference]: Start difference. First operand 472 states and 676 transitions. Second operand 5 states. [2019-09-08 06:49:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:44,243 INFO L93 Difference]: Finished difference Result 997 states and 1464 transitions. [2019-09-08 06:49:44,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:44,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:44,247 INFO L225 Difference]: With dead ends: 997 [2019-09-08 06:49:44,247 INFO L226 Difference]: Without dead ends: 555 [2019-09-08 06:49:44,249 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:49:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-08 06:49:44,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 472. [2019-09-08 06:49:44,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 675 transitions. [2019-09-08 06:49:44,299 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 675 transitions. Word has length 232 [2019-09-08 06:49:44,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:44,299 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 675 transitions. [2019-09-08 06:49:44,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 675 transitions. [2019-09-08 06:49:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:44,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:44,302 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:49:44,302 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:44,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:44,302 INFO L82 PathProgramCache]: Analyzing trace with hash 106905533, now seen corresponding path program 1 times [2019-09-08 06:49:44,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:44,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:44,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:44,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:44,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:44,409 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:49:44,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:44,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:44,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:44,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:44,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:44,411 INFO L87 Difference]: Start difference. First operand 472 states and 675 transitions. Second operand 5 states. [2019-09-08 06:49:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:45,377 INFO L93 Difference]: Finished difference Result 995 states and 1458 transitions. [2019-09-08 06:49:45,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:45,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:45,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:45,382 INFO L225 Difference]: With dead ends: 995 [2019-09-08 06:49:45,383 INFO L226 Difference]: Without dead ends: 553 [2019-09-08 06:49:45,384 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:49:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-09-08 06:49:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 472. [2019-09-08 06:49:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 674 transitions. [2019-09-08 06:49:45,433 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 674 transitions. Word has length 232 [2019-09-08 06:49:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:45,433 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 674 transitions. [2019-09-08 06:49:45,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 674 transitions. [2019-09-08 06:49:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:45,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:45,435 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:49:45,436 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:45,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:45,436 INFO L82 PathProgramCache]: Analyzing trace with hash 579245179, now seen corresponding path program 1 times [2019-09-08 06:49:45,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:45,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:45,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:45,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:45,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:45,538 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:49:45,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:45,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:45,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:45,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:45,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:45,539 INFO L87 Difference]: Start difference. First operand 472 states and 674 transitions. Second operand 5 states. [2019-09-08 06:49:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:46,522 INFO L93 Difference]: Finished difference Result 993 states and 1452 transitions. [2019-09-08 06:49:46,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:46,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:46,530 INFO L225 Difference]: With dead ends: 993 [2019-09-08 06:49:46,530 INFO L226 Difference]: Without dead ends: 551 [2019-09-08 06:49:46,531 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:49:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-08 06:49:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 472. [2019-09-08 06:49:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 673 transitions. [2019-09-08 06:49:46,579 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 673 transitions. Word has length 232 [2019-09-08 06:49:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:46,580 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 673 transitions. [2019-09-08 06:49:46,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 673 transitions. [2019-09-08 06:49:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:46,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:46,582 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:49:46,582 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:46,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:46,583 INFO L82 PathProgramCache]: Analyzing trace with hash -236802051, now seen corresponding path program 1 times [2019-09-08 06:49:46,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:46,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:46,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:46,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:46,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:46,682 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:49:46,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:46,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:46,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:46,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:46,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:46,684 INFO L87 Difference]: Start difference. First operand 472 states and 673 transitions. Second operand 5 states. [2019-09-08 06:49:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:47,572 INFO L93 Difference]: Finished difference Result 989 states and 1442 transitions. [2019-09-08 06:49:47,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:47,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:47,577 INFO L225 Difference]: With dead ends: 989 [2019-09-08 06:49:47,577 INFO L226 Difference]: Without dead ends: 547 [2019-09-08 06:49:47,579 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:49:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-08 06:49:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 472. [2019-09-08 06:49:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 672 transitions. [2019-09-08 06:49:47,629 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 672 transitions. Word has length 232 [2019-09-08 06:49:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:47,630 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 672 transitions. [2019-09-08 06:49:47,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 672 transitions. [2019-09-08 06:49:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:47,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:47,632 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:49:47,632 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:47,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:47,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1362347007, now seen corresponding path program 1 times [2019-09-08 06:49:47,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:47,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:47,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:47,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:47,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:47,742 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:49:47,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:47,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:47,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:47,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:47,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:47,744 INFO L87 Difference]: Start difference. First operand 472 states and 672 transitions. Second operand 5 states. [2019-09-08 06:49:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:48,679 INFO L93 Difference]: Finished difference Result 987 states and 1436 transitions. [2019-09-08 06:49:48,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:48,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:48,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:48,683 INFO L225 Difference]: With dead ends: 987 [2019-09-08 06:49:48,684 INFO L226 Difference]: Without dead ends: 545 [2019-09-08 06:49:48,685 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:49:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-09-08 06:49:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 472. [2019-09-08 06:49:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 671 transitions. [2019-09-08 06:49:48,759 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 671 transitions. Word has length 232 [2019-09-08 06:49:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:48,760 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 671 transitions. [2019-09-08 06:49:48,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 671 transitions. [2019-09-08 06:49:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:48,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:48,762 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:49:48,763 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:48,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:48,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1968121789, now seen corresponding path program 1 times [2019-09-08 06:49:48,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:48,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:48,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:48,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:48,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:48,859 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:49:48,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:48,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:48,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:48,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:48,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:48,861 INFO L87 Difference]: Start difference. First operand 472 states and 671 transitions. Second operand 5 states. [2019-09-08 06:49:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:49,805 INFO L93 Difference]: Finished difference Result 985 states and 1430 transitions. [2019-09-08 06:49:49,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:49,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-08 06:49:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:49,809 INFO L225 Difference]: With dead ends: 985 [2019-09-08 06:49:49,809 INFO L226 Difference]: Without dead ends: 543 [2019-09-08 06:49:49,811 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:49:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-08 06:49:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 472. [2019-09-08 06:49:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:49:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 670 transitions. [2019-09-08 06:49:49,865 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 670 transitions. Word has length 232 [2019-09-08 06:49:49,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:49,866 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 670 transitions. [2019-09-08 06:49:49,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:49,866 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 670 transitions. [2019-09-08 06:49:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 06:49:49,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:49,868 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:49:49,868 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:49,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1987662911, now seen corresponding path program 1 times [2019-09-08 06:49:49,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:49,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:49,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:49,979 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:49:49,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:49,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:49:49,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:49:49,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:49:49,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:49:49,980 INFO L87 Difference]: Start difference. First operand 472 states and 670 transitions. Second operand 4 states. [2019-09-08 06:49:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:50,470 INFO L93 Difference]: Finished difference Result 1340 states and 1964 transitions. [2019-09-08 06:49:50,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:49:50,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-08 06:49:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:50,478 INFO L225 Difference]: With dead ends: 1340 [2019-09-08 06:49:50,478 INFO L226 Difference]: Without dead ends: 899 [2019-09-08 06:49:50,481 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:49:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-09-08 06:49:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 898. [2019-09-08 06:49:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2019-09-08 06:49:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1270 transitions. [2019-09-08 06:49:50,598 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1270 transitions. Word has length 232 [2019-09-08 06:49:50,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:50,598 INFO L475 AbstractCegarLoop]: Abstraction has 898 states and 1270 transitions. [2019-09-08 06:49:50,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:49:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1270 transitions. [2019-09-08 06:49:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 06:49:50,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:50,604 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:49:50,604 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:50,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:50,605 INFO L82 PathProgramCache]: Analyzing trace with hash -976644529, now seen corresponding path program 1 times [2019-09-08 06:49:50,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:50,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:50,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:50,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:50,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:50,782 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:49:50,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:49:50,782 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:49:50,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:51,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 2549 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:49:51,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:49:51,297 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:49:51,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:49:51,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:49:51,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:49:51,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:49:51,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:49:51,317 INFO L87 Difference]: Start difference. First operand 898 states and 1270 transitions. Second operand 7 states. [2019-09-08 06:49:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:51,740 INFO L93 Difference]: Finished difference Result 2695 states and 4021 transitions. [2019-09-08 06:49:51,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:49:51,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 387 [2019-09-08 06:49:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:51,753 INFO L225 Difference]: With dead ends: 2695 [2019-09-08 06:49:51,753 INFO L226 Difference]: Without dead ends: 1828 [2019-09-08 06:49:51,757 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:49:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2019-09-08 06:49:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1742. [2019-09-08 06:49:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-09-08 06:49:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2520 transitions. [2019-09-08 06:49:52,061 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2520 transitions. Word has length 387 [2019-09-08 06:49:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:52,061 INFO L475 AbstractCegarLoop]: Abstraction has 1742 states and 2520 transitions. [2019-09-08 06:49:52,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:49:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2520 transitions. [2019-09-08 06:49:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-08 06:49:52,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:52,073 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:49:52,073 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:52,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:52,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1657787901, now seen corresponding path program 1 times [2019-09-08 06:49:52,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:52,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:52,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:52,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:52,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-09-08 06:49:52,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:52,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:49:52,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:49:52,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:49:52,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:49:52,407 INFO L87 Difference]: Start difference. First operand 1742 states and 2520 transitions. Second operand 4 states. [2019-09-08 06:49:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:53,024 INFO L93 Difference]: Finished difference Result 3437 states and 4965 transitions. [2019-09-08 06:49:53,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:49:53,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 416 [2019-09-08 06:49:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:53,038 INFO L225 Difference]: With dead ends: 3437 [2019-09-08 06:49:53,038 INFO L226 Difference]: Without dead ends: 1726 [2019-09-08 06:49:53,045 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:49:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-09-08 06:49:53,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1726. [2019-09-08 06:49:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-09-08 06:49:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2489 transitions. [2019-09-08 06:49:53,325 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2489 transitions. Word has length 416 [2019-09-08 06:49:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:53,325 INFO L475 AbstractCegarLoop]: Abstraction has 1726 states and 2489 transitions. [2019-09-08 06:49:53,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:49:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2489 transitions. [2019-09-08 06:49:53,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 06:49:53,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:53,331 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:49:53,331 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:53,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash -718668664, now seen corresponding path program 1 times [2019-09-08 06:49:53,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:53,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:53,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:53,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:53,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-08 06:49:53,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:49:53,492 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:49:53,515 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:49:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:53,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 2554 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:49:53,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:49:53,943 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:49:53,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:49:53,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:49:53,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:53,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:53,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:53,950 INFO L87 Difference]: Start difference. First operand 1726 states and 2489 transitions. Second operand 5 states. [2019-09-08 06:49:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:55,573 INFO L93 Difference]: Finished difference Result 6736 states and 10385 transitions. [2019-09-08 06:49:55,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:49:55,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 388 [2019-09-08 06:49:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:55,601 INFO L225 Difference]: With dead ends: 6736 [2019-09-08 06:49:55,601 INFO L226 Difference]: Without dead ends: 5041 [2019-09-08 06:49:55,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 392 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:49:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5041 states. [2019-09-08 06:49:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5041 to 5003. [2019-09-08 06:49:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5003 states. [2019-09-08 06:49:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5003 states to 5003 states and 7383 transitions. [2019-09-08 06:49:56,406 INFO L78 Accepts]: Start accepts. Automaton has 5003 states and 7383 transitions. Word has length 388 [2019-09-08 06:49:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:56,407 INFO L475 AbstractCegarLoop]: Abstraction has 5003 states and 7383 transitions. [2019-09-08 06:49:56,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 5003 states and 7383 transitions. [2019-09-08 06:49:56,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 06:49:56,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:56,418 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:49:56,418 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:56,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:56,419 INFO L82 PathProgramCache]: Analyzing trace with hash -984011226, now seen corresponding path program 1 times [2019-09-08 06:49:56,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:56,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:56,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:56,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:56,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:56,563 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:49:56,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:56,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:49:56,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:49:56,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:49:56,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:49:56,565 INFO L87 Difference]: Start difference. First operand 5003 states and 7383 transitions. Second operand 4 states. [2019-09-08 06:49:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:57,388 INFO L93 Difference]: Finished difference Result 9960 states and 14694 transitions. [2019-09-08 06:49:57,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:49:57,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 388 [2019-09-08 06:49:57,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:57,429 INFO L225 Difference]: With dead ends: 9960 [2019-09-08 06:49:57,429 INFO L226 Difference]: Without dead ends: 4988 [2019-09-08 06:49:57,452 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:49:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-09-08 06:49:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4988. [2019-09-08 06:49:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-09-08 06:49:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 7354 transitions. [2019-09-08 06:49:58,304 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 7354 transitions. Word has length 388 [2019-09-08 06:49:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:58,304 INFO L475 AbstractCegarLoop]: Abstraction has 4988 states and 7354 transitions. [2019-09-08 06:49:58,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:49:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 7354 transitions. [2019-09-08 06:49:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-08 06:49:58,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:58,320 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:49:58,320 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:58,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:58,321 INFO L82 PathProgramCache]: Analyzing trace with hash 15817262, now seen corresponding path program 1 times [2019-09-08 06:49:58,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:58,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:58,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:58,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:58,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:58,491 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:49:58,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:49:58,492 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) [2019-09-08 06:49:58,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:49:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:58,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 2555 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:49:58,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:49:58,894 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:49:58,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:49:58,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:49:58,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:49:58,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:49:58,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:49:58,901 INFO L87 Difference]: Start difference. First operand 4988 states and 7354 transitions. Second operand 7 states. [2019-09-08 06:49:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:59,917 INFO L93 Difference]: Finished difference Result 15161 states and 24290 transitions. [2019-09-08 06:49:59,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:49:59,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 389 [2019-09-08 06:49:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:59,968 INFO L225 Difference]: With dead ends: 15161 [2019-09-08 06:49:59,969 INFO L226 Difference]: Without dead ends: 10204 [2019-09-08 06:50:00,000 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:50:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10204 states. [2019-09-08 06:50:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10204 to 10164. [2019-09-08 06:50:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10164 states. [2019-09-08 06:50:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10164 states to 10164 states and 15800 transitions. [2019-09-08 06:50:01,561 INFO L78 Accepts]: Start accepts. Automaton has 10164 states and 15800 transitions. Word has length 389 [2019-09-08 06:50:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:01,561 INFO L475 AbstractCegarLoop]: Abstraction has 10164 states and 15800 transitions. [2019-09-08 06:50:01,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:50:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 10164 states and 15800 transitions. [2019-09-08 06:50:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-09-08 06:50:01,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:01,583 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, 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:50:01,583 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:01,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:01,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1589278369, now seen corresponding path program 1 times [2019-09-08 06:50:01,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:01,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:01,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:01,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:01,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-09-08 06:50:01,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:01,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:50:01,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:50:01,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:50:01,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:50:01,740 INFO L87 Difference]: Start difference. First operand 10164 states and 15800 transitions. Second operand 4 states. [2019-09-08 06:50:02,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:02,797 INFO L93 Difference]: Finished difference Result 20283 states and 31531 transitions. [2019-09-08 06:50:02,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:50:02,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 420 [2019-09-08 06:50:02,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:02,846 INFO L225 Difference]: With dead ends: 20283 [2019-09-08 06:50:02,847 INFO L226 Difference]: Without dead ends: 10150 [2019-09-08 06:50:02,879 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:50:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10150 states. [2019-09-08 06:50:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10150 to 10150. [2019-09-08 06:50:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10150 states. [2019-09-08 06:50:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10150 states to 10150 states and 15773 transitions. [2019-09-08 06:50:04,092 INFO L78 Accepts]: Start accepts. Automaton has 10150 states and 15773 transitions. Word has length 420 [2019-09-08 06:50:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:04,092 INFO L475 AbstractCegarLoop]: Abstraction has 10150 states and 15773 transitions. [2019-09-08 06:50:04,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:50:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 10150 states and 15773 transitions. [2019-09-08 06:50:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-08 06:50:04,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:04,108 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:50:04,109 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:04,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1705310423, now seen corresponding path program 1 times [2019-09-08 06:50:04,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:04,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:04,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:04,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:04,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 06:50:04,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:50:04,250 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) [2019-09-08 06:50:04,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:50:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:04,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 2560 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:50:04,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:50:04,690 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:50:04,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:50:04,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:50:04,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:50:04,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:50:04,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:50:04,699 INFO L87 Difference]: Start difference. First operand 10150 states and 15773 transitions. Second operand 7 states. [2019-09-08 06:50:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:06,699 INFO L93 Difference]: Finished difference Result 31488 states and 54744 transitions. [2019-09-08 06:50:06,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:50:06,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 390 [2019-09-08 06:50:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:06,842 INFO L225 Difference]: With dead ends: 31488 [2019-09-08 06:50:06,842 INFO L226 Difference]: Without dead ends: 21369 [2019-09-08 06:50:07,156 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:50:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21369 states. [2019-09-08 06:50:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21369 to 21293. [2019-09-08 06:50:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21293 states. [2019-09-08 06:50:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21293 states to 21293 states and 35718 transitions. [2019-09-08 06:50:10,181 INFO L78 Accepts]: Start accepts. Automaton has 21293 states and 35718 transitions. Word has length 390 [2019-09-08 06:50:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:10,182 INFO L475 AbstractCegarLoop]: Abstraction has 21293 states and 35718 transitions. [2019-09-08 06:50:10,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:50:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 21293 states and 35718 transitions. [2019-09-08 06:50:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-09-08 06:50:10,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:10,226 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, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:10,227 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:10,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:10,227 INFO L82 PathProgramCache]: Analyzing trace with hash -232358995, now seen corresponding path program 1 times [2019-09-08 06:50:10,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:10,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:10,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:10,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:10,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-09-08 06:50:10,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:10,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:50:10,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:50:10,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:50:10,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:50:10,377 INFO L87 Difference]: Start difference. First operand 21293 states and 35718 transitions. Second operand 4 states. [2019-09-08 06:50:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:12,411 INFO L93 Difference]: Finished difference Result 42542 states and 71367 transitions. [2019-09-08 06:50:12,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:50:12,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 422 [2019-09-08 06:50:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:12,507 INFO L225 Difference]: With dead ends: 42542 [2019-09-08 06:50:12,507 INFO L226 Difference]: Without dead ends: 21280 [2019-09-08 06:50:12,572 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:50:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21280 states. [2019-09-08 06:50:14,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21280 to 21280. [2019-09-08 06:50:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21280 states. [2019-09-08 06:50:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21280 states to 21280 states and 35691 transitions. [2019-09-08 06:50:14,766 INFO L78 Accepts]: Start accepts. Automaton has 21280 states and 35691 transitions. Word has length 422 [2019-09-08 06:50:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:14,767 INFO L475 AbstractCegarLoop]: Abstraction has 21280 states and 35691 transitions. [2019-09-08 06:50:14,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:50:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 21280 states and 35691 transitions. [2019-09-08 06:50:14,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 06:50:14,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:14,794 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:50:14,794 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:14,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:14,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1686324077, now seen corresponding path program 1 times [2019-09-08 06:50:14,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:14,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:14,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:14,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:14,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-08 06:50:14,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:50:14,955 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:50:14,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:15,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 2565 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:50:15,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:50:15,376 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:50:15,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:50:15,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:50:15,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:15,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:15,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:15,393 INFO L87 Difference]: Start difference. First operand 21280 states and 35691 transitions. Second operand 5 states. [2019-09-08 06:50:23,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:23,277 INFO L93 Difference]: Finished difference Result 84407 states and 171141 transitions. [2019-09-08 06:50:23,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:50:23,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 391 [2019-09-08 06:50:23,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:23,605 INFO L225 Difference]: With dead ends: 84407 [2019-09-08 06:50:23,605 INFO L226 Difference]: Without dead ends: 63158 [2019-09-08 06:50:23,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 395 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:50:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63158 states. [2019-09-08 06:50:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63158 to 62834. [2019-09-08 06:50:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62834 states. [2019-09-08 06:50:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62834 states to 62834 states and 115645 transitions. [2019-09-08 06:50:32,663 INFO L78 Accepts]: Start accepts. Automaton has 62834 states and 115645 transitions. Word has length 391 [2019-09-08 06:50:32,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:32,664 INFO L475 AbstractCegarLoop]: Abstraction has 62834 states and 115645 transitions. [2019-09-08 06:50:32,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:32,664 INFO L276 IsEmpty]: Start isEmpty. Operand 62834 states and 115645 transitions. [2019-09-08 06:50:32,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 06:50:32,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:32,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:32,712 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:32,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1499481810, now seen corresponding path program 1 times [2019-09-08 06:50:32,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:32,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:32,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:32,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:32,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-09-08 06:50:32,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:32,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:50:32,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:50:32,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:50:32,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:50:32,884 INFO L87 Difference]: Start difference. First operand 62834 states and 115645 transitions. Second operand 4 states. [2019-09-08 06:50:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:41,624 INFO L93 Difference]: Finished difference Result 125625 states and 231224 transitions. [2019-09-08 06:50:41,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:50:41,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 391 [2019-09-08 06:50:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:42,136 INFO L225 Difference]: With dead ends: 125625 [2019-09-08 06:50:42,136 INFO L226 Difference]: Without dead ends: 62822 [2019-09-08 06:50:42,503 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:50:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62822 states. [2019-09-08 06:50:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62822 to 62822. [2019-09-08 06:50:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62822 states. [2019-09-08 06:50:52,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62822 states to 62822 states and 115620 transitions. [2019-09-08 06:50:52,305 INFO L78 Accepts]: Start accepts. Automaton has 62822 states and 115620 transitions. Word has length 391 [2019-09-08 06:50:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:52,306 INFO L475 AbstractCegarLoop]: Abstraction has 62822 states and 115620 transitions. [2019-09-08 06:50:52,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:50:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 62822 states and 115620 transitions. [2019-09-08 06:50:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 06:50:52,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:52,350 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:50:52,350 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:52,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:52,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1658385226, now seen corresponding path program 1 times [2019-09-08 06:50:52,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:52,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:52,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:52,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:52,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:52,543 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:50:52,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:50:52,544 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:50:52,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:52,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 2566 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:50:52,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:50:52,969 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:50:52,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:50:52,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:50:52,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:50:52,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:50:52,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:50:52,977 INFO L87 Difference]: Start difference. First operand 62822 states and 115620 transitions. Second operand 7 states. [2019-09-08 06:51:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:10,415 INFO L93 Difference]: Finished difference Result 194162 states and 448062 transitions. [2019-09-08 06:51:10,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:10,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 392 [2019-09-08 06:51:10,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:11,377 INFO L225 Difference]: With dead ends: 194162 [2019-09-08 06:51:11,377 INFO L226 Difference]: Without dead ends: 131371 [2019-09-08 06:51:12,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 393 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:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131371 states. [2019-09-08 06:51:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131371 to 130935. [2019-09-08 06:51:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130935 states. [2019-09-08 06:51:35,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130935 states to 130935 states and 280854 transitions. [2019-09-08 06:51:35,600 INFO L78 Accepts]: Start accepts. Automaton has 130935 states and 280854 transitions. Word has length 392 [2019-09-08 06:51:35,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:35,600 INFO L475 AbstractCegarLoop]: Abstraction has 130935 states and 280854 transitions. [2019-09-08 06:51:35,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 130935 states and 280854 transitions. [2019-09-08 06:51:35,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-09-08 06:51:35,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:35,707 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:35,707 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:35,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:35,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1812827599, now seen corresponding path program 1 times [2019-09-08 06:51:35,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:35,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:35,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:35,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:35,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:35,892 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:35,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:35,892 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:51:35,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:36,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 2716 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:36,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 06:51:37,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:37,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:51:37,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:37,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:37,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:37,099 INFO L87 Difference]: Start difference. First operand 130935 states and 280854 transitions. Second operand 5 states. [2019-09-08 06:52:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:52:42,282 INFO L93 Difference]: Finished difference Result 465985 states and 1273203 transitions. [2019-09-08 06:52:42,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:52:42,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 426 [2019-09-08 06:52:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:52:44,486 INFO L225 Difference]: With dead ends: 465985 [2019-09-08 06:52:44,487 INFO L226 Difference]: Without dead ends: 335091 [2019-09-08 06:52:57,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 428 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:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335091 states. [2019-09-08 06:54:22,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335091 to 334439. [2019-09-08 06:54:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334439 states. [2019-09-08 06:54:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334439 states to 334439 states and 775433 transitions. [2019-09-08 06:54:28,995 INFO L78 Accepts]: Start accepts. Automaton has 334439 states and 775433 transitions. Word has length 426 [2019-09-08 06:54:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:28,995 INFO L475 AbstractCegarLoop]: Abstraction has 334439 states and 775433 transitions. [2019-09-08 06:54:28,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 334439 states and 775433 transitions. [2019-09-08 06:54:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-09-08 06:54:29,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:29,554 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:29,554 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:29,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:29,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1335318132, now seen corresponding path program 1 times [2019-09-08 06:54:29,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:29,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:29,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:29,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:29,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-08 06:54:29,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:29,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:29,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:29,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:29,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:29,743 INFO L87 Difference]: Start difference. First operand 334439 states and 775433 transitions. Second operand 4 states. [2019-09-08 06:55:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:45,177 INFO L93 Difference]: Finished difference Result 668836 states and 1550803 transitions. [2019-09-08 06:55:45,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:55:45,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-09-08 06:55:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:02,354 INFO L225 Difference]: With dead ends: 668836 [2019-09-08 06:56:02,355 INFO L226 Difference]: Without dead ends: 334428 [2019-09-08 06:56:08,620 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:56:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334428 states.