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.05.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:39:11,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:39:11,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:39:11,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:39:11,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:39:11,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:39:11,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:39:11,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:39:11,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:39:11,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:39:11,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:39:11,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:39:11,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:39:11,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:39:11,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:39:11,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:39:11,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:39:11,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:39:11,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:39:11,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:39:11,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:39:11,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:39:11,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:39:11,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:39:11,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:39:11,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:39:11,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:39:11,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:39:11,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:39:11,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:39:11,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:39:11,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:39:11,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:39:11,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:39:11,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:39:11,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:39:11,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:39:11,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:39:11,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:39:11,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:39:11,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:39:11,796 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:39:11,810 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:39:11,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:39:11,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:39:11,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:39:11,813 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:39:11,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:39:11,813 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:39:11,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:39:11,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:39:11,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:39:11,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:39:11,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:39:11,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:39:11,815 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:39:11,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:39:11,815 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:39:11,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:39:11,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:39:11,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:39:11,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:39:11,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:39:11,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:39:11,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:39:11,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:39:11,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:39:11,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:39:11,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:39:11,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:39:11,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:39:11,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:39:11,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:39:11,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:39:11,874 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:39:11,874 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:39:11,875 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.05.cil-1.c [2019-09-08 06:39:11,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c472943d4/562a85549fe448d294e275e047937124/FLAGb6e3eacad [2019-09-08 06:39:12,551 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:39:12,555 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.05.cil-1.c [2019-09-08 06:39:12,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c472943d4/562a85549fe448d294e275e047937124/FLAGb6e3eacad [2019-09-08 06:39:12,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c472943d4/562a85549fe448d294e275e047937124 [2019-09-08 06:39:12,871 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:39:12,873 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:39:12,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:39:12,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:39:12,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:39:12,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:39:12" (1/1) ... [2019-09-08 06:39:12,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67fb264b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:12, skipping insertion in model container [2019-09-08 06:39:12,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:39:12" (1/1) ... [2019-09-08 06:39:12,889 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:39:12,935 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:39:13,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:39:13,301 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:39:13,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:39:13,392 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:39:13,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:13 WrapperNode [2019-09-08 06:39:13,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:39:13,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:39:13,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:39:13,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:39:13,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:13" (1/1) ... [2019-09-08 06:39:13,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:13" (1/1) ... [2019-09-08 06:39:13,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:13" (1/1) ... [2019-09-08 06:39:13,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:13" (1/1) ... [2019-09-08 06:39:13,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:13" (1/1) ... [2019-09-08 06:39:13,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:13" (1/1) ... [2019-09-08 06:39:13,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:13" (1/1) ... [2019-09-08 06:39:13,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:39:13,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:39:13,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:39:13,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:39:13,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:13" (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:39:13,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:39:13,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:39:13,507 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:39:13,507 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:39:13,507 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:39:13,508 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:39:13,508 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:39:13,508 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:39:13,508 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:39:13,508 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:39:13,509 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:39:13,509 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:39:13,509 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:39:13,509 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:39:13,509 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:39:13,509 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:39:13,510 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:39:13,510 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:39:13,510 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:39:13,510 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:39:13,510 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:39:13,511 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:39:13,511 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:39:13,511 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:39:13,511 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:39:13,511 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:39:13,512 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:39:13,512 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:39:13,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:39:13,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:39:13,512 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:39:13,512 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:39:13,513 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:39:13,513 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:39:13,513 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:39:13,513 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:39:13,513 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:39:13,513 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:39:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:39:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:39:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:39:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:39:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:39:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:39:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:39:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:39:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:39:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:39:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:39:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:39:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:39:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:39:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:39:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:39:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:39:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:39:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:39:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:39:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:39:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:39:14,408 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:39:14,408 INFO L283 CfgBuilder]: Removed 8 assume(true) statements. [2019-09-08 06:39:14,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:39:14 BoogieIcfgContainer [2019-09-08 06:39:14,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:39:14,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:39:14,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:39:14,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:39:14,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:39:12" (1/3) ... [2019-09-08 06:39:14,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679c960b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:39:14, skipping insertion in model container [2019-09-08 06:39:14,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:13" (2/3) ... [2019-09-08 06:39:14,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679c960b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:39:14, skipping insertion in model container [2019-09-08 06:39:14,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:39:14" (3/3) ... [2019-09-08 06:39:14,424 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.05.cil-1.c [2019-09-08 06:39:14,435 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:39:14,450 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:39:14,466 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:39:14,502 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:39:14,503 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:39:14,504 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:39:14,504 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:39:14,505 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:39:14,505 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:39:14,505 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:39:14,505 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:39:14,506 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:39:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states. [2019-09-08 06:39:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 06:39:14,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:14,554 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] [2019-09-08 06:39:14,557 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:14,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:14,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1265062230, now seen corresponding path program 1 times [2019-09-08 06:39:14,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:14,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:14,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:14,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:14,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:14,984 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:39:14,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:14,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:39:14,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:39:15,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:39:15,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:39:15,011 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 4 states. [2019-09-08 06:39:15,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:15,342 INFO L93 Difference]: Finished difference Result 507 states and 755 transitions. [2019-09-08 06:39:15,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:39:15,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-08 06:39:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:15,360 INFO L225 Difference]: With dead ends: 507 [2019-09-08 06:39:15,360 INFO L226 Difference]: Without dead ends: 255 [2019-09-08 06:39:15,368 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:39:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-08 06:39:15,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-09-08 06:39:15,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 06:39:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 360 transitions. [2019-09-08 06:39:15,442 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 360 transitions. Word has length 133 [2019-09-08 06:39:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:15,444 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 360 transitions. [2019-09-08 06:39:15,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:39:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 360 transitions. [2019-09-08 06:39:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 06:39:15,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:15,449 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] [2019-09-08 06:39:15,449 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:15,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:15,450 INFO L82 PathProgramCache]: Analyzing trace with hash -462082732, now seen corresponding path program 1 times [2019-09-08 06:39:15,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:15,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:15,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:15,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:15,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:15,663 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:39:15,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:15,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:15,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:15,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:15,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:15,667 INFO L87 Difference]: Start difference. First operand 255 states and 360 transitions. Second operand 5 states. [2019-09-08 06:39:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:16,449 INFO L93 Difference]: Finished difference Result 529 states and 768 transitions. [2019-09-08 06:39:16,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:16,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-08 06:39:16,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:16,454 INFO L225 Difference]: With dead ends: 529 [2019-09-08 06:39:16,454 INFO L226 Difference]: Without dead ends: 297 [2019-09-08 06:39:16,457 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:39:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-08 06:39:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 255. [2019-09-08 06:39:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 06:39:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 359 transitions. [2019-09-08 06:39:16,489 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 359 transitions. Word has length 133 [2019-09-08 06:39:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:16,489 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 359 transitions. [2019-09-08 06:39:16,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 359 transitions. [2019-09-08 06:39:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 06:39:16,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:16,493 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] [2019-09-08 06:39:16,493 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:16,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:16,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1859719186, now seen corresponding path program 1 times [2019-09-08 06:39:16,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:16,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:16,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:16,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:16,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:16,703 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:39:16,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:16,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:16,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:16,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:16,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:16,706 INFO L87 Difference]: Start difference. First operand 255 states and 359 transitions. Second operand 5 states. [2019-09-08 06:39:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:17,339 INFO L93 Difference]: Finished difference Result 529 states and 767 transitions. [2019-09-08 06:39:17,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:17,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-08 06:39:17,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:17,343 INFO L225 Difference]: With dead ends: 529 [2019-09-08 06:39:17,343 INFO L226 Difference]: Without dead ends: 297 [2019-09-08 06:39:17,344 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:39:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-08 06:39:17,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 255. [2019-09-08 06:39:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 06:39:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 358 transitions. [2019-09-08 06:39:17,372 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 358 transitions. Word has length 133 [2019-09-08 06:39:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:17,372 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 358 transitions. [2019-09-08 06:39:17,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 358 transitions. [2019-09-08 06:39:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 06:39:17,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:17,376 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] [2019-09-08 06:39:17,376 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:17,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:17,377 INFO L82 PathProgramCache]: Analyzing trace with hash -282141292, now seen corresponding path program 1 times [2019-09-08 06:39:17,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:17,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:17,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:17,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:17,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:17,464 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:39:17,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:17,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:17,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:17,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:17,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:17,466 INFO L87 Difference]: Start difference. First operand 255 states and 358 transitions. Second operand 5 states. [2019-09-08 06:39:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:18,043 INFO L93 Difference]: Finished difference Result 527 states and 761 transitions. [2019-09-08 06:39:18,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:18,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-08 06:39:18,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:18,047 INFO L225 Difference]: With dead ends: 527 [2019-09-08 06:39:18,047 INFO L226 Difference]: Without dead ends: 295 [2019-09-08 06:39:18,049 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:39:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-08 06:39:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 255. [2019-09-08 06:39:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 06:39:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 357 transitions. [2019-09-08 06:39:18,073 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 357 transitions. Word has length 133 [2019-09-08 06:39:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:18,073 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 357 transitions. [2019-09-08 06:39:18,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:18,073 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 357 transitions. [2019-09-08 06:39:18,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 06:39:18,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:18,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:18,076 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:18,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:18,077 INFO L82 PathProgramCache]: Analyzing trace with hash -905422894, now seen corresponding path program 1 times [2019-09-08 06:39:18,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:18,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:18,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:18,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:18,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:18,159 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:39:18,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:18,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:18,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:18,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:18,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:18,162 INFO L87 Difference]: Start difference. First operand 255 states and 357 transitions. Second operand 5 states. [2019-09-08 06:39:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:18,726 INFO L93 Difference]: Finished difference Result 525 states and 755 transitions. [2019-09-08 06:39:18,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:18,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-08 06:39:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:18,729 INFO L225 Difference]: With dead ends: 525 [2019-09-08 06:39:18,729 INFO L226 Difference]: Without dead ends: 293 [2019-09-08 06:39:18,731 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:39:18,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-08 06:39:18,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 255. [2019-09-08 06:39:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 06:39:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 356 transitions. [2019-09-08 06:39:18,758 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 356 transitions. Word has length 133 [2019-09-08 06:39:18,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:18,759 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 356 transitions. [2019-09-08 06:39:18,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 356 transitions. [2019-09-08 06:39:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 06:39:18,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:18,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] [2019-09-08 06:39:18,763 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash -786981420, now seen corresponding path program 1 times [2019-09-08 06:39:18,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:18,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:18,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:18,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:18,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:18,869 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:39:18,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:18,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:18,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:18,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:18,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:18,871 INFO L87 Difference]: Start difference. First operand 255 states and 356 transitions. Second operand 5 states. [2019-09-08 06:39:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:19,446 INFO L93 Difference]: Finished difference Result 521 states and 745 transitions. [2019-09-08 06:39:19,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:19,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-08 06:39:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:19,450 INFO L225 Difference]: With dead ends: 521 [2019-09-08 06:39:19,450 INFO L226 Difference]: Without dead ends: 289 [2019-09-08 06:39:19,451 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:39:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-08 06:39:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 255. [2019-09-08 06:39:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 06:39:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 355 transitions. [2019-09-08 06:39:19,476 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 355 transitions. Word has length 133 [2019-09-08 06:39:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:19,476 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 355 transitions. [2019-09-08 06:39:19,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 355 transitions. [2019-09-08 06:39:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 06:39:19,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:19,479 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] [2019-09-08 06:39:19,479 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:19,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1474591830, now seen corresponding path program 1 times [2019-09-08 06:39:19,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:19,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:19,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:19,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:19,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:19,580 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:39:19,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:19,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:19,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:19,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:19,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:19,582 INFO L87 Difference]: Start difference. First operand 255 states and 355 transitions. Second operand 5 states. [2019-09-08 06:39:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:20,193 INFO L93 Difference]: Finished difference Result 547 states and 789 transitions. [2019-09-08 06:39:20,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:20,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-08 06:39:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:20,198 INFO L225 Difference]: With dead ends: 547 [2019-09-08 06:39:20,198 INFO L226 Difference]: Without dead ends: 315 [2019-09-08 06:39:20,200 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:39:20,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-08 06:39:20,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 255. [2019-09-08 06:39:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 06:39:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 354 transitions. [2019-09-08 06:39:20,225 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 354 transitions. Word has length 133 [2019-09-08 06:39:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:20,225 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 354 transitions. [2019-09-08 06:39:20,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 354 transitions. [2019-09-08 06:39:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 06:39:20,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:20,228 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] [2019-09-08 06:39:20,228 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash -392116844, now seen corresponding path program 1 times [2019-09-08 06:39:20,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:20,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:20,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:20,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:20,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:20,298 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:39:20,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:20,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:20,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:20,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:20,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:20,300 INFO L87 Difference]: Start difference. First operand 255 states and 354 transitions. Second operand 5 states. [2019-09-08 06:39:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:20,835 INFO L93 Difference]: Finished difference Result 541 states and 778 transitions. [2019-09-08 06:39:20,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:20,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-08 06:39:20,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:20,838 INFO L225 Difference]: With dead ends: 541 [2019-09-08 06:39:20,839 INFO L226 Difference]: Without dead ends: 309 [2019-09-08 06:39:20,840 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:39:20,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-08 06:39:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 255. [2019-09-08 06:39:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 06:39:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 353 transitions. [2019-09-08 06:39:20,865 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 353 transitions. Word has length 133 [2019-09-08 06:39:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:20,865 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 353 transitions. [2019-09-08 06:39:20,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 353 transitions. [2019-09-08 06:39:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 06:39:20,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:20,867 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] [2019-09-08 06:39:20,868 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:20,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:20,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1699259242, now seen corresponding path program 1 times [2019-09-08 06:39:20,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:20,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:20,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:20,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:20,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:20,949 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:39:20,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:20,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:20,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:20,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:20,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:20,951 INFO L87 Difference]: Start difference. First operand 255 states and 353 transitions. Second operand 5 states. [2019-09-08 06:39:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:21,496 INFO L93 Difference]: Finished difference Result 543 states and 777 transitions. [2019-09-08 06:39:21,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:21,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-08 06:39:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:21,499 INFO L225 Difference]: With dead ends: 543 [2019-09-08 06:39:21,499 INFO L226 Difference]: Without dead ends: 311 [2019-09-08 06:39:21,501 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:39:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-08 06:39:21,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 255. [2019-09-08 06:39:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 06:39:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 352 transitions. [2019-09-08 06:39:21,524 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 352 transitions. Word has length 133 [2019-09-08 06:39:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:21,525 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 352 transitions. [2019-09-08 06:39:21,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 352 transitions. [2019-09-08 06:39:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 06:39:21,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:21,527 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] [2019-09-08 06:39:21,527 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash 198237524, now seen corresponding path program 1 times [2019-09-08 06:39:21,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:21,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:21,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:21,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:21,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:21,597 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:39:21,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:21,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:21,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:21,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:21,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:21,599 INFO L87 Difference]: Start difference. First operand 255 states and 352 transitions. Second operand 5 states. [2019-09-08 06:39:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:22,138 INFO L93 Difference]: Finished difference Result 541 states and 771 transitions. [2019-09-08 06:39:22,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:22,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-08 06:39:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:22,142 INFO L225 Difference]: With dead ends: 541 [2019-09-08 06:39:22,142 INFO L226 Difference]: Without dead ends: 309 [2019-09-08 06:39:22,143 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:39:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-08 06:39:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 255. [2019-09-08 06:39:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 06:39:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 351 transitions. [2019-09-08 06:39:22,169 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 351 transitions. Word has length 133 [2019-09-08 06:39:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:22,169 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 351 transitions. [2019-09-08 06:39:22,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 351 transitions. [2019-09-08 06:39:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 06:39:22,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:22,172 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] [2019-09-08 06:39:22,172 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:22,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:22,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1229278422, now seen corresponding path program 1 times [2019-09-08 06:39:22,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:22,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:22,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:22,266 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:39:22,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:22,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:22,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:22,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:22,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:22,268 INFO L87 Difference]: Start difference. First operand 255 states and 351 transitions. Second operand 5 states. [2019-09-08 06:39:22,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:22,848 INFO L93 Difference]: Finished difference Result 539 states and 765 transitions. [2019-09-08 06:39:22,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:22,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-08 06:39:22,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:22,851 INFO L225 Difference]: With dead ends: 539 [2019-09-08 06:39:22,853 INFO L226 Difference]: Without dead ends: 307 [2019-09-08 06:39:22,855 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:39:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-08 06:39:22,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 255. [2019-09-08 06:39:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 06:39:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 350 transitions. [2019-09-08 06:39:22,886 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 350 transitions. Word has length 133 [2019-09-08 06:39:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:22,887 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 350 transitions. [2019-09-08 06:39:22,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 350 transitions. [2019-09-08 06:39:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 06:39:22,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:22,889 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] [2019-09-08 06:39:22,889 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:22,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:22,889 INFO L82 PathProgramCache]: Analyzing trace with hash -677124844, now seen corresponding path program 1 times [2019-09-08 06:39:22,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:22,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:22,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:22,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:39:22,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:22,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:22,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:22,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:22,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:22,968 INFO L87 Difference]: Start difference. First operand 255 states and 350 transitions. Second operand 5 states. [2019-09-08 06:39:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:23,488 INFO L93 Difference]: Finished difference Result 537 states and 759 transitions. [2019-09-08 06:39:23,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:23,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-08 06:39:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:23,493 INFO L225 Difference]: With dead ends: 537 [2019-09-08 06:39:23,493 INFO L226 Difference]: Without dead ends: 305 [2019-09-08 06:39:23,494 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:39:23,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-08 06:39:23,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 255. [2019-09-08 06:39:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 06:39:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 349 transitions. [2019-09-08 06:39:23,525 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 349 transitions. Word has length 133 [2019-09-08 06:39:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:23,526 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 349 transitions. [2019-09-08 06:39:23,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 349 transitions. [2019-09-08 06:39:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 06:39:23,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:23,531 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] [2019-09-08 06:39:23,531 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:23,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:23,532 INFO L82 PathProgramCache]: Analyzing trace with hash 923946262, now seen corresponding path program 1 times [2019-09-08 06:39:23,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:23,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:23,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:23,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:23,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:23,614 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:39:23,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:23,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:39:23,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:39:23,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:39:23,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:39:23,617 INFO L87 Difference]: Start difference. First operand 255 states and 349 transitions. Second operand 4 states. [2019-09-08 06:39:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:23,914 INFO L93 Difference]: Finished difference Result 709 states and 1010 transitions. [2019-09-08 06:39:23,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:39:23,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-08 06:39:23,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:23,920 INFO L225 Difference]: With dead ends: 709 [2019-09-08 06:39:23,920 INFO L226 Difference]: Without dead ends: 478 [2019-09-08 06:39:23,922 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:39:23,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-08 06:39:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 477. [2019-09-08 06:39:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-09-08 06:39:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 652 transitions. [2019-09-08 06:39:23,976 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 652 transitions. Word has length 133 [2019-09-08 06:39:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:23,977 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 652 transitions. [2019-09-08 06:39:23,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:39:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 652 transitions. [2019-09-08 06:39:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 06:39:23,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:23,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:23,983 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:23,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:23,983 INFO L82 PathProgramCache]: Analyzing trace with hash -77668731, now seen corresponding path program 1 times [2019-09-08 06:39:23,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:23,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:23,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:23,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:23,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-08 06:39:24,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:24,090 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) [2019-09-08 06:39:24,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:39:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:24,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:39:24,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:39:24,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:39:24,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:39:24,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:39:24,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:39:24,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:39:24,478 INFO L87 Difference]: Start difference. First operand 477 states and 652 transitions. Second operand 7 states. [2019-09-08 06:39:24,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:24,728 INFO L93 Difference]: Finished difference Result 1411 states and 2053 transitions. [2019-09-08 06:39:24,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:39:24,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 217 [2019-09-08 06:39:24,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:24,736 INFO L225 Difference]: With dead ends: 1411 [2019-09-08 06:39:24,736 INFO L226 Difference]: Without dead ends: 958 [2019-09-08 06:39:24,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 218 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:39:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2019-09-08 06:39:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 915. [2019-09-08 06:39:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2019-09-08 06:39:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1284 transitions. [2019-09-08 06:39:24,839 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1284 transitions. Word has length 217 [2019-09-08 06:39:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:24,840 INFO L475 AbstractCegarLoop]: Abstraction has 915 states and 1284 transitions. [2019-09-08 06:39:24,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:39:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1284 transitions. [2019-09-08 06:39:24,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 06:39:24,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:24,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:24,845 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:24,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:24,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1115635779, now seen corresponding path program 1 times [2019-09-08 06:39:24,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:24,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:24,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:24,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:24,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 06:39:24,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:24,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:39:24,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:39:24,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:39:24,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:39:24,919 INFO L87 Difference]: Start difference. First operand 915 states and 1284 transitions. Second operand 4 states. [2019-09-08 06:39:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:25,121 INFO L93 Difference]: Finished difference Result 1797 states and 2520 transitions. [2019-09-08 06:39:25,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:39:25,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-09-08 06:39:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:25,128 INFO L225 Difference]: With dead ends: 1797 [2019-09-08 06:39:25,128 INFO L226 Difference]: Without dead ends: 906 [2019-09-08 06:39:25,132 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:39:25,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-09-08 06:39:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2019-09-08 06:39:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-08 06:39:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1267 transitions. [2019-09-08 06:39:25,215 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1267 transitions. Word has length 217 [2019-09-08 06:39:25,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:25,216 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1267 transitions. [2019-09-08 06:39:25,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:39:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1267 transitions. [2019-09-08 06:39:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-08 06:39:25,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:25,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:25,221 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:25,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1795813635, now seen corresponding path program 1 times [2019-09-08 06:39:25,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:25,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:25,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:25,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:25,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 06:39:25,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:25,309 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:39:25,331 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:39:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:25,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:39:25,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 06:39:25,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:39:25,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:39:25,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:39:25,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:39:25,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:39:25,599 INFO L87 Difference]: Start difference. First operand 906 states and 1267 transitions. Second operand 7 states. [2019-09-08 06:39:25,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:25,850 INFO L93 Difference]: Finished difference Result 2735 states and 4088 transitions. [2019-09-08 06:39:25,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:39:25,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 218 [2019-09-08 06:39:25,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:25,865 INFO L225 Difference]: With dead ends: 2735 [2019-09-08 06:39:25,865 INFO L226 Difference]: Without dead ends: 1853 [2019-09-08 06:39:25,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 219 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:39:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-09-08 06:39:26,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1838. [2019-09-08 06:39:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-09-08 06:39:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2686 transitions. [2019-09-08 06:39:26,126 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2686 transitions. Word has length 218 [2019-09-08 06:39:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:26,126 INFO L475 AbstractCegarLoop]: Abstraction has 1838 states and 2686 transitions. [2019-09-08 06:39:26,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:39:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2686 transitions. [2019-09-08 06:39:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 06:39:26,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:26,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:26,135 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:26,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1374118170, now seen corresponding path program 1 times [2019-09-08 06:39:26,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:26,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:26,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:26,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:26,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 06:39:26,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:26,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:39:26,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:26,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:39:26,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:39:26,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:39:26,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:39:26,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:26,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:26,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:26,646 INFO L87 Difference]: Start difference. First operand 1838 states and 2686 transitions. Second operand 5 states. [2019-09-08 06:39:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:27,967 INFO L93 Difference]: Finished difference Result 8844 states and 14688 transitions. [2019-09-08 06:39:27,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:39:27,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 241 [2019-09-08 06:39:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:28,026 INFO L225 Difference]: With dead ends: 8844 [2019-09-08 06:39:28,026 INFO L226 Difference]: Without dead ends: 7037 [2019-09-08 06:39:28,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 243 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:39:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7037 states. [2019-09-08 06:39:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7037 to 7010. [2019-09-08 06:39:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7010 states. [2019-09-08 06:39:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7010 states to 7010 states and 10658 transitions. [2019-09-08 06:39:28,800 INFO L78 Accepts]: Start accepts. Automaton has 7010 states and 10658 transitions. Word has length 241 [2019-09-08 06:39:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:28,800 INFO L475 AbstractCegarLoop]: Abstraction has 7010 states and 10658 transitions. [2019-09-08 06:39:28,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 7010 states and 10658 transitions. [2019-09-08 06:39:28,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-08 06:39:28,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:28,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:28,816 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:28,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:28,816 INFO L82 PathProgramCache]: Analyzing trace with hash -2060158120, now seen corresponding path program 1 times [2019-09-08 06:39:28,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:28,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:28,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:28,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:28,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:28,891 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-08 06:39:28,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:28,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:39:28,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:39:28,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:39:28,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:39:28,893 INFO L87 Difference]: Start difference. First operand 7010 states and 10658 transitions. Second operand 4 states. [2019-09-08 06:39:29,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:29,674 INFO L93 Difference]: Finished difference Result 12263 states and 18489 transitions. [2019-09-08 06:39:29,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:39:29,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-09-08 06:39:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:29,729 INFO L225 Difference]: With dead ends: 12263 [2019-09-08 06:39:29,729 INFO L226 Difference]: Without dead ends: 5286 [2019-09-08 06:39:29,793 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:39:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5286 states. [2019-09-08 06:39:30,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5286 to 5286. [2019-09-08 06:39:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5286 states. [2019-09-08 06:39:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 7876 transitions. [2019-09-08 06:39:30,481 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 7876 transitions. Word has length 218 [2019-09-08 06:39:30,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:30,481 INFO L475 AbstractCegarLoop]: Abstraction has 5286 states and 7876 transitions. [2019-09-08 06:39:30,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:39:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 7876 transitions. [2019-09-08 06:39:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 06:39:30,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:30,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:30,491 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:30,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:30,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1025993817, now seen corresponding path program 1 times [2019-09-08 06:39:30,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:30,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:30,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:30,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:30,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 06:39:30,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:30,586 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:39:30,608 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:39:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:30,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:39:30,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream closed [2019-09-08 06:39:30,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:39:30,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:39:30,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:39:30,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:39:30,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:39:30,842 INFO L87 Difference]: Start difference. First operand 5286 states and 7876 transitions. Second operand 7 states. [2019-09-08 06:39:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:32,393 INFO L93 Difference]: Finished difference Result 16064 states and 27025 transitions. [2019-09-08 06:39:32,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:39:32,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 219 [2019-09-08 06:39:32,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:32,501 INFO L225 Difference]: With dead ends: 16064 [2019-09-08 06:39:32,501 INFO L226 Difference]: Without dead ends: 10811 [2019-09-08 06:39:32,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 220 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:39:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10811 states. [2019-09-08 06:39:34,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10811 to 10736. [2019-09-08 06:39:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10736 states. [2019-09-08 06:39:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10736 states to 10736 states and 17340 transitions. [2019-09-08 06:39:34,292 INFO L78 Accepts]: Start accepts. Automaton has 10736 states and 17340 transitions. Word has length 219 [2019-09-08 06:39:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:34,292 INFO L475 AbstractCegarLoop]: Abstraction has 10736 states and 17340 transitions. [2019-09-08 06:39:34,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:39:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 10736 states and 17340 transitions. [2019-09-08 06:39:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 06:39:34,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:34,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:34,312 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:34,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:34,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1365718734, now seen corresponding path program 1 times [2019-09-08 06:39:34,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:34,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:34,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:34,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:34,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-08 06:39:34,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:34,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:39:34,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:39:34,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:39:34,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:39:34,390 INFO L87 Difference]: Start difference. First operand 10736 states and 17340 transitions. Second operand 4 states. [2019-09-08 06:39:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:35,425 INFO L93 Difference]: Finished difference Result 19865 states and 31643 transitions. [2019-09-08 06:39:35,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:39:35,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2019-09-08 06:39:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:35,482 INFO L225 Difference]: With dead ends: 19865 [2019-09-08 06:39:35,483 INFO L226 Difference]: Without dead ends: 9161 [2019-09-08 06:39:35,521 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:39:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9161 states. [2019-09-08 06:39:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9161 to 9161. [2019-09-08 06:39:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9161 states. [2019-09-08 06:39:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9161 states to 9161 states and 14349 transitions. [2019-09-08 06:39:36,542 INFO L78 Accepts]: Start accepts. Automaton has 9161 states and 14349 transitions. Word has length 244 [2019-09-08 06:39:36,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:36,543 INFO L475 AbstractCegarLoop]: Abstraction has 9161 states and 14349 transitions. [2019-09-08 06:39:36,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:39:36,543 INFO L276 IsEmpty]: Start isEmpty. Operand 9161 states and 14349 transitions. [2019-09-08 06:39:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 06:39:36,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:36,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:36,562 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:36,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:36,563 INFO L82 PathProgramCache]: Analyzing trace with hash -368878831, now seen corresponding path program 1 times [2019-09-08 06:39:36,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:36,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:36,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 06:39:36,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:36,660 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) [2019-09-08 06:39:36,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:39:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:36,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:39:36,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 06:39:36,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:39:36,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:39:36,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:36,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:36,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:36,911 INFO L87 Difference]: Start difference. First operand 9161 states and 14349 transitions. Second operand 5 states. [2019-09-08 06:39:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:40,321 INFO L93 Difference]: Finished difference Result 44825 states and 89099 transitions. [2019-09-08 06:39:40,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:39:40,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2019-09-08 06:39:40,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:40,561 INFO L225 Difference]: With dead ends: 44825 [2019-09-08 06:39:40,561 INFO L226 Difference]: Without dead ends: 35694 [2019-09-08 06:39:40,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 248 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:39:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35694 states. [2019-09-08 06:39:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35694 to 35397. [2019-09-08 06:39:44,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35397 states. [2019-09-08 06:39:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35397 states to 35397 states and 63630 transitions. [2019-09-08 06:39:45,083 INFO L78 Accepts]: Start accepts. Automaton has 35397 states and 63630 transitions. Word has length 244 [2019-09-08 06:39:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:45,084 INFO L475 AbstractCegarLoop]: Abstraction has 35397 states and 63630 transitions. [2019-09-08 06:39:45,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 35397 states and 63630 transitions. [2019-09-08 06:39:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 06:39:45,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:45,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:45,149 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:45,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:45,150 INFO L82 PathProgramCache]: Analyzing trace with hash -326092545, now seen corresponding path program 1 times [2019-09-08 06:39:45,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:45,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:45,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:45,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:45,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 06:39:45,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:45,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:39:45,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:39:45,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:39:45,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:39:45,218 INFO L87 Difference]: Start difference. First operand 35397 states and 63630 transitions. Second operand 4 states. [2019-09-08 06:39:48,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:48,005 INFO L93 Difference]: Finished difference Result 62080 states and 109809 transitions. [2019-09-08 06:39:48,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:39:48,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-09-08 06:39:48,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:48,121 INFO L225 Difference]: With dead ends: 62080 [2019-09-08 06:39:48,122 INFO L226 Difference]: Without dead ends: 26707 [2019-09-08 06:39:48,335 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:39:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26707 states. [2019-09-08 06:39:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26707 to 26707. [2019-09-08 06:39:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26707 states. [2019-09-08 06:39:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26707 states to 26707 states and 46208 transitions. [2019-09-08 06:39:52,225 INFO L78 Accepts]: Start accepts. Automaton has 26707 states and 46208 transitions. Word has length 220 [2019-09-08 06:39:52,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:52,226 INFO L475 AbstractCegarLoop]: Abstraction has 26707 states and 46208 transitions. [2019-09-08 06:39:52,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:39:52,226 INFO L276 IsEmpty]: Start isEmpty. Operand 26707 states and 46208 transitions. [2019-09-08 06:39:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 06:39:52,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:52,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:52,259 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:52,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:52,259 INFO L82 PathProgramCache]: Analyzing trace with hash 688555523, now seen corresponding path program 1 times [2019-09-08 06:39:52,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:52,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:52,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:52,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:52,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 06:39:52,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:52,340 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:39:52,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:52,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:39:52,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 06:39:52,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:39:52,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:39:52,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:39:52,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:39:52,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:39:52,560 INFO L87 Difference]: Start difference. First operand 26707 states and 46208 transitions. Second operand 7 states. [2019-09-08 06:39:56,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:56,131 INFO L93 Difference]: Finished difference Result 82085 states and 180619 transitions. [2019-09-08 06:39:56,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:39:56,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 221 [2019-09-08 06:39:56,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:56,400 INFO L225 Difference]: With dead ends: 82085 [2019-09-08 06:39:56,400 INFO L226 Difference]: Without dead ends: 55402 [2019-09-08 06:39:56,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 222 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:39:56,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55402 states. [2019-09-08 06:40:03,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55402 to 55075. [2019-09-08 06:40:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55075 states. [2019-09-08 06:40:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55075 states to 55075 states and 112893 transitions. [2019-09-08 06:40:03,587 INFO L78 Accepts]: Start accepts. Automaton has 55075 states and 112893 transitions. Word has length 221 [2019-09-08 06:40:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:03,588 INFO L475 AbstractCegarLoop]: Abstraction has 55075 states and 112893 transitions. [2019-09-08 06:40:03,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:40:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 55075 states and 112893 transitions. [2019-09-08 06:40:03,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 06:40:03,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:03,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:03,633 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:03,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:03,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1659003201, now seen corresponding path program 1 times [2019-09-08 06:40:03,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:03,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:03,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:03,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:03,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 06:40:03,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:40:03,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:40:03,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:40:03,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:40:03,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:40:03,700 INFO L87 Difference]: Start difference. First operand 55075 states and 112893 transitions. Second operand 4 states. [2019-09-08 06:40:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:10,130 INFO L93 Difference]: Finished difference Result 110121 states and 225746 transitions. [2019-09-08 06:40:10,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:40:10,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-09-08 06:40:10,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:10,375 INFO L225 Difference]: With dead ends: 110121 [2019-09-08 06:40:10,376 INFO L226 Difference]: Without dead ends: 55070 [2019-09-08 06:40:10,611 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:40:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55070 states. [2019-09-08 06:40:15,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55070 to 55070. [2019-09-08 06:40:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55070 states. [2019-09-08 06:40:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55070 states to 55070 states and 112881 transitions. [2019-09-08 06:40:15,884 INFO L78 Accepts]: Start accepts. Automaton has 55070 states and 112881 transitions. Word has length 221 [2019-09-08 06:40:15,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:15,884 INFO L475 AbstractCegarLoop]: Abstraction has 55070 states and 112881 transitions. [2019-09-08 06:40:15,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:40:15,885 INFO L276 IsEmpty]: Start isEmpty. Operand 55070 states and 112881 transitions. [2019-09-08 06:40:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 06:40:15,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:15,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:15,928 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:15,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1294707201, now seen corresponding path program 1 times [2019-09-08 06:40:15,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:15,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:15,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:15,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:15,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 06:40:16,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:40:16,015 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) [2019-09-08 06:40:16,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:40:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:16,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 1278 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:40:16,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:40:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 06:40:16,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:40:16,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:40:16,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:40:16,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:40:16,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:40:16,217 INFO L87 Difference]: Start difference. First operand 55070 states and 112881 transitions. Second operand 7 states. [2019-09-08 06:40:23,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:23,685 INFO L93 Difference]: Finished difference Result 122844 states and 285654 transitions. [2019-09-08 06:40:23,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:40:23,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 222 [2019-09-08 06:40:23,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:24,071 INFO L225 Difference]: With dead ends: 122844 [2019-09-08 06:40:24,072 INFO L226 Difference]: Without dead ends: 67798 [2019-09-08 06:40:24,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:40:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67798 states. [2019-09-08 06:40:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67798 to 67798. [2019-09-08 06:40:33,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67798 states. [2019-09-08 06:40:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67798 states to 67798 states and 133903 transitions. [2019-09-08 06:40:33,827 INFO L78 Accepts]: Start accepts. Automaton has 67798 states and 133903 transitions. Word has length 222 [2019-09-08 06:40:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:33,828 INFO L475 AbstractCegarLoop]: Abstraction has 67798 states and 133903 transitions. [2019-09-08 06:40:33,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:40:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 67798 states and 133903 transitions. [2019-09-08 06:40:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2019-09-08 06:40:34,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:34,165 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:34,165 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:34,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:34,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1062478376, now seen corresponding path program 1 times [2019-09-08 06:40:34,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:34,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:34,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:34,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:34,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2019-09-08 06:40:34,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:40:34,326 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:40:34,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:34,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 2091 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:40:34,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:40:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-09-08 06:40:34,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:40:34,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:40:34,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:40:34,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:40:34,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:40:34,684 INFO L87 Difference]: Start difference. First operand 67798 states and 133903 transitions. Second operand 7 states. [2019-09-08 06:40:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:42,079 INFO L93 Difference]: Finished difference Result 172872 states and 425588 transitions. [2019-09-08 06:40:42,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:40:42,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 450 [2019-09-08 06:40:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:42,685 INFO L225 Difference]: With dead ends: 172872 [2019-09-08 06:40:42,685 INFO L226 Difference]: Without dead ends: 105098 [2019-09-08 06:40:43,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:40:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105098 states. [2019-09-08 06:40:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105098 to 104879. [2019-09-08 06:40:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104879 states. [2019-09-08 06:40:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104879 states to 104879 states and 223765 transitions. [2019-09-08 06:40:58,185 INFO L78 Accepts]: Start accepts. Automaton has 104879 states and 223765 transitions. Word has length 450 [2019-09-08 06:40:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:58,186 INFO L475 AbstractCegarLoop]: Abstraction has 104879 states and 223765 transitions. [2019-09-08 06:40:58,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:40:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 104879 states and 223765 transitions. [2019-09-08 06:40:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2019-09-08 06:40:58,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:58,792 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:40:58,792 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:58,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1300281571, now seen corresponding path program 1 times [2019-09-08 06:40:58,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:58,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:58,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:58,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:58,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 32 proven. 60 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2019-09-08 06:40:58,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:40:58,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:40:58,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:59,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 2099 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:40:59,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:40:59,384 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 06:40:59,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:40:59,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:40:59,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:40:59,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:40:59,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:40:59,401 INFO L87 Difference]: Start difference. First operand 104879 states and 223765 transitions. Second operand 5 states. [2019-09-08 06:41:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:16,580 INFO L93 Difference]: Finished difference Result 258600 states and 657538 transitions. [2019-09-08 06:41:16,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:41:16,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 450 [2019-09-08 06:41:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:18,348 INFO L225 Difference]: With dead ends: 258600 [2019-09-08 06:41:18,349 INFO L226 Difference]: Without dead ends: 153746 [2019-09-08 06:41:19,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 454 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:41:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153746 states. [2019-09-08 06:41:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153746 to 153085. [2019-09-08 06:41:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153085 states. [2019-09-08 06:41:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153085 states to 153085 states and 325927 transitions. [2019-09-08 06:41:43,615 INFO L78 Accepts]: Start accepts. Automaton has 153085 states and 325927 transitions. Word has length 450 [2019-09-08 06:41:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:43,616 INFO L475 AbstractCegarLoop]: Abstraction has 153085 states and 325927 transitions. [2019-09-08 06:41:43,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:41:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 153085 states and 325927 transitions. [2019-09-08 06:41:44,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2019-09-08 06:41:44,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:44,501 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:41:44,501 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:44,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:44,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1690216677, now seen corresponding path program 1 times [2019-09-08 06:41:44,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:44,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:44,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:44,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:44,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2019-09-08 06:41:44,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:41:44,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:41:44,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:46,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 2079 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:41:46,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:41:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 06:41:46,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:41:46,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 06:41:46,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:41:46,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:41:46,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:41:46,183 INFO L87 Difference]: Start difference. First operand 153085 states and 325927 transitions. Second operand 6 states. [2019-09-08 06:42:19,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:19,756 INFO L93 Difference]: Finished difference Result 375871 states and 983266 transitions. [2019-09-08 06:42:19,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:42:19,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 450 [2019-09-08 06:42:19,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:21,281 INFO L225 Difference]: With dead ends: 375871 [2019-09-08 06:42:21,282 INFO L226 Difference]: Without dead ends: 222812 [2019-09-08 06:42:24,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:42:24,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222812 states. [2019-09-08 06:43:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222812 to 222305. [2019-09-08 06:43:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222305 states. [2019-09-08 06:43:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222305 states to 222305 states and 509333 transitions. [2019-09-08 06:43:03,912 INFO L78 Accepts]: Start accepts. Automaton has 222305 states and 509333 transitions. Word has length 450 [2019-09-08 06:43:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:03,913 INFO L475 AbstractCegarLoop]: Abstraction has 222305 states and 509333 transitions. [2019-09-08 06:43:03,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:43:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 222305 states and 509333 transitions. [2019-09-08 06:43:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-08 06:43:05,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:05,380 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:05,380 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:05,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1963440779, now seen corresponding path program 1 times [2019-09-08 06:43:05,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:05,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:05,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:05,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:05,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-08 06:43:06,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:06,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:06,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:06,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:06,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:06,858 INFO L87 Difference]: Start difference. First operand 222305 states and 509333 transitions. Second operand 5 states. [2019-09-08 06:43:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:43,953 INFO L93 Difference]: Finished difference Result 444582 states and 1020085 transitions. [2019-09-08 06:43:43,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:43,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 292 [2019-09-08 06:43:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:45,541 INFO L225 Difference]: With dead ends: 444582 [2019-09-08 06:43:45,541 INFO L226 Difference]: Without dead ends: 222305 [2019-09-08 06:43:47,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222305 states. [2019-09-08 06:44:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222305 to 222305. [2019-09-08 06:44:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222305 states. [2019-09-08 06:44:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222305 states to 222305 states and 507875 transitions. [2019-09-08 06:44:32,638 INFO L78 Accepts]: Start accepts. Automaton has 222305 states and 507875 transitions. Word has length 292 [2019-09-08 06:44:32,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:32,638 INFO L475 AbstractCegarLoop]: Abstraction has 222305 states and 507875 transitions. [2019-09-08 06:44:32,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:44:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 222305 states and 507875 transitions. [2019-09-08 06:44:35,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2019-09-08 06:44:35,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:35,822 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:44:35,823 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:35,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:35,823 INFO L82 PathProgramCache]: Analyzing trace with hash -784242498, now seen corresponding path program 1 times [2019-09-08 06:44:35,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:35,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:35,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:35,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:35,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 33 proven. 28 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-09-08 06:44:36,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:44:36,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:44:36,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:44:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:36,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 2070 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 06:44:36,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:44:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:44:36,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:44:36,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 06:44:36,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:44:36,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:44:36,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:44:36,503 INFO L87 Difference]: Start difference. First operand 222305 states and 507875 transitions. Second operand 8 states. [2019-09-08 06:45:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:45:15,224 INFO L93 Difference]: Finished difference Result 501080 states and 1298923 transitions. [2019-09-08 06:45:15,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:45:15,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 450 [2019-09-08 06:45:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:45:32,514 INFO L225 Difference]: With dead ends: 501080 [2019-09-08 06:45:32,514 INFO L226 Difference]: Without dead ends: 278803 [2019-09-08 06:45:36,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:45:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278803 states. [2019-09-08 06:46:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278803 to 232286. [2019-09-08 06:46:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232286 states. [2019-09-08 06:46:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232286 states to 232286 states and 532584 transitions. [2019-09-08 06:46:28,473 INFO L78 Accepts]: Start accepts. Automaton has 232286 states and 532584 transitions. Word has length 450 [2019-09-08 06:46:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:46:28,474 INFO L475 AbstractCegarLoop]: Abstraction has 232286 states and 532584 transitions. [2019-09-08 06:46:28,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:46:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 232286 states and 532584 transitions. [2019-09-08 06:46:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-08 06:46:31,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:46:31,485 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:46:31,485 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:46:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:46:31,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1295680599, now seen corresponding path program 1 times [2019-09-08 06:46:31,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:46:31,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:46:31,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:46:31,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:46:31,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:46:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:46:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-08 06:46:31,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:46:31,614 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:46:31,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:46:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:46:31,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:46:31,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:46:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-08 06:46:32,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:46:32,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:46:32,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:46:32,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:46:32,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:46:32,023 INFO L87 Difference]: Start difference. First operand 232286 states and 532584 transitions. Second operand 5 states. [2019-09-08 06:47:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:47:04,234 INFO L93 Difference]: Finished difference Result 391465 states and 916500 transitions. [2019-09-08 06:47:04,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:47:04,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 292 [2019-09-08 06:47:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:47:05,503 INFO L225 Difference]: With dead ends: 391465 [2019-09-08 06:47:05,503 INFO L226 Difference]: Without dead ends: 232773 [2019-09-08 06:47:18,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:47:18,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232773 states. [2019-09-08 06:47:53,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232773 to 232284. [2019-09-08 06:47:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232284 states. [2019-09-08 06:47:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232284 states to 232284 states and 506911 transitions. [2019-09-08 06:47:57,556 INFO L78 Accepts]: Start accepts. Automaton has 232284 states and 506911 transitions. Word has length 292 [2019-09-08 06:47:57,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:47:57,557 INFO L475 AbstractCegarLoop]: Abstraction has 232284 states and 506911 transitions. [2019-09-08 06:47:57,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:47:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 232284 states and 506911 transitions. [2019-09-08 06:47:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-08 06:47:58,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:47:58,081 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:47:58,081 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:47:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:47:58,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1419796892, now seen corresponding path program 1 times [2019-09-08 06:47:58,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:47:58,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:47:58,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:47:58,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:47:58,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:47:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:47:58,179 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-09-08 06:47:58,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:47:58,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:47:58,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:47:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:47:58,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:47:58,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:48:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-08 06:48:00,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:48:00,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:48:00,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:48:00,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:48:00,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:48:00,128 INFO L87 Difference]: Start difference. First operand 232284 states and 506911 transitions. Second operand 5 states. [2019-09-08 06:48:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:48:30,806 INFO L93 Difference]: Finished difference Result 392376 states and 877124 transitions. [2019-09-08 06:48:30,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:48:30,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 292 [2019-09-08 06:48:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:48:32,784 INFO L225 Difference]: With dead ends: 392376 [2019-09-08 06:48:32,784 INFO L226 Difference]: Without dead ends: 232772 [2019-09-08 06:48:46,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 291 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:48:46,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232772 states.