/usr/bin/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.03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:24:53,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:24:53,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:24:53,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:24:53,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:24:53,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:24:53,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:24:53,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:24:53,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:24:53,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:24:53,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:24:53,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:24:53,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:24:53,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:24:53,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:24:53,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:24:53,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:24:53,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:24:53,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:24:53,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:24:53,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:24:53,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:24:53,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:24:53,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:24:53,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:24:53,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:24:53,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:24:53,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:24:53,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:24:53,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:24:53,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:24:53,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:24:53,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:24:53,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:24:53,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:24:53,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:24:53,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:24:53,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:24:53,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:24:53,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:24:53,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:24:53,987 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-11-06 22:24:54,001 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:24:54,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:24:54,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:24:54,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:24:54,003 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:24:54,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:24:54,004 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:24:54,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:24:54,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:24:54,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:24:54,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:24:54,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:24:54,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:24:54,005 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:24:54,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:24:54,005 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:24:54,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:24:54,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:24:54,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:24:54,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:24:54,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:24:54,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:24:54,007 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:24:54,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:24:54,007 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:24:54,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:24:54,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:24:54,008 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:24:54,008 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:24:54,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:24:54,283 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:24:54,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:24:54,288 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:24:54,288 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:24:54,289 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.03.cil.c [2019-11-06 22:24:54,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb287c1c/52f135fc211f4c74ac1570ef06e45bc7/FLAG680395f33 [2019-11-06 22:24:54,823 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:24:54,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.03.cil.c [2019-11-06 22:24:54,844 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb287c1c/52f135fc211f4c74ac1570ef06e45bc7/FLAG680395f33 [2019-11-06 22:24:55,211 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb287c1c/52f135fc211f4c74ac1570ef06e45bc7 [2019-11-06 22:24:55,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:24:55,223 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:24:55,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:24:55,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:24:55,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:24:55,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:55" (1/1) ... [2019-11-06 22:24:55,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716597c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:55, skipping insertion in model container [2019-11-06 22:24:55,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:55" (1/1) ... [2019-11-06 22:24:55,240 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:24:55,275 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:24:55,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:24:55,512 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:24:55,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:24:55,668 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:24:55,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:55 WrapperNode [2019-11-06 22:24:55,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:24:55,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:24:55,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:24:55,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:24:55,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:55" (1/1) ... [2019-11-06 22:24:55,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:55" (1/1) ... [2019-11-06 22:24:55,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:55" (1/1) ... [2019-11-06 22:24:55,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:55" (1/1) ... [2019-11-06 22:24:55,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:55" (1/1) ... [2019-11-06 22:24:55,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:55" (1/1) ... [2019-11-06 22:24:55,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:55" (1/1) ... [2019-11-06 22:24:55,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:24:55,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:24:55,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:24:55,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:24:55,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:55" (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-11-06 22:24:55,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:24:55,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:24:55,782 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-06 22:24:55,782 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-11-06 22:24:55,782 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-11-06 22:24:55,782 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-11-06 22:24:55,782 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-11-06 22:24:55,783 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-11-06 22:24:55,783 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-11-06 22:24:55,783 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-11-06 22:24:55,783 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-11-06 22:24:55,783 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-11-06 22:24:55,783 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-11-06 22:24:55,784 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-11-06 22:24:55,784 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-11-06 22:24:55,784 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-11-06 22:24:55,784 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-11-06 22:24:55,784 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-11-06 22:24:55,784 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-11-06 22:24:55,785 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-11-06 22:24:55,785 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-11-06 22:24:55,785 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-11-06 22:24:55,785 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-11-06 22:24:55,785 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-11-06 22:24:55,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:24:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:24:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:24:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-06 22:24:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-11-06 22:24:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-11-06 22:24:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-11-06 22:24:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-11-06 22:24:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-11-06 22:24:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-11-06 22:24:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-11-06 22:24:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-11-06 22:24:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-11-06 22:24:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-11-06 22:24:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-11-06 22:24:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-11-06 22:24:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-11-06 22:24:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-11-06 22:24:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-11-06 22:24:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-11-06 22:24:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-11-06 22:24:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-11-06 22:24:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-11-06 22:24:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-11-06 22:24:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-11-06 22:24:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:24:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:24:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:24:56,505 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:24:56,505 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-06 22:24:56,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:56 BoogieIcfgContainer [2019-11-06 22:24:56,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:24:56,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:24:56,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:24:56,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:24:56,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:24:55" (1/3) ... [2019-11-06 22:24:56,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637943b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:56, skipping insertion in model container [2019-11-06 22:24:56,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:55" (2/3) ... [2019-11-06 22:24:56,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637943b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:56, skipping insertion in model container [2019-11-06 22:24:56,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:56" (3/3) ... [2019-11-06 22:24:56,523 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2019-11-06 22:24:56,534 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:24:56,561 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:24:56,573 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:24:56,602 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:24:56,602 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:24:56,602 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:24:56,602 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:24:56,603 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:24:56,603 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:24:56,603 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:24:56,603 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:24:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-11-06 22:24:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:24:56,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:56,649 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:56,652 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:56,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:56,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1961190691, now seen corresponding path program 1 times [2019-11-06 22:24:56,668 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:56,669 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747909327] [2019-11-06 22:24:56,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:57,425 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747909327] [2019-11-06 22:24:57,427 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:57,427 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:24:57,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553763393] [2019-11-06 22:24:57,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:24:57,439 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:57,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:24:57,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:24:57,456 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 9 states. [2019-11-06 22:25:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:00,736 INFO L93 Difference]: Finished difference Result 735 states and 1166 transitions. [2019-11-06 22:25:00,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:25:00,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-11-06 22:25:00,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:00,760 INFO L225 Difference]: With dead ends: 735 [2019-11-06 22:25:00,761 INFO L226 Difference]: Without dead ends: 538 [2019-11-06 22:25:00,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:25:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-06 22:25:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 355. [2019-11-06 22:25:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-06 22:25:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 488 transitions. [2019-11-06 22:25:00,921 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 488 transitions. Word has length 105 [2019-11-06 22:25:00,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:00,922 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 488 transitions. [2019-11-06 22:25:00,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:25:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 488 transitions. [2019-11-06 22:25:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:25:00,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:00,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:00,928 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:00,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:00,929 INFO L82 PathProgramCache]: Analyzing trace with hash 645369824, now seen corresponding path program 1 times [2019-11-06 22:25:00,929 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:00,929 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422284526] [2019-11-06 22:25:00,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:01,254 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422284526] [2019-11-06 22:25:01,254 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:01,254 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:01,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125473616] [2019-11-06 22:25:01,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:01,257 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:01,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:01,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:01,258 INFO L87 Difference]: Start difference. First operand 355 states and 488 transitions. Second operand 10 states. [2019-11-06 22:25:02,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:02,953 INFO L93 Difference]: Finished difference Result 863 states and 1244 transitions. [2019-11-06 22:25:02,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:25:02,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-11-06 22:25:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:02,960 INFO L225 Difference]: With dead ends: 863 [2019-11-06 22:25:02,960 INFO L226 Difference]: Without dead ends: 529 [2019-11-06 22:25:02,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 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-11-06 22:25:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-11-06 22:25:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 355. [2019-11-06 22:25:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-06 22:25:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 481 transitions. [2019-11-06 22:25:03,016 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 481 transitions. Word has length 105 [2019-11-06 22:25:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:03,016 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 481 transitions. [2019-11-06 22:25:03,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 481 transitions. [2019-11-06 22:25:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:25:03,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:03,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:03,020 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:03,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:03,020 INFO L82 PathProgramCache]: Analyzing trace with hash 289131620, now seen corresponding path program 1 times [2019-11-06 22:25:03,020 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:03,021 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237253667] [2019-11-06 22:25:03,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:03,229 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237253667] [2019-11-06 22:25:03,229 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:03,229 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:03,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199451666] [2019-11-06 22:25:03,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:03,230 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:03,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:03,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:03,231 INFO L87 Difference]: Start difference. First operand 355 states and 481 transitions. Second operand 10 states. [2019-11-06 22:25:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:04,933 INFO L93 Difference]: Finished difference Result 859 states and 1222 transitions. [2019-11-06 22:25:04,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:25:04,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-11-06 22:25:04,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:04,938 INFO L225 Difference]: With dead ends: 859 [2019-11-06 22:25:04,938 INFO L226 Difference]: Without dead ends: 525 [2019-11-06 22:25:04,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 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-11-06 22:25:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-11-06 22:25:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 355. [2019-11-06 22:25:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-06 22:25:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 474 transitions. [2019-11-06 22:25:04,986 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 474 transitions. Word has length 105 [2019-11-06 22:25:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:04,987 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 474 transitions. [2019-11-06 22:25:04,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:04,987 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 474 transitions. [2019-11-06 22:25:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:25:04,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:04,990 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:04,990 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:04,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:04,990 INFO L82 PathProgramCache]: Analyzing trace with hash -830738592, now seen corresponding path program 1 times [2019-11-06 22:25:04,990 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:04,991 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027537406] [2019-11-06 22:25:04,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:05,218 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027537406] [2019-11-06 22:25:05,218 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:05,218 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:05,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094708543] [2019-11-06 22:25:05,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:05,220 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:05,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:05,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:05,220 INFO L87 Difference]: Start difference. First operand 355 states and 474 transitions. Second operand 10 states. [2019-11-06 22:25:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:06,871 INFO L93 Difference]: Finished difference Result 855 states and 1200 transitions. [2019-11-06 22:25:06,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:25:06,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-11-06 22:25:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:06,876 INFO L225 Difference]: With dead ends: 855 [2019-11-06 22:25:06,876 INFO L226 Difference]: Without dead ends: 521 [2019-11-06 22:25:06,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 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-11-06 22:25:06,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-11-06 22:25:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 355. [2019-11-06 22:25:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-06 22:25:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 467 transitions. [2019-11-06 22:25:06,918 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 467 transitions. Word has length 105 [2019-11-06 22:25:06,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:06,919 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 467 transitions. [2019-11-06 22:25:06,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:06,919 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 467 transitions. [2019-11-06 22:25:06,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:25:06,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:06,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:06,921 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:06,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:06,922 INFO L82 PathProgramCache]: Analyzing trace with hash -590498846, now seen corresponding path program 1 times [2019-11-06 22:25:06,922 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:06,922 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329811813] [2019-11-06 22:25:06,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:07,135 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329811813] [2019-11-06 22:25:07,135 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:07,136 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:07,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836984919] [2019-11-06 22:25:07,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:07,137 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:07,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:07,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:07,139 INFO L87 Difference]: Start difference. First operand 355 states and 467 transitions. Second operand 10 states. [2019-11-06 22:25:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:09,507 INFO L93 Difference]: Finished difference Result 1038 states and 1509 transitions. [2019-11-06 22:25:09,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:25:09,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-11-06 22:25:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:09,512 INFO L225 Difference]: With dead ends: 1038 [2019-11-06 22:25:09,512 INFO L226 Difference]: Without dead ends: 704 [2019-11-06 22:25:09,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:25:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-11-06 22:25:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 447. [2019-11-06 22:25:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-11-06 22:25:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 571 transitions. [2019-11-06 22:25:09,567 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 571 transitions. Word has length 105 [2019-11-06 22:25:09,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:09,568 INFO L462 AbstractCegarLoop]: Abstraction has 447 states and 571 transitions. [2019-11-06 22:25:09,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:09,568 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 571 transitions. [2019-11-06 22:25:09,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:25:09,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:09,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:09,571 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:09,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:09,571 INFO L82 PathProgramCache]: Analyzing trace with hash -260938274, now seen corresponding path program 1 times [2019-11-06 22:25:09,572 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:09,572 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169037186] [2019-11-06 22:25:09,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:09,797 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169037186] [2019-11-06 22:25:09,797 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:09,798 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:09,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208580916] [2019-11-06 22:25:09,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:09,799 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:09,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:09,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:09,799 INFO L87 Difference]: Start difference. First operand 447 states and 571 transitions. Second operand 10 states. [2019-11-06 22:25:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:12,007 INFO L93 Difference]: Finished difference Result 1244 states and 1749 transitions. [2019-11-06 22:25:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:25:12,007 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-11-06 22:25:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:12,013 INFO L225 Difference]: With dead ends: 1244 [2019-11-06 22:25:12,014 INFO L226 Difference]: Without dead ends: 818 [2019-11-06 22:25:12,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:25:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-11-06 22:25:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 539. [2019-11-06 22:25:12,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-11-06 22:25:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 671 transitions. [2019-11-06 22:25:12,100 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 671 transitions. Word has length 105 [2019-11-06 22:25:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:12,101 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 671 transitions. [2019-11-06 22:25:12,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 671 transitions. [2019-11-06 22:25:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:25:12,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:12,102 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:12,103 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:12,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1689355362, now seen corresponding path program 1 times [2019-11-06 22:25:12,103 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:12,103 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132339996] [2019-11-06 22:25:12,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:12,315 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132339996] [2019-11-06 22:25:12,316 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:12,318 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:12,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627687574] [2019-11-06 22:25:12,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:12,320 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:12,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:12,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:12,321 INFO L87 Difference]: Start difference. First operand 539 states and 671 transitions. Second operand 10 states. [2019-11-06 22:25:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:14,822 INFO L93 Difference]: Finished difference Result 1296 states and 1710 transitions. [2019-11-06 22:25:14,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:25:14,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-11-06 22:25:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:14,828 INFO L225 Difference]: With dead ends: 1296 [2019-11-06 22:25:14,828 INFO L226 Difference]: Without dead ends: 779 [2019-11-06 22:25:14,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-06 22:25:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-06 22:25:14,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 554. [2019-11-06 22:25:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-11-06 22:25:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 683 transitions. [2019-11-06 22:25:14,890 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 683 transitions. Word has length 105 [2019-11-06 22:25:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:14,890 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 683 transitions. [2019-11-06 22:25:14,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 683 transitions. [2019-11-06 22:25:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:25:14,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:14,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:14,893 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:14,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:14,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1271958756, now seen corresponding path program 1 times [2019-11-06 22:25:14,894 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:14,894 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027569838] [2019-11-06 22:25:14,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:15,115 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027569838] [2019-11-06 22:25:15,116 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:15,117 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:15,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876572204] [2019-11-06 22:25:15,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:15,117 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:15,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:15,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:15,118 INFO L87 Difference]: Start difference. First operand 554 states and 683 transitions. Second operand 10 states. [2019-11-06 22:25:17,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:17,363 INFO L93 Difference]: Finished difference Result 1306 states and 1703 transitions. [2019-11-06 22:25:17,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 22:25:17,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-11-06 22:25:17,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:17,372 INFO L225 Difference]: With dead ends: 1306 [2019-11-06 22:25:17,372 INFO L226 Difference]: Without dead ends: 774 [2019-11-06 22:25:17,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 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-11-06 22:25:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-11-06 22:25:17,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 564. [2019-11-06 22:25:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-11-06 22:25:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 689 transitions. [2019-11-06 22:25:17,438 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 689 transitions. Word has length 105 [2019-11-06 22:25:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:17,441 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 689 transitions. [2019-11-06 22:25:17,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 689 transitions. [2019-11-06 22:25:17,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:25:17,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:17,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:17,445 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:17,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:17,445 INFO L82 PathProgramCache]: Analyzing trace with hash -2146989534, now seen corresponding path program 1 times [2019-11-06 22:25:17,445 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:17,446 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571122440] [2019-11-06 22:25:17,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:17,642 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571122440] [2019-11-06 22:25:17,644 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:17,644 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:17,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783378694] [2019-11-06 22:25:17,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:17,645 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:17,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:17,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:17,645 INFO L87 Difference]: Start difference. First operand 564 states and 689 transitions. Second operand 10 states. [2019-11-06 22:25:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:19,841 INFO L93 Difference]: Finished difference Result 1319 states and 1701 transitions. [2019-11-06 22:25:19,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 22:25:19,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-11-06 22:25:19,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:19,852 INFO L225 Difference]: With dead ends: 1319 [2019-11-06 22:25:19,852 INFO L226 Difference]: Without dead ends: 777 [2019-11-06 22:25:19,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 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-11-06 22:25:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2019-11-06 22:25:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 574. [2019-11-06 22:25:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-11-06 22:25:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 695 transitions. [2019-11-06 22:25:19,945 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 695 transitions. Word has length 105 [2019-11-06 22:25:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:19,946 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 695 transitions. [2019-11-06 22:25:19,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 695 transitions. [2019-11-06 22:25:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:25:19,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:19,948 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:19,948 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:19,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:19,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1253503196, now seen corresponding path program 1 times [2019-11-06 22:25:19,949 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:19,949 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523609112] [2019-11-06 22:25:19,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:20,150 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523609112] [2019-11-06 22:25:20,151 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:20,151 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:20,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985187113] [2019-11-06 22:25:20,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:20,152 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:20,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:20,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:20,153 INFO L87 Difference]: Start difference. First operand 574 states and 695 transitions. Second operand 10 states. [2019-11-06 22:25:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:22,246 INFO L93 Difference]: Finished difference Result 1372 states and 1756 transitions. [2019-11-06 22:25:22,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 22:25:22,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-11-06 22:25:22,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:22,252 INFO L225 Difference]: With dead ends: 1372 [2019-11-06 22:25:22,253 INFO L226 Difference]: Without dead ends: 820 [2019-11-06 22:25:22,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 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-11-06 22:25:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-11-06 22:25:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 604. [2019-11-06 22:25:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-11-06 22:25:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 725 transitions. [2019-11-06 22:25:22,317 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 725 transitions. Word has length 105 [2019-11-06 22:25:22,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:22,317 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 725 transitions. [2019-11-06 22:25:22,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 725 transitions. [2019-11-06 22:25:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:25:22,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:22,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:22,319 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:22,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:22,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1647869982, now seen corresponding path program 1 times [2019-11-06 22:25:22,320 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:22,320 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716659879] [2019-11-06 22:25:22,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:22,541 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716659879] [2019-11-06 22:25:22,541 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:22,541 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:22,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993468575] [2019-11-06 22:25:22,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:22,542 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:22,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:22,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:22,543 INFO L87 Difference]: Start difference. First operand 604 states and 725 transitions. Second operand 10 states. [2019-11-06 22:25:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:24,870 INFO L93 Difference]: Finished difference Result 1567 states and 2021 transitions. [2019-11-06 22:25:24,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 22:25:24,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-11-06 22:25:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:24,877 INFO L225 Difference]: With dead ends: 1567 [2019-11-06 22:25:24,877 INFO L226 Difference]: Without dead ends: 984 [2019-11-06 22:25:24,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-11-06 22:25:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-11-06 22:25:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 675. [2019-11-06 22:25:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2019-11-06 22:25:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 787 transitions. [2019-11-06 22:25:24,944 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 787 transitions. Word has length 105 [2019-11-06 22:25:24,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:24,945 INFO L462 AbstractCegarLoop]: Abstraction has 675 states and 787 transitions. [2019-11-06 22:25:24,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 787 transitions. [2019-11-06 22:25:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:25:24,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:24,946 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:24,947 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:24,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:24,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1585830368, now seen corresponding path program 1 times [2019-11-06 22:25:24,947 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:24,947 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562019414] [2019-11-06 22:25:24,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:25,082 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562019414] [2019-11-06 22:25:25,082 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:25,082 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 22:25:25,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291988716] [2019-11-06 22:25:25,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:25:25,083 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:25,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:25:25,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:25:25,084 INFO L87 Difference]: Start difference. First operand 675 states and 787 transitions. Second operand 7 states. [2019-11-06 22:25:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:27,271 INFO L93 Difference]: Finished difference Result 2210 states and 2715 transitions. [2019-11-06 22:25:27,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:25:27,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-11-06 22:25:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:27,279 INFO L225 Difference]: With dead ends: 2210 [2019-11-06 22:25:27,279 INFO L226 Difference]: Without dead ends: 1558 [2019-11-06 22:25:27,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:25:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-11-06 22:25:27,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1270. [2019-11-06 22:25:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2019-11-06 22:25:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1515 transitions. [2019-11-06 22:25:27,409 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1515 transitions. Word has length 105 [2019-11-06 22:25:27,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:27,410 INFO L462 AbstractCegarLoop]: Abstraction has 1270 states and 1515 transitions. [2019-11-06 22:25:27,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:25:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1515 transitions. [2019-11-06 22:25:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:25:27,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:27,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:27,412 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:27,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:27,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1038281626, now seen corresponding path program 1 times [2019-11-06 22:25:27,413 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:27,413 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531424194] [2019-11-06 22:25:27,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:27,556 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531424194] [2019-11-06 22:25:27,557 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:27,557 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 22:25:27,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588522088] [2019-11-06 22:25:27,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:25:27,558 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:27,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:25:27,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:25:27,559 INFO L87 Difference]: Start difference. First operand 1270 states and 1515 transitions. Second operand 7 states. [2019-11-06 22:25:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:30,835 INFO L93 Difference]: Finished difference Result 4250 states and 5488 transitions. [2019-11-06 22:25:30,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:25:30,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-11-06 22:25:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:30,855 INFO L225 Difference]: With dead ends: 4250 [2019-11-06 22:25:30,855 INFO L226 Difference]: Without dead ends: 3009 [2019-11-06 22:25:30,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:25:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2019-11-06 22:25:31,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 2578. [2019-11-06 22:25:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2019-11-06 22:25:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3192 transitions. [2019-11-06 22:25:31,317 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3192 transitions. Word has length 106 [2019-11-06 22:25:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:31,318 INFO L462 AbstractCegarLoop]: Abstraction has 2578 states and 3192 transitions. [2019-11-06 22:25:31,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:25:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3192 transitions. [2019-11-06 22:25:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-06 22:25:31,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:31,323 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:31,323 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:31,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1706050930, now seen corresponding path program 1 times [2019-11-06 22:25:31,324 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:31,324 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051077304] [2019-11-06 22:25:31,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-06 22:25:31,563 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051077304] [2019-11-06 22:25:31,563 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:31,563 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:25:31,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367381017] [2019-11-06 22:25:31,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:25:31,565 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:31,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:25:31,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:25:31,566 INFO L87 Difference]: Start difference. First operand 2578 states and 3192 transitions. Second operand 9 states.