java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:51:19,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:51:19,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:51:19,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:51:19,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:51:19,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:51:19,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:51:19,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:51:19,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:51:19,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:51:19,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:51:19,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:51:19,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:51:19,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:51:19,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:51:19,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:51:19,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:51:19,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:51:19,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:51:19,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:51:19,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:51:19,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:51:19,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:51:19,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:51:19,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:51:19,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:51:19,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:51:19,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:51:19,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:51:19,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:51:19,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:51:19,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:51:19,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:51:19,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:51:19,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:51:19,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:51:19,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:51:19,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:51:19,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:51:19,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:51:19,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:51:19,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:51:20,023 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:51:20,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:51:20,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:51:20,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:51:20,027 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:51:20,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:51:20,028 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:51:20,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:51:20,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:51:20,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:51:20,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:51:20,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:51:20,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:51:20,032 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:51:20,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:51:20,033 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:51:20,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:51:20,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:51:20,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:51:20,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:51:20,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:51:20,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:51:20,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:51:20,037 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:51:20,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:51:20,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:51:20,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:51:20,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:51:20,038 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:51:20,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:51:20,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:51:20,338 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:51:20,340 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:51:20,340 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:51:20,341 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-10-13 19:51:20,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e138785/864223bb2501406f9632933e85d3786b/FLAG82d5c46a6 [2019-10-13 19:51:20,939 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:51:20,940 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-10-13 19:51:20,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e138785/864223bb2501406f9632933e85d3786b/FLAG82d5c46a6 [2019-10-13 19:51:21,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e138785/864223bb2501406f9632933e85d3786b [2019-10-13 19:51:21,295 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:51:21,297 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:51:21,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:51:21,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:51:21,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:51:21,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:51:21" (1/1) ... [2019-10-13 19:51:21,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@185bbd3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:21, skipping insertion in model container [2019-10-13 19:51:21,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:51:21" (1/1) ... [2019-10-13 19:51:21,317 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:51:21,367 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:51:21,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:51:21,637 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:51:21,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:51:21,804 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:51:21,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:21 WrapperNode [2019-10-13 19:51:21,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:51:21,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:51:21,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:51:21,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:51:21,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:21" (1/1) ... [2019-10-13 19:51:21,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:21" (1/1) ... [2019-10-13 19:51:21,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:21" (1/1) ... [2019-10-13 19:51:21,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:21" (1/1) ... [2019-10-13 19:51:21,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:21" (1/1) ... [2019-10-13 19:51:21,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:21" (1/1) ... [2019-10-13 19:51:21,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:21" (1/1) ... [2019-10-13 19:51:21,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:51:21,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:51:21,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:51:21,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:51:21,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:51:21,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:51:21,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:51:21,921 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 19:51:21,921 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-13 19:51:21,921 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-13 19:51:21,922 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-13 19:51:21,922 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-13 19:51:21,922 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-13 19:51:21,922 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-13 19:51:21,922 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-13 19:51:21,922 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 19:51:21,923 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 19:51:21,923 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 19:51:21,923 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-13 19:51:21,923 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-13 19:51:21,923 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-13 19:51:21,924 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-13 19:51:21,924 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-13 19:51:21,924 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-13 19:51:21,924 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 19:51:21,924 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 19:51:21,924 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 19:51:21,925 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:51:21,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:51:21,925 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 19:51:21,925 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-13 19:51:21,925 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-13 19:51:21,925 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-13 19:51:21,926 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-13 19:51:21,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:51:21,926 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-13 19:51:21,926 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-13 19:51:21,926 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-13 19:51:21,926 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-13 19:51:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 19:51:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 19:51:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 19:51:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-13 19:51:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-13 19:51:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-13 19:51:21,928 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-13 19:51:21,928 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-13 19:51:21,928 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 19:51:21,928 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 19:51:21,928 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 19:51:21,928 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:51:21,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:51:21,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:51:22,527 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:51:22,527 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-13 19:51:22,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:22 BoogieIcfgContainer [2019-10-13 19:51:22,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:51:22,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:51:22,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:51:22,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:51:22,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:51:21" (1/3) ... [2019-10-13 19:51:22,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e6ca2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:51:22, skipping insertion in model container [2019-10-13 19:51:22,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:21" (2/3) ... [2019-10-13 19:51:22,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e6ca2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:51:22, skipping insertion in model container [2019-10-13 19:51:22,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:22" (3/3) ... [2019-10-13 19:51:22,547 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2019-10-13 19:51:22,558 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:51:22,579 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:51:22,590 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:51:22,629 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:51:22,630 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:51:22,630 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:51:22,630 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:51:22,630 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:51:22,630 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:51:22,631 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:51:22,631 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:51:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2019-10-13 19:51:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 19:51:22,664 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:22,665 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:22,667 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:22,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:22,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1715943758, now seen corresponding path program 1 times [2019-10-13 19:51:22,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:22,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938757791] [2019-10-13 19:51:22,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:22,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:22,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:23,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938757791] [2019-10-13 19:51:23,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:23,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:23,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958730433] [2019-10-13 19:51:23,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:23,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:23,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:23,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:23,344 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 10 states. [2019-10-13 19:51:25,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:25,260 INFO L93 Difference]: Finished difference Result 422 states and 652 transitions. [2019-10-13 19:51:25,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:51:25,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-10-13 19:51:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:25,280 INFO L225 Difference]: With dead ends: 422 [2019-10-13 19:51:25,280 INFO L226 Difference]: Without dead ends: 256 [2019-10-13 19:51:25,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-10-13 19:51:25,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-13 19:51:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2019-10-13 19:51:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-13 19:51:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2019-10-13 19:51:25,370 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2019-10-13 19:51:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:25,371 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2019-10-13 19:51:25,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2019-10-13 19:51:25,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 19:51:25,376 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:25,376 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:25,376 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:25,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:25,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1625083380, now seen corresponding path program 1 times [2019-10-13 19:51:25,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:25,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785027824] [2019-10-13 19:51:25,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:25,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:25,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:25,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785027824] [2019-10-13 19:51:25,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:25,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:25,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375714604] [2019-10-13 19:51:25,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:25,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:25,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:25,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:25,709 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 10 states. [2019-10-13 19:51:27,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:27,104 INFO L93 Difference]: Finished difference Result 401 states and 576 transitions. [2019-10-13 19:51:27,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:51:27,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-10-13 19:51:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:27,109 INFO L225 Difference]: With dead ends: 401 [2019-10-13 19:51:27,109 INFO L226 Difference]: Without dead ends: 256 [2019-10-13 19:51:27,111 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:51:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-13 19:51:27,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2019-10-13 19:51:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-13 19:51:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2019-10-13 19:51:27,145 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 91 [2019-10-13 19:51:27,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:27,145 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2019-10-13 19:51:27,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2019-10-13 19:51:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 19:51:27,150 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:27,150 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:27,152 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:27,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:27,153 INFO L82 PathProgramCache]: Analyzing trace with hash -918009072, now seen corresponding path program 1 times [2019-10-13 19:51:27,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:27,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348134771] [2019-10-13 19:51:27,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:27,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:27,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:27,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348134771] [2019-10-13 19:51:27,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:27,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:27,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687107486] [2019-10-13 19:51:27,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:27,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:27,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:27,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:27,411 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand 10 states. [2019-10-13 19:51:29,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:29,396 INFO L93 Difference]: Finished difference Result 480 states and 713 transitions. [2019-10-13 19:51:29,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:29,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-10-13 19:51:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:29,401 INFO L225 Difference]: With dead ends: 480 [2019-10-13 19:51:29,401 INFO L226 Difference]: Without dead ends: 335 [2019-10-13 19:51:29,403 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 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-10-13 19:51:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-10-13 19:51:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 201. [2019-10-13 19:51:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-13 19:51:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 257 transitions. [2019-10-13 19:51:29,439 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 257 transitions. Word has length 91 [2019-10-13 19:51:29,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:29,440 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 257 transitions. [2019-10-13 19:51:29,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:29,440 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 257 transitions. [2019-10-13 19:51:29,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 19:51:29,442 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:29,442 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:29,443 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:29,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:29,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1347669555, now seen corresponding path program 1 times [2019-10-13 19:51:29,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:29,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037993582] [2019-10-13 19:51:29,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:29,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:29,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:29,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037993582] [2019-10-13 19:51:29,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:29,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:29,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484709329] [2019-10-13 19:51:29,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:29,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:29,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:29,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:29,626 INFO L87 Difference]: Start difference. First operand 201 states and 257 transitions. Second operand 10 states. [2019-10-13 19:51:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:31,565 INFO L93 Difference]: Finished difference Result 562 states and 806 transitions. [2019-10-13 19:51:31,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 19:51:31,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-10-13 19:51:31,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:31,576 INFO L225 Difference]: With dead ends: 562 [2019-10-13 19:51:31,577 INFO L226 Difference]: Without dead ends: 381 [2019-10-13 19:51:31,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-10-13 19:51:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-10-13 19:51:31,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 237. [2019-10-13 19:51:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-10-13 19:51:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 295 transitions. [2019-10-13 19:51:31,614 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 295 transitions. Word has length 91 [2019-10-13 19:51:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:31,615 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 295 transitions. [2019-10-13 19:51:31,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:31,615 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 295 transitions. [2019-10-13 19:51:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 19:51:31,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:31,617 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:31,618 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:31,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:31,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1401666513, now seen corresponding path program 1 times [2019-10-13 19:51:31,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:31,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272389552] [2019-10-13 19:51:31,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:31,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:31,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:31,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272389552] [2019-10-13 19:51:31,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:31,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:31,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677638644] [2019-10-13 19:51:31,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:31,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:31,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:31,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:31,807 INFO L87 Difference]: Start difference. First operand 237 states and 295 transitions. Second operand 10 states. [2019-10-13 19:51:33,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:33,642 INFO L93 Difference]: Finished difference Result 639 states and 888 transitions. [2019-10-13 19:51:33,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:33,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-10-13 19:51:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:33,645 INFO L225 Difference]: With dead ends: 639 [2019-10-13 19:51:33,645 INFO L226 Difference]: Without dead ends: 422 [2019-10-13 19:51:33,646 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:51:33,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-10-13 19:51:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 270. [2019-10-13 19:51:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-10-13 19:51:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 328 transitions. [2019-10-13 19:51:33,681 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 328 transitions. Word has length 91 [2019-10-13 19:51:33,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:33,682 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 328 transitions. [2019-10-13 19:51:33,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:33,682 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 328 transitions. [2019-10-13 19:51:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 19:51:33,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:33,684 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:33,684 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:33,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:33,685 INFO L82 PathProgramCache]: Analyzing trace with hash 256331726, now seen corresponding path program 1 times [2019-10-13 19:51:33,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:33,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98798313] [2019-10-13 19:51:33,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:33,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:33,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:33,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98798313] [2019-10-13 19:51:33,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:33,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:33,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401847159] [2019-10-13 19:51:33,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:33,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:33,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:33,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:33,888 INFO L87 Difference]: Start difference. First operand 270 states and 328 transitions. Second operand 10 states. [2019-10-13 19:51:35,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:35,803 INFO L93 Difference]: Finished difference Result 650 states and 843 transitions. [2019-10-13 19:51:35,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 19:51:35,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-10-13 19:51:35,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:35,807 INFO L225 Difference]: With dead ends: 650 [2019-10-13 19:51:35,807 INFO L226 Difference]: Without dead ends: 401 [2019-10-13 19:51:35,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-13 19:51:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-10-13 19:51:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 275. [2019-10-13 19:51:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-13 19:51:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 330 transitions. [2019-10-13 19:51:35,840 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 330 transitions. Word has length 91 [2019-10-13 19:51:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:35,840 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 330 transitions. [2019-10-13 19:51:35,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 330 transitions. [2019-10-13 19:51:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 19:51:35,842 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:35,842 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:35,843 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:35,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:35,843 INFO L82 PathProgramCache]: Analyzing trace with hash 504478220, now seen corresponding path program 1 times [2019-10-13 19:51:35,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:35,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087057355] [2019-10-13 19:51:35,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:35,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:35,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:36,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087057355] [2019-10-13 19:51:36,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:36,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:36,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641992398] [2019-10-13 19:51:36,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:36,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:36,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:36,056 INFO L87 Difference]: Start difference. First operand 275 states and 330 transitions. Second operand 10 states. [2019-10-13 19:51:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:38,392 INFO L93 Difference]: Finished difference Result 1032 states and 1299 transitions. [2019-10-13 19:51:38,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 19:51:38,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-10-13 19:51:38,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:38,402 INFO L225 Difference]: With dead ends: 1032 [2019-10-13 19:51:38,403 INFO L226 Difference]: Without dead ends: 777 [2019-10-13 19:51:38,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-10-13 19:51:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2019-10-13 19:51:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 568. [2019-10-13 19:51:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-13 19:51:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 674 transitions. [2019-10-13 19:51:38,503 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 674 transitions. Word has length 91 [2019-10-13 19:51:38,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:38,504 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 674 transitions. [2019-10-13 19:51:38,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 674 transitions. [2019-10-13 19:51:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 19:51:38,505 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:38,505 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:38,506 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:38,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:38,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1890681614, now seen corresponding path program 1 times [2019-10-13 19:51:38,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:38,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354728265] [2019-10-13 19:51:38,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:38,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:38,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:38,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354728265] [2019-10-13 19:51:38,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:38,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:51:38,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384617086] [2019-10-13 19:51:38,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:51:38,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:38,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:51:38,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:51:38,719 INFO L87 Difference]: Start difference. First operand 568 states and 674 transitions. Second operand 7 states. [2019-10-13 19:51:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:40,613 INFO L93 Difference]: Finished difference Result 2003 states and 2570 transitions. [2019-10-13 19:51:40,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:51:40,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-10-13 19:51:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:40,624 INFO L225 Difference]: With dead ends: 2003 [2019-10-13 19:51:40,624 INFO L226 Difference]: Without dead ends: 1456 [2019-10-13 19:51:40,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 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-10-13 19:51:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-10-13 19:51:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1182. [2019-10-13 19:51:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2019-10-13 19:51:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1460 transitions. [2019-10-13 19:51:40,754 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1460 transitions. Word has length 91 [2019-10-13 19:51:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:40,755 INFO L462 AbstractCegarLoop]: Abstraction has 1182 states and 1460 transitions. [2019-10-13 19:51:40,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:51:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1460 transitions. [2019-10-13 19:51:40,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 19:51:40,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:40,759 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:40,759 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:40,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:40,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1914461978, now seen corresponding path program 1 times [2019-10-13 19:51:40,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:40,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820519597] [2019-10-13 19:51:40,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:40,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:40,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-13 19:51:40,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820519597] [2019-10-13 19:51:40,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:40,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 19:51:40,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620539609] [2019-10-13 19:51:40,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:51:40,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:40,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:51:40,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:51:40,965 INFO L87 Difference]: Start difference. First operand 1182 states and 1460 transitions. Second operand 9 states. [2019-10-13 19:51:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:43,798 INFO L93 Difference]: Finished difference Result 3800 states and 4907 transitions. [2019-10-13 19:51:43,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 19:51:43,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 145 [2019-10-13 19:51:43,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:43,816 INFO L225 Difference]: With dead ends: 3800 [2019-10-13 19:51:43,816 INFO L226 Difference]: Without dead ends: 2640 [2019-10-13 19:51:43,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-10-13 19:51:43,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2019-10-13 19:51:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2272. [2019-10-13 19:51:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2019-10-13 19:51:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2899 transitions. [2019-10-13 19:51:44,059 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2899 transitions. Word has length 145 [2019-10-13 19:51:44,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:44,061 INFO L462 AbstractCegarLoop]: Abstraction has 2272 states and 2899 transitions. [2019-10-13 19:51:44,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:51:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2899 transitions. [2019-10-13 19:51:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-13 19:51:44,070 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:44,070 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:44,071 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:44,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1988983491, now seen corresponding path program 1 times [2019-10-13 19:51:44,072 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:44,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24704448] [2019-10-13 19:51:44,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:44,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:44,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-13 19:51:44,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24704448] [2019-10-13 19:51:44,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:44,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:44,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234322521] [2019-10-13 19:51:44,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:44,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:44,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:44,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:44,427 INFO L87 Difference]: Start difference. First operand 2272 states and 2899 transitions. Second operand 10 states. [2019-10-13 19:51:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:46,992 INFO L93 Difference]: Finished difference Result 6824 states and 9500 transitions. [2019-10-13 19:51:46,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:46,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2019-10-13 19:51:46,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:47,021 INFO L225 Difference]: With dead ends: 6824 [2019-10-13 19:51:47,022 INFO L226 Difference]: Without dead ends: 4579 [2019-10-13 19:51:47,040 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:51:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4579 states. [2019-10-13 19:51:47,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4579 to 4160. [2019-10-13 19:51:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2019-10-13 19:51:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 5275 transitions. [2019-10-13 19:51:47,574 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 5275 transitions. Word has length 189 [2019-10-13 19:51:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:47,575 INFO L462 AbstractCegarLoop]: Abstraction has 4160 states and 5275 transitions. [2019-10-13 19:51:47,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 5275 transitions. [2019-10-13 19:51:47,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-13 19:51:47,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:47,584 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:47,584 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:47,584 INFO L82 PathProgramCache]: Analyzing trace with hash 591399379, now seen corresponding path program 1 times [2019-10-13 19:51:47,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:47,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66626794] [2019-10-13 19:51:47,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:47,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:47,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 36 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-13 19:51:47,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66626794] [2019-10-13 19:51:47,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818747488] [2019-10-13 19:51:47,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:48,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 19:51:48,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:48,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2019-10-13 19:51:48,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153660016] [2019-10-13 19:51:48,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:48,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:48,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:48,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:51:48,152 INFO L87 Difference]: Start difference. First operand 4160 states and 5275 transitions. Second operand 3 states. [2019-10-13 19:51:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:48,845 INFO L93 Difference]: Finished difference Result 11446 states and 15659 transitions. [2019-10-13 19:51:48,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:48,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-13 19:51:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:48,900 INFO L225 Difference]: With dead ends: 11446 [2019-10-13 19:51:48,901 INFO L226 Difference]: Without dead ends: 7315 [2019-10-13 19:51:48,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:51:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7315 states. [2019-10-13 19:51:49,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7315 to 7296. [2019-10-13 19:51:49,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7296 states. [2019-10-13 19:51:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7296 states to 7296 states and 9509 transitions. [2019-10-13 19:51:49,783 INFO L78 Accepts]: Start accepts. Automaton has 7296 states and 9509 transitions. Word has length 190 [2019-10-13 19:51:49,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:49,784 INFO L462 AbstractCegarLoop]: Abstraction has 7296 states and 9509 transitions. [2019-10-13 19:51:49,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:49,784 INFO L276 IsEmpty]: Start isEmpty. Operand 7296 states and 9509 transitions. [2019-10-13 19:51:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-10-13 19:51:49,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:49,799 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-13 19:51:50,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:50,005 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:50,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:50,006 INFO L82 PathProgramCache]: Analyzing trace with hash 185140710, now seen corresponding path program 1 times [2019-10-13 19:51:50,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:50,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117603334] [2019-10-13 19:51:50,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:50,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:50,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-10-13 19:51:50,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117603334] [2019-10-13 19:51:50,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:50,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:50,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711229588] [2019-10-13 19:51:50,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:50,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:50,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:50,326 INFO L87 Difference]: Start difference. First operand 7296 states and 9509 transitions. Second operand 10 states. [2019-10-13 19:51:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:52,718 INFO L93 Difference]: Finished difference Result 15155 states and 19995 transitions. [2019-10-13 19:51:52,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:51:52,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 269 [2019-10-13 19:51:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:52,773 INFO L225 Difference]: With dead ends: 15155 [2019-10-13 19:51:52,773 INFO L226 Difference]: Without dead ends: 7880 [2019-10-13 19:51:52,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-10-13 19:51:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7880 states. [2019-10-13 19:51:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7880 to 7380. [2019-10-13 19:51:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7380 states. [2019-10-13 19:51:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7380 states to 7380 states and 9631 transitions. [2019-10-13 19:51:53,446 INFO L78 Accepts]: Start accepts. Automaton has 7380 states and 9631 transitions. Word has length 269 [2019-10-13 19:51:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:53,447 INFO L462 AbstractCegarLoop]: Abstraction has 7380 states and 9631 transitions. [2019-10-13 19:51:53,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:53,447 INFO L276 IsEmpty]: Start isEmpty. Operand 7380 states and 9631 transitions. [2019-10-13 19:51:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-13 19:51:53,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:53,457 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:53,457 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:53,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:53,458 INFO L82 PathProgramCache]: Analyzing trace with hash -77392378, now seen corresponding path program 1 times [2019-10-13 19:51:53,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:53,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928326188] [2019-10-13 19:51:53,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:53,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:53,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,794 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-10-13 19:51:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 36 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-13 19:51:53,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928326188] [2019-10-13 19:51:53,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141524234] [2019-10-13 19:51:53,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 19:51:54,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 13 proven. 63 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 19:51:54,403 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:54,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-10-13 19:51:54,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298779832] [2019-10-13 19:51:54,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-13 19:51:54,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:54,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-13 19:51:54,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-13 19:51:54,409 INFO L87 Difference]: Start difference. First operand 7380 states and 9631 transitions. Second operand 16 states.