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/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:50:33,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:50:33,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:50:33,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:50:33,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:50:33,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:50:33,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:50:33,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:50:33,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:50:33,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:50:33,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:50:33,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:50:33,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:50:33,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:50:33,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:50:33,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:50:33,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:50:33,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:50:33,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:50:33,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:50:33,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:50:33,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:50:33,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:50:33,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:50:33,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:50:33,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:50:33,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:50:33,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:50:33,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:50:33,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:50:33,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:50:33,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:50:33,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:50:33,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:50:33,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:50:33,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:50:33,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:50:33,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:50:33,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:50:33,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:50:33,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:50:33,721 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:50:33,741 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:50:33,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:50:33,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:50:33,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:50:33,744 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:50:33,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:50:33,744 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:50:33,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:50:33,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:50:33,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:50:33,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:50:33,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:50:33,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:50:33,747 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:50:33,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:50:33,747 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:50:33,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:50:33,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:50:33,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:50:33,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:50:33,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:50:33,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:33,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:50:33,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:50:33,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:50:33,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:50:33,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:50:33,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:50:33,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:50:34,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:50:34,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:50:34,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:50:34,024 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:50:34,024 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:50:34,025 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c [2019-10-14 23:50:34,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/373713d8b/27f5a84e3e2f4ed083192b4b85c06d19/FLAG90f0582eb [2019-10-14 23:50:34,561 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:50:34,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2019-10-14 23:50:34,571 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/373713d8b/27f5a84e3e2f4ed083192b4b85c06d19/FLAG90f0582eb [2019-10-14 23:50:34,958 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/373713d8b/27f5a84e3e2f4ed083192b4b85c06d19 [2019-10-14 23:50:34,968 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:50:34,969 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:50:34,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:34,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:50:34,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:50:34,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:34" (1/1) ... [2019-10-14 23:50:34,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20bf000b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:34, skipping insertion in model container [2019-10-14 23:50:34,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:34" (1/1) ... [2019-10-14 23:50:34,985 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:50:35,015 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:50:35,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:35,253 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:50:35,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:35,394 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:50:35,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:35 WrapperNode [2019-10-14 23:50:35,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:35,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:50:35,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:50:35,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:50:35,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:35" (1/1) ... [2019-10-14 23:50:35,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:35" (1/1) ... [2019-10-14 23:50:35,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:35" (1/1) ... [2019-10-14 23:50:35,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:35" (1/1) ... [2019-10-14 23:50:35,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:35" (1/1) ... [2019-10-14 23:50:35,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:35" (1/1) ... [2019-10-14 23:50:35,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:35" (1/1) ... [2019-10-14 23:50:35,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:50:35,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:50:35,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:50:35,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:50:35,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:35,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:50:35,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:50:35,506 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-14 23:50:35,507 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-14 23:50:35,507 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-14 23:50:35,507 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-14 23:50:35,507 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-14 23:50:35,507 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-14 23:50:35,507 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-14 23:50:35,508 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-14 23:50:35,508 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-14 23:50:35,508 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-14 23:50:35,508 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-14 23:50:35,508 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-14 23:50:35,508 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-14 23:50:35,509 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-14 23:50:35,509 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-14 23:50:35,509 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-14 23:50:35,509 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-14 23:50:35,509 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-14 23:50:35,510 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-14 23:50:35,510 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-14 23:50:35,510 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:50:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:50:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:50:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-14 23:50:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-14 23:50:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-14 23:50:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-14 23:50:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-14 23:50:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-14 23:50:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-14 23:50:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-14 23:50:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-14 23:50:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-14 23:50:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-14 23:50:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-14 23:50:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-14 23:50:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-14 23:50:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-14 23:50:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-14 23:50:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-14 23:50:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-14 23:50:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-14 23:50:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-14 23:50:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:50:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:50:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:50:36,077 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:50:36,078 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-14 23:50:36,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:36 BoogieIcfgContainer [2019-10-14 23:50:36,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:50:36,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:50:36,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:50:36,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:50:36,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:50:34" (1/3) ... [2019-10-14 23:50:36,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363bfa22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:36, skipping insertion in model container [2019-10-14 23:50:36,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:35" (2/3) ... [2019-10-14 23:50:36,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363bfa22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:36, skipping insertion in model container [2019-10-14 23:50:36,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:36" (3/3) ... [2019-10-14 23:50:36,091 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2019-10-14 23:50:36,101 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:50:36,125 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:50:36,138 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:50:36,173 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:50:36,173 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:50:36,174 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:50:36,174 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:50:36,174 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:50:36,174 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:50:36,175 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:50:36,175 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:50:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2019-10-14 23:50:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:50:36,210 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:36,211 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:36,212 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:36,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:36,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1996614335, now seen corresponding path program 1 times [2019-10-14 23:50:36,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:36,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270557507] [2019-10-14 23:50:36,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:36,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:36,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:36,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270557507] [2019-10-14 23:50:36,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:36,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:50:36,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806528648] [2019-10-14 23:50:36,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:50:36,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:36,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:50:36,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:36,765 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 8 states. [2019-10-14 23:50:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:38,326 INFO L93 Difference]: Finished difference Result 412 states and 626 transitions. [2019-10-14 23:50:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:50:38,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2019-10-14 23:50:38,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:38,343 INFO L225 Difference]: With dead ends: 412 [2019-10-14 23:50:38,344 INFO L226 Difference]: Without dead ends: 247 [2019-10-14 23:50:38,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:38,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-14 23:50:38,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 160. [2019-10-14 23:50:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-14 23:50:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 212 transitions. [2019-10-14 23:50:38,429 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 212 transitions. Word has length 90 [2019-10-14 23:50:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:38,429 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 212 transitions. [2019-10-14 23:50:38,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:50:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 212 transitions. [2019-10-14 23:50:38,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:50:38,434 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:38,434 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:38,435 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:38,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:38,435 INFO L82 PathProgramCache]: Analyzing trace with hash -387310403, now seen corresponding path program 1 times [2019-10-14 23:50:38,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:38,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33816298] [2019-10-14 23:50:38,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:38,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:38,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:38,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33816298] [2019-10-14 23:50:38,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:38,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:38,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758367977] [2019-10-14 23:50:38,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:38,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:38,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:38,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:38,692 INFO L87 Difference]: Start difference. First operand 160 states and 212 transitions. Second operand 9 states. [2019-10-14 23:50:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:40,608 INFO L93 Difference]: Finished difference Result 579 states and 839 transitions. [2019-10-14 23:50:40,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:50:40,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-10-14 23:50:40,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:40,616 INFO L225 Difference]: With dead ends: 579 [2019-10-14 23:50:40,616 INFO L226 Difference]: Without dead ends: 439 [2019-10-14 23:50:40,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:50:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-10-14 23:50:40,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 294. [2019-10-14 23:50:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-14 23:50:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 393 transitions. [2019-10-14 23:50:40,675 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 393 transitions. Word has length 90 [2019-10-14 23:50:40,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:40,675 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 393 transitions. [2019-10-14 23:50:40,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:40,675 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 393 transitions. [2019-10-14 23:50:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:50:40,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:40,678 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:40,678 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:40,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:40,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1952833149, now seen corresponding path program 1 times [2019-10-14 23:50:40,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:40,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740387747] [2019-10-14 23:50:40,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:40,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:40,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:40,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740387747] [2019-10-14 23:50:40,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:40,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:40,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57880905] [2019-10-14 23:50:40,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:40,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:40,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:40,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:40,894 INFO L87 Difference]: Start difference. First operand 294 states and 393 transitions. Second operand 10 states. [2019-10-14 23:50:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:42,025 INFO L93 Difference]: Finished difference Result 704 states and 993 transitions. [2019-10-14 23:50:42,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:42,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-10-14 23:50:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:42,031 INFO L225 Difference]: With dead ends: 704 [2019-10-14 23:50:42,031 INFO L226 Difference]: Without dead ends: 430 [2019-10-14 23:50:42,032 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:42,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-14 23:50:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 294. [2019-10-14 23:50:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-14 23:50:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 386 transitions. [2019-10-14 23:50:42,076 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 386 transitions. Word has length 90 [2019-10-14 23:50:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:42,077 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 386 transitions. [2019-10-14 23:50:42,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 386 transitions. [2019-10-14 23:50:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:50:42,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:42,079 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:42,079 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:42,080 INFO L82 PathProgramCache]: Analyzing trace with hash 227206333, now seen corresponding path program 1 times [2019-10-14 23:50:42,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:42,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043954629] [2019-10-14 23:50:42,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:42,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:42,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:42,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043954629] [2019-10-14 23:50:42,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:42,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:42,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868063608] [2019-10-14 23:50:42,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:42,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:42,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:42,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:42,258 INFO L87 Difference]: Start difference. First operand 294 states and 386 transitions. Second operand 10 states. [2019-10-14 23:50:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:43,471 INFO L93 Difference]: Finished difference Result 700 states and 971 transitions. [2019-10-14 23:50:43,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:43,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-10-14 23:50:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:43,475 INFO L225 Difference]: With dead ends: 700 [2019-10-14 23:50:43,476 INFO L226 Difference]: Without dead ends: 426 [2019-10-14 23:50:43,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:43,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-14 23:50:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 294. [2019-10-14 23:50:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-14 23:50:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 379 transitions. [2019-10-14 23:50:43,510 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 379 transitions. Word has length 90 [2019-10-14 23:50:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:43,510 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 379 transitions. [2019-10-14 23:50:43,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 379 transitions. [2019-10-14 23:50:43,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:50:43,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:43,512 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:43,513 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:43,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1418466941, now seen corresponding path program 1 times [2019-10-14 23:50:43,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:43,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861470619] [2019-10-14 23:50:43,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:43,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:43,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:43,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861470619] [2019-10-14 23:50:43,866 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:43,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:43,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984295057] [2019-10-14 23:50:43,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:43,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:43,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:43,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:43,868 INFO L87 Difference]: Start difference. First operand 294 states and 379 transitions. Second operand 10 states. [2019-10-14 23:50:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:45,479 INFO L93 Difference]: Finished difference Result 855 states and 1230 transitions. [2019-10-14 23:50:45,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:45,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-10-14 23:50:45,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:45,484 INFO L225 Difference]: With dead ends: 855 [2019-10-14 23:50:45,485 INFO L226 Difference]: Without dead ends: 581 [2019-10-14 23:50:45,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-10-14 23:50:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 366. [2019-10-14 23:50:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-14 23:50:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 457 transitions. [2019-10-14 23:50:45,536 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 457 transitions. Word has length 90 [2019-10-14 23:50:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:45,537 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 457 transitions. [2019-10-14 23:50:45,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:45,537 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 457 transitions. [2019-10-14 23:50:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:50:45,539 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:45,539 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:45,539 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:45,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:45,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1504622653, now seen corresponding path program 1 times [2019-10-14 23:50:45,540 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:45,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141718349] [2019-10-14 23:50:45,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:45,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:45,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:45,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141718349] [2019-10-14 23:50:45,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:45,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:45,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777663403] [2019-10-14 23:50:45,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:45,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:45,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:45,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:45,731 INFO L87 Difference]: Start difference. First operand 366 states and 457 transitions. Second operand 10 states. [2019-10-14 23:50:47,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:47,331 INFO L93 Difference]: Finished difference Result 877 states and 1164 transitions. [2019-10-14 23:50:47,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:50:47,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-10-14 23:50:47,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:47,337 INFO L225 Difference]: With dead ends: 877 [2019-10-14 23:50:47,337 INFO L226 Difference]: Without dead ends: 532 [2019-10-14 23:50:47,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:50:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-10-14 23:50:47,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 376. [2019-10-14 23:50:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-10-14 23:50:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 465 transitions. [2019-10-14 23:50:47,384 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 465 transitions. Word has length 90 [2019-10-14 23:50:47,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:47,385 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 465 transitions. [2019-10-14 23:50:47,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:47,385 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 465 transitions. [2019-10-14 23:50:47,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:50:47,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:47,386 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:47,387 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:47,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:47,387 INFO L82 PathProgramCache]: Analyzing trace with hash -523963457, now seen corresponding path program 1 times [2019-10-14 23:50:47,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:47,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816871267] [2019-10-14 23:50:47,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:47,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:47,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:47,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816871267] [2019-10-14 23:50:47,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:47,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:47,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056774489] [2019-10-14 23:50:47,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:47,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:47,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:47,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:47,742 INFO L87 Difference]: Start difference. First operand 376 states and 465 transitions. Second operand 10 states. [2019-10-14 23:50:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:49,517 INFO L93 Difference]: Finished difference Result 915 states and 1208 transitions. [2019-10-14 23:50:49,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:50:49,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-10-14 23:50:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:49,521 INFO L225 Difference]: With dead ends: 915 [2019-10-14 23:50:49,521 INFO L226 Difference]: Without dead ends: 560 [2019-10-14 23:50:49,523 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:49,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-14 23:50:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 396. [2019-10-14 23:50:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-10-14 23:50:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 485 transitions. [2019-10-14 23:50:49,564 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 485 transitions. Word has length 90 [2019-10-14 23:50:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:49,564 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 485 transitions. [2019-10-14 23:50:49,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 485 transitions. [2019-10-14 23:50:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:50:49,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:49,566 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:49,566 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:49,566 INFO L82 PathProgramCache]: Analyzing trace with hash -275816963, now seen corresponding path program 1 times [2019-10-14 23:50:49,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:49,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811711138] [2019-10-14 23:50:49,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:49,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:49,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:49,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811711138] [2019-10-14 23:50:49,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:49,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:49,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123643948] [2019-10-14 23:50:49,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:49,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:49,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:49,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:49,750 INFO L87 Difference]: Start difference. First operand 396 states and 485 transitions. Second operand 10 states. [2019-10-14 23:50:51,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:51,297 INFO L93 Difference]: Finished difference Result 939 states and 1222 transitions. [2019-10-14 23:50:51,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:50:51,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-10-14 23:50:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:51,306 INFO L225 Difference]: With dead ends: 939 [2019-10-14 23:50:51,306 INFO L226 Difference]: Without dead ends: 564 [2019-10-14 23:50:51,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-14 23:50:51,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 406. [2019-10-14 23:50:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-10-14 23:50:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 493 transitions. [2019-10-14 23:50:51,342 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 493 transitions. Word has length 90 [2019-10-14 23:50:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:51,342 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 493 transitions. [2019-10-14 23:50:51,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 493 transitions. [2019-10-14 23:50:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:50:51,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:51,344 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:51,344 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:51,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:51,344 INFO L82 PathProgramCache]: Analyzing trace with hash -348203521, now seen corresponding path program 1 times [2019-10-14 23:50:51,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:51,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194888354] [2019-10-14 23:50:51,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:51,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:51,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:51,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194888354] [2019-10-14 23:50:51,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:51,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:51,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811735265] [2019-10-14 23:50:51,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:51,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:51,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:51,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:51,508 INFO L87 Difference]: Start difference. First operand 406 states and 493 transitions. Second operand 10 states. [2019-10-14 23:50:53,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:53,176 INFO L93 Difference]: Finished difference Result 1144 states and 1493 transitions. [2019-10-14 23:50:53,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:50:53,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-10-14 23:50:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:53,183 INFO L225 Difference]: With dead ends: 1144 [2019-10-14 23:50:53,183 INFO L226 Difference]: Without dead ends: 758 [2019-10-14 23:50:53,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-10-14 23:50:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-10-14 23:50:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 467. [2019-10-14 23:50:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-10-14 23:50:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 547 transitions. [2019-10-14 23:50:53,228 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 547 transitions. Word has length 90 [2019-10-14 23:50:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:53,228 INFO L462 AbstractCegarLoop]: Abstraction has 467 states and 547 transitions. [2019-10-14 23:50:53,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:53,229 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 547 transitions. [2019-10-14 23:50:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:50:53,232 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:53,232 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:53,232 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:53,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:53,233 INFO L82 PathProgramCache]: Analyzing trace with hash -286163907, now seen corresponding path program 1 times [2019-10-14 23:50:53,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:53,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301751431] [2019-10-14 23:50:53,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:53,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:53,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:53,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301751431] [2019-10-14 23:50:53,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:53,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:50:53,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008527240] [2019-10-14 23:50:53,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:50:53,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:53,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:50:53,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:53,346 INFO L87 Difference]: Start difference. First operand 467 states and 547 transitions. Second operand 7 states. [2019-10-14 23:50:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:54,929 INFO L93 Difference]: Finished difference Result 1503 states and 1877 transitions. [2019-10-14 23:50:54,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:50:54,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-10-14 23:50:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:54,936 INFO L225 Difference]: With dead ends: 1503 [2019-10-14 23:50:54,936 INFO L226 Difference]: Without dead ends: 1058 [2019-10-14 23:50:54,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2019-10-14 23:50:55,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 847. [2019-10-14 23:50:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-10-14 23:50:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1018 transitions. [2019-10-14 23:50:55,005 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1018 transitions. Word has length 90 [2019-10-14 23:50:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:55,007 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1018 transitions. [2019-10-14 23:50:55,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:50:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1018 transitions. [2019-10-14 23:50:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-14 23:50:55,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:55,009 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:55,009 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:55,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:55,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1417763379, now seen corresponding path program 1 times [2019-10-14 23:50:55,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:55,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123239553] [2019-10-14 23:50:55,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:55,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:55,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:55,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123239553] [2019-10-14 23:50:55,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:55,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:50:55,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665891887] [2019-10-14 23:50:55,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:50:55,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:55,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:50:55,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:55,146 INFO L87 Difference]: Start difference. First operand 847 states and 1018 transitions. Second operand 7 states. [2019-10-14 23:50:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:56,680 INFO L93 Difference]: Finished difference Result 2813 states and 3701 transitions. [2019-10-14 23:50:56,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:50:56,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-10-14 23:50:56,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:56,691 INFO L225 Difference]: With dead ends: 2813 [2019-10-14 23:50:56,691 INFO L226 Difference]: Without dead ends: 1993 [2019-10-14 23:50:56,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:56,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-10-14 23:50:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1710. [2019-10-14 23:50:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-10-14 23:50:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2141 transitions. [2019-10-14 23:50:56,850 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2141 transitions. Word has length 91 [2019-10-14 23:50:56,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:56,851 INFO L462 AbstractCegarLoop]: Abstraction has 1710 states and 2141 transitions. [2019-10-14 23:50:56,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:50:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2141 transitions. [2019-10-14 23:50:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-14 23:50:56,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:56,857 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:56,857 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:56,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:56,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1387972843, now seen corresponding path program 1 times [2019-10-14 23:50:56,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:56,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810831223] [2019-10-14 23:50:56,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:56,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:56,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-14 23:50:57,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810831223] [2019-10-14 23:50:57,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:57,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:57,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4278908] [2019-10-14 23:50:57,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:57,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:57,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:57,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:57,020 INFO L87 Difference]: Start difference. First operand 1710 states and 2141 transitions. Second operand 9 states. [2019-10-14 23:50:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:58,369 INFO L93 Difference]: Finished difference Result 3845 states and 5084 transitions. [2019-10-14 23:50:58,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:50:58,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-10-14 23:50:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:58,383 INFO L225 Difference]: With dead ends: 3845 [2019-10-14 23:50:58,384 INFO L226 Difference]: Without dead ends: 2157 [2019-10-14 23:50:58,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:50:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2019-10-14 23:50:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1767. [2019-10-14 23:50:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2019-10-14 23:50:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2232 transitions. [2019-10-14 23:50:58,600 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2232 transitions. Word has length 111 [2019-10-14 23:50:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:58,600 INFO L462 AbstractCegarLoop]: Abstraction has 1767 states and 2232 transitions. [2019-10-14 23:50:58,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2232 transitions. [2019-10-14 23:50:58,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-14 23:50:58,603 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:58,604 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:58,604 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:58,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:58,605 INFO L82 PathProgramCache]: Analyzing trace with hash 36587625, now seen corresponding path program 1 times [2019-10-14 23:50:58,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:58,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959235246] [2019-10-14 23:50:58,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:58,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:58,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:50:58,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959235246] [2019-10-14 23:50:58,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:58,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:50:58,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145307957] [2019-10-14 23:50:58,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:50:58,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:58,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:50:58,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:58,773 INFO L87 Difference]: Start difference. First operand 1767 states and 2232 transitions. Second operand 8 states. [2019-10-14 23:51:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:00,978 INFO L93 Difference]: Finished difference Result 5835 states and 7942 transitions. [2019-10-14 23:51:00,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:51:00,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2019-10-14 23:51:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:01,000 INFO L225 Difference]: With dead ends: 5835 [2019-10-14 23:51:01,001 INFO L226 Difference]: Without dead ends: 3120 [2019-10-14 23:51:01,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:51:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-10-14 23:51:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2788. [2019-10-14 23:51:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2019-10-14 23:51:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3646 transitions. [2019-10-14 23:51:01,416 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3646 transitions. Word has length 111 [2019-10-14 23:51:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:01,417 INFO L462 AbstractCegarLoop]: Abstraction has 2788 states and 3646 transitions. [2019-10-14 23:51:01,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:51:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3646 transitions. [2019-10-14 23:51:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-14 23:51:01,425 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:01,426 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:01,426 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:01,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:01,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1178118941, now seen corresponding path program 1 times [2019-10-14 23:51:01,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:01,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363663471] [2019-10-14 23:51:01,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:01,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:01,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-14 23:51:01,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363663471] [2019-10-14 23:51:01,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:01,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:51:01,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168532114] [2019-10-14 23:51:01,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:51:01,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:01,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:51:01,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:51:01,623 INFO L87 Difference]: Start difference. First operand 2788 states and 3646 transitions. Second operand 9 states. [2019-10-14 23:51:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:04,146 INFO L93 Difference]: Finished difference Result 8089 states and 11637 transitions. [2019-10-14 23:51:04,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 23:51:04,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-10-14 23:51:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:04,190 INFO L225 Difference]: With dead ends: 8089 [2019-10-14 23:51:04,191 INFO L226 Difference]: Without dead ends: 5323 [2019-10-14 23:51:04,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:51:04,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2019-10-14 23:51:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 4852. [2019-10-14 23:51:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4852 states. [2019-10-14 23:51:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 6633 transitions. [2019-10-14 23:51:05,183 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 6633 transitions. Word has length 155 [2019-10-14 23:51:05,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:05,184 INFO L462 AbstractCegarLoop]: Abstraction has 4852 states and 6633 transitions. [2019-10-14 23:51:05,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:51:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 6633 transitions. [2019-10-14 23:51:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-14 23:51:05,193 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:05,193 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:05,193 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:05,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:05,194 INFO L82 PathProgramCache]: Analyzing trace with hash -390866386, now seen corresponding path program 1 times [2019-10-14 23:51:05,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:05,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271761343] [2019-10-14 23:51:05,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:05,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:05,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-14 23:51:05,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271761343] [2019-10-14 23:51:05,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:05,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:51:05,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895191243] [2019-10-14 23:51:05,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:51:05,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:05,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:51:05,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:51:05,547 INFO L87 Difference]: Start difference. First operand 4852 states and 6633 transitions. Second operand 10 states. [2019-10-14 23:51:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:09,109 INFO L93 Difference]: Finished difference Result 12975 states and 19533 transitions. [2019-10-14 23:51:09,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 23:51:09,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2019-10-14 23:51:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:09,160 INFO L225 Difference]: With dead ends: 12975 [2019-10-14 23:51:09,160 INFO L226 Difference]: Without dead ends: 6726 [2019-10-14 23:51:09,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2019-10-14 23:51:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6726 states.