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/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:50:53,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:50:53,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:50:53,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:50:53,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:50:53,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:50:53,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:50:53,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:50:53,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:50:53,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:50:53,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:50:53,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:50:53,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:50:53,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:50:53,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:50:53,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:50:53,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:50:53,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:50:53,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:50:53,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:50:53,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:50:53,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:50:53,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:50:53,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:50:53,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:50:53,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:50:53,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:50:53,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:50:53,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:50:53,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:50:53,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:50:53,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:50:53,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:50:53,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:50:53,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:50:53,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:50:53,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:50:53,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:50:53,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:50:53,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:50:53,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:50:53,989 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:50:54,002 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:50:54,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:50:54,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:50:54,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:50:54,004 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:50:54,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:50:54,004 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:50:54,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:50:54,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:50:54,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:50:54,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:50:54,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:50:54,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:50:54,006 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:50:54,006 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:50:54,006 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:50:54,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:50:54,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:50:54,007 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:50:54,007 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:50:54,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:50:54,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:54,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:50:54,008 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:50:54,008 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:50:54,008 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:50:54,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:50:54,009 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:50:54,009 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:50:54,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:50:54,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:50:54,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:50:54,315 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:50:54,315 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:50:54,316 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-10-13 19:50:54,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5d76360d/1ceba7fbe8654392b578e12a75cd705e/FLAG9f562aeba [2019-10-13 19:50:54,834 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:50:54,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-10-13 19:50:54,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5d76360d/1ceba7fbe8654392b578e12a75cd705e/FLAG9f562aeba [2019-10-13 19:50:55,210 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5d76360d/1ceba7fbe8654392b578e12a75cd705e [2019-10-13 19:50:55,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:50:55,222 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:50:55,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:55,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:50:55,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:50:55,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac9320a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55, skipping insertion in model container [2019-10-13 19:50:55,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,237 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:50:55,276 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:50:55,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:55,540 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:50:55,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:55,588 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:50:55,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55 WrapperNode [2019-10-13 19:50:55,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:55,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:50:55,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:50:55,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:50:55,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:50:55,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:50:55,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:50:55,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:50:55,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:55,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:50:55,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:50:55,786 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 19:50:55,787 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-10-13 19:50:55,787 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-10-13 19:50:55,788 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-10-13 19:50:55,788 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-10-13 19:50:55,788 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-10-13 19:50:55,789 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 19:50:55,789 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 19:50:55,789 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 19:50:55,789 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 19:50:55,789 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 19:50:55,789 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 19:50:55,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:50:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:50:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:50:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 19:50:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-10-13 19:50:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-10-13 19:50:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-10-13 19:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-10-13 19:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-10-13 19:50:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 19:50:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 19:50:55,793 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 19:50:55,795 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 19:50:55,795 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 19:50:55,795 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 19:50:55,795 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:50:55,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:50:55,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:50:56,220 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:50:56,221 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 19:50:56,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:56 BoogieIcfgContainer [2019-10-13 19:50:56,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:50:56,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:50:56,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:50:56,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:50:56,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:50:55" (1/3) ... [2019-10-13 19:50:56,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7905d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:56, skipping insertion in model container [2019-10-13 19:50:56,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (2/3) ... [2019-10-13 19:50:56,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7905d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:56, skipping insertion in model container [2019-10-13 19:50:56,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:56" (3/3) ... [2019-10-13 19:50:56,230 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-10-13 19:50:56,239 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:50:56,246 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:50:56,255 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:50:56,280 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:50:56,280 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:50:56,281 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:50:56,281 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:50:56,281 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:50:56,281 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:50:56,281 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:50:56,281 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:50:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-10-13 19:50:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 19:50:56,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,312 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] [2019-10-13 19:50:56,314 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,319 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2019-10-13 19:50:56,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357311394] [2019-10-13 19:50:56,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,808 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:50:56,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357311394] [2019-10-13 19:50:56,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:50:56,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250839122] [2019-10-13 19:50:56,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:50:56,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:50:56,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:56,832 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 6 states. [2019-10-13 19:50:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,924 INFO L93 Difference]: Finished difference Result 356 states and 554 transitions. [2019-10-13 19:50:57,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:50:57,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-13 19:50:57,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,952 INFO L225 Difference]: With dead ends: 356 [2019-10-13 19:50:57,953 INFO L226 Difference]: Without dead ends: 248 [2019-10-13 19:50:57,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:50:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-13 19:50:58,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 185. [2019-10-13 19:50:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-13 19:50:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 246 transitions. [2019-10-13 19:50:58,067 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 246 transitions. Word has length 65 [2019-10-13 19:50:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,068 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 246 transitions. [2019-10-13 19:50:58,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:50:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 246 transitions. [2019-10-13 19:50:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 19:50:58,073 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,074 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] [2019-10-13 19:50:58,074 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1537976919, now seen corresponding path program 1 times [2019-10-13 19:50:58,075 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849412597] [2019-10-13 19:50:58,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,289 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:50:58,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849412597] [2019-10-13 19:50:58,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:50:58,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998451395] [2019-10-13 19:50:58,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:50:58,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:50:58,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:50:58,293 INFO L87 Difference]: Start difference. First operand 185 states and 246 transitions. Second operand 7 states. [2019-10-13 19:50:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:58,905 INFO L93 Difference]: Finished difference Result 406 states and 562 transitions. [2019-10-13 19:50:58,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:50:58,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-10-13 19:50:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:58,911 INFO L225 Difference]: With dead ends: 406 [2019-10-13 19:50:58,911 INFO L226 Difference]: Without dead ends: 238 [2019-10-13 19:50:58,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:50:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-13 19:50:58,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 182. [2019-10-13 19:50:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-13 19:50:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 241 transitions. [2019-10-13 19:50:58,969 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 241 transitions. Word has length 66 [2019-10-13 19:50:58,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,969 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 241 transitions. [2019-10-13 19:50:58,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:50:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 241 transitions. [2019-10-13 19:50:58,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-13 19:50:58,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,972 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] [2019-10-13 19:50:58,973 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,973 INFO L82 PathProgramCache]: Analyzing trace with hash -478173211, now seen corresponding path program 1 times [2019-10-13 19:50:58,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123311456] [2019-10-13 19:50:58,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,245 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:50:59,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123311456] [2019-10-13 19:50:59,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:59,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 19:50:59,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512641027] [2019-10-13 19:50:59,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:50:59,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:59,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:50:59,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:50:59,249 INFO L87 Difference]: Start difference. First operand 182 states and 241 transitions. Second operand 9 states. [2019-10-13 19:51:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,372 INFO L93 Difference]: Finished difference Result 582 states and 869 transitions. [2019-10-13 19:51:00,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 19:51:00,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-10-13 19:51:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,378 INFO L225 Difference]: With dead ends: 582 [2019-10-13 19:51:00,378 INFO L226 Difference]: Without dead ends: 417 [2019-10-13 19:51:00,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-10-13 19:51:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-10-13 19:51:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 336. [2019-10-13 19:51:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-13 19:51:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 490 transitions. [2019-10-13 19:51:00,437 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 490 transitions. Word has length 72 [2019-10-13 19:51:00,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,437 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 490 transitions. [2019-10-13 19:51:00,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:51:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 490 transitions. [2019-10-13 19:51:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 19:51:00,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,440 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] [2019-10-13 19:51:00,440 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:00,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:00,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2098500188, now seen corresponding path program 1 times [2019-10-13 19:51:00,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:00,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436554551] [2019-10-13 19:51:00,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,670 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:00,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436554551] [2019-10-13 19:51:00,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:00,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 19:51:00,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837187565] [2019-10-13 19:51:00,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 19:51:00,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:00,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 19:51:00,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:51:00,674 INFO L87 Difference]: Start difference. First operand 336 states and 490 transitions. Second operand 12 states. [2019-10-13 19:51:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:03,421 INFO L93 Difference]: Finished difference Result 873 states and 1358 transitions. [2019-10-13 19:51:03,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-13 19:51:03,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-10-13 19:51:03,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:03,431 INFO L225 Difference]: With dead ends: 873 [2019-10-13 19:51:03,431 INFO L226 Difference]: Without dead ends: 554 [2019-10-13 19:51:03,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 19:51:03,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-13 19:51:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 211. [2019-10-13 19:51:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-13 19:51:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2019-10-13 19:51:03,498 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 73 [2019-10-13 19:51:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:03,499 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2019-10-13 19:51:03,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 19:51:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2019-10-13 19:51:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 19:51:03,500 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:03,500 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] [2019-10-13 19:51:03,500 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:03,502 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2019-10-13 19:51:03,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:03,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737026342] [2019-10-13 19:51:03,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,691 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:03,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737026342] [2019-10-13 19:51:03,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:03,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 19:51:03,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288070096] [2019-10-13 19:51:03,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 19:51:03,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:03,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 19:51:03,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:51:03,694 INFO L87 Difference]: Start difference. First operand 211 states and 276 transitions. Second operand 8 states. [2019-10-13 19:51:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:04,768 INFO L93 Difference]: Finished difference Result 612 states and 874 transitions. [2019-10-13 19:51:04,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:51:04,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-10-13 19:51:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:04,772 INFO L225 Difference]: With dead ends: 612 [2019-10-13 19:51:04,772 INFO L226 Difference]: Without dead ends: 418 [2019-10-13 19:51:04,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:51:04,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-13 19:51:04,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 323. [2019-10-13 19:51:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-10-13 19:51:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 419 transitions. [2019-10-13 19:51:04,810 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 419 transitions. Word has length 66 [2019-10-13 19:51:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:04,810 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 419 transitions. [2019-10-13 19:51:04,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 19:51:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 419 transitions. [2019-10-13 19:51:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 19:51:04,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:04,812 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] [2019-10-13 19:51:04,812 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:04,812 INFO L82 PathProgramCache]: Analyzing trace with hash -822318239, now seen corresponding path program 1 times [2019-10-13 19:51:04,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:04,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352643136] [2019-10-13 19:51:04,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,983 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:04,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352643136] [2019-10-13 19:51:04,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:04,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 19:51:04,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389839705] [2019-10-13 19:51:04,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:51:04,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:04,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:51:04,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:51:04,988 INFO L87 Difference]: Start difference. First operand 323 states and 419 transitions. Second operand 9 states. [2019-10-13 19:51:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:05,885 INFO L93 Difference]: Finished difference Result 727 states and 1002 transitions. [2019-10-13 19:51:05,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 19:51:05,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-10-13 19:51:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:05,890 INFO L225 Difference]: With dead ends: 727 [2019-10-13 19:51:05,890 INFO L226 Difference]: Without dead ends: 421 [2019-10-13 19:51:05,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:51:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-10-13 19:51:05,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 341. [2019-10-13 19:51:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-10-13 19:51:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 437 transitions. [2019-10-13 19:51:05,943 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 437 transitions. Word has length 66 [2019-10-13 19:51:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:05,944 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 437 transitions. [2019-10-13 19:51:05,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:51:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 437 transitions. [2019-10-13 19:51:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 19:51:05,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:05,946 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] [2019-10-13 19:51:05,946 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:05,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:05,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1843386593, now seen corresponding path program 1 times [2019-10-13 19:51:05,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:05,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856925312] [2019-10-13 19:51:05,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:05,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:05,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,124 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:06,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856925312] [2019-10-13 19:51:06,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:06,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 19:51:06,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699917441] [2019-10-13 19:51:06,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:51:06,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:06,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:51:06,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:51:06,129 INFO L87 Difference]: Start difference. First operand 341 states and 437 transitions. Second operand 9 states. [2019-10-13 19:51:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:08,810 INFO L93 Difference]: Finished difference Result 1164 states and 1617 transitions. [2019-10-13 19:51:08,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-13 19:51:08,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-10-13 19:51:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:08,820 INFO L225 Difference]: With dead ends: 1164 [2019-10-13 19:51:08,820 INFO L226 Difference]: Without dead ends: 840 [2019-10-13 19:51:08,825 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2019-10-13 19:51:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-10-13 19:51:08,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 643. [2019-10-13 19:51:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-13 19:51:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 815 transitions. [2019-10-13 19:51:08,964 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 815 transitions. Word has length 66 [2019-10-13 19:51:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:08,965 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 815 transitions. [2019-10-13 19:51:08,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:51:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 815 transitions. [2019-10-13 19:51:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 19:51:08,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:08,967 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] [2019-10-13 19:51:08,968 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:08,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1172255968, now seen corresponding path program 1 times [2019-10-13 19:51:08,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:08,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47527381] [2019-10-13 19:51:08,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:08,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:08,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,205 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:09,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47527381] [2019-10-13 19:51:09,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:09,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 19:51:09,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988570137] [2019-10-13 19:51:09,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:51:09,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:09,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:51:09,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:51:09,208 INFO L87 Difference]: Start difference. First operand 643 states and 815 transitions. Second operand 9 states. [2019-10-13 19:51:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:10,054 INFO L93 Difference]: Finished difference Result 1352 states and 1804 transitions. [2019-10-13 19:51:10,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:51:10,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-10-13 19:51:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:10,061 INFO L225 Difference]: With dead ends: 1352 [2019-10-13 19:51:10,061 INFO L226 Difference]: Without dead ends: 764 [2019-10-13 19:51:10,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:51:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-10-13 19:51:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 669. [2019-10-13 19:51:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-10-13 19:51:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 834 transitions. [2019-10-13 19:51:10,131 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 834 transitions. Word has length 66 [2019-10-13 19:51:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:10,132 INFO L462 AbstractCegarLoop]: Abstraction has 669 states and 834 transitions. [2019-10-13 19:51:10,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:51:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 834 transitions. [2019-10-13 19:51:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 19:51:10,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:10,136 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] [2019-10-13 19:51:10,136 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:10,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:10,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1347703966, now seen corresponding path program 1 times [2019-10-13 19:51:10,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:10,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695998724] [2019-10-13 19:51:10,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:10,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:10,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,316 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:10,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695998724] [2019-10-13 19:51:10,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:10,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:51:10,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144496024] [2019-10-13 19:51:10,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:51:10,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:10,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:51:10,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:51:10,320 INFO L87 Difference]: Start difference. First operand 669 states and 834 transitions. Second operand 7 states. [2019-10-13 19:51:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:11,177 INFO L93 Difference]: Finished difference Result 857 states and 1123 transitions. [2019-10-13 19:51:11,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:51:11,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-10-13 19:51:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:11,188 INFO L225 Difference]: With dead ends: 857 [2019-10-13 19:51:11,188 INFO L226 Difference]: Without dead ends: 854 [2019-10-13 19:51:11,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:51:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-10-13 19:51:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 745. [2019-10-13 19:51:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-10-13 19:51:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 951 transitions. [2019-10-13 19:51:11,296 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 951 transitions. Word has length 66 [2019-10-13 19:51:11,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:11,298 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 951 transitions. [2019-10-13 19:51:11,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:51:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 951 transitions. [2019-10-13 19:51:11,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-13 19:51:11,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:11,302 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] [2019-10-13 19:51:11,302 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:11,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:11,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1170545691, now seen corresponding path program 1 times [2019-10-13 19:51:11,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:11,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653689659] [2019-10-13 19:51:11,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:11,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:11,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,496 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:11,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653689659] [2019-10-13 19:51:11,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:11,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:51:11,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73935249] [2019-10-13 19:51:11,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:51:11,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:11,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:51:11,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:51:11,500 INFO L87 Difference]: Start difference. First operand 745 states and 951 transitions. Second operand 6 states. [2019-10-13 19:51:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:12,129 INFO L93 Difference]: Finished difference Result 1413 states and 1890 transitions. [2019-10-13 19:51:12,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:51:12,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-13 19:51:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:12,136 INFO L225 Difference]: With dead ends: 1413 [2019-10-13 19:51:12,137 INFO L226 Difference]: Without dead ends: 889 [2019-10-13 19:51:12,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:51:12,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2019-10-13 19:51:12,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 707. [2019-10-13 19:51:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-10-13 19:51:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 894 transitions. [2019-10-13 19:51:12,206 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 894 transitions. Word has length 67 [2019-10-13 19:51:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:12,207 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 894 transitions. [2019-10-13 19:51:12,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:51:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 894 transitions. [2019-10-13 19:51:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 19:51:12,209 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:12,209 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:12,209 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:12,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:12,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1338277302, now seen corresponding path program 1 times [2019-10-13 19:51:12,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:12,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574250962] [2019-10-13 19:51:12,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:12,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:12,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 19:51:12,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574250962] [2019-10-13 19:51:12,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996108130] [2019-10-13 19:51:12,381 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:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 19:51:12,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:12,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:12,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2019-10-13 19:51:12,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322470663] [2019-10-13 19:51:12,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:12,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:12,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:12,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:12,560 INFO L87 Difference]: Start difference. First operand 707 states and 894 transitions. Second operand 3 states. [2019-10-13 19:51:12,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:12,723 INFO L93 Difference]: Finished difference Result 1672 states and 2205 transitions. [2019-10-13 19:51:12,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:12,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-10-13 19:51:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:12,730 INFO L225 Difference]: With dead ends: 1672 [2019-10-13 19:51:12,730 INFO L226 Difference]: Without dead ends: 811 [2019-10-13 19:51:12,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-10-13 19:51:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2019-10-13 19:51:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-10-13 19:51:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1031 transitions. [2019-10-13 19:51:12,832 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1031 transitions. Word has length 87 [2019-10-13 19:51:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:12,832 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1031 transitions. [2019-10-13 19:51:12,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1031 transitions. [2019-10-13 19:51:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 19:51:12,835 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:12,835 INFO L380 BasicCegarLoop]: trace histogram [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:13,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:13,039 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:13,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:13,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2019-10-13 19:51:13,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:13,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300095310] [2019-10-13 19:51:13,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:13,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:13,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 19:51:13,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300095310] [2019-10-13 19:51:13,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968522177] [2019-10-13 19:51:13,334 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:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-13 19:51:13,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:13,631 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:13,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-10-13 19:51:13,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785066171] [2019-10-13 19:51:13,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-13 19:51:13,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:13,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-13 19:51:13,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-10-13 19:51:13,633 INFO L87 Difference]: Start difference. First operand 811 states and 1031 transitions. Second operand 16 states. [2019-10-13 19:51:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:18,137 INFO L93 Difference]: Finished difference Result 2540 states and 3915 transitions. [2019-10-13 19:51:18,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-13 19:51:18,138 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2019-10-13 19:51:18,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:18,155 INFO L225 Difference]: With dead ends: 2540 [2019-10-13 19:51:18,155 INFO L226 Difference]: Without dead ends: 2537 [2019-10-13 19:51:18,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=1674, Unknown=0, NotChecked=0, Total=1980 [2019-10-13 19:51:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2019-10-13 19:51:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2338. [2019-10-13 19:51:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2019-10-13 19:51:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3577 transitions. [2019-10-13 19:51:18,489 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3577 transitions. Word has length 99 [2019-10-13 19:51:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:18,490 INFO L462 AbstractCegarLoop]: Abstraction has 2338 states and 3577 transitions. [2019-10-13 19:51:18,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-13 19:51:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3577 transitions. [2019-10-13 19:51:18,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-13 19:51:18,499 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:18,499 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:18,713 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:18,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:18,714 INFO L82 PathProgramCache]: Analyzing trace with hash 83738947, now seen corresponding path program 2 times [2019-10-13 19:51:18,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:18,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965841540] [2019-10-13 19:51:18,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:18,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:18,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-13 19:51:18,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965841540] [2019-10-13 19:51:18,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:18,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:51:18,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514936501] [2019-10-13 19:51:18,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:51:18,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:18,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:51:18,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:51:18,932 INFO L87 Difference]: Start difference. First operand 2338 states and 3577 transitions. Second operand 7 states. [2019-10-13 19:51:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:19,752 INFO L93 Difference]: Finished difference Result 3773 states and 6055 transitions. [2019-10-13 19:51:19,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:51:19,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2019-10-13 19:51:19,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:19,770 INFO L225 Difference]: With dead ends: 3773 [2019-10-13 19:51:19,770 INFO L226 Difference]: Without dead ends: 2107 [2019-10-13 19:51:19,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:19,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2019-10-13 19:51:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 2006. [2019-10-13 19:51:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-10-13 19:51:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2998 transitions. [2019-10-13 19:51:20,117 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2998 transitions. Word has length 125 [2019-10-13 19:51:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:20,118 INFO L462 AbstractCegarLoop]: Abstraction has 2006 states and 2998 transitions. [2019-10-13 19:51:20,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:51:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2998 transitions. [2019-10-13 19:51:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 19:51:20,126 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:20,127 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 19:51:20,127 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:20,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:20,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1218823465, now seen corresponding path program 1 times [2019-10-13 19:51:20,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:20,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027968265] [2019-10-13 19:51:20,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:20,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:20,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-13 19:51:20,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027968265] [2019-10-13 19:51:20,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533684515] [2019-10-13 19:51:20,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 19:51:20,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 19:51:20,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:20,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2019-10-13 19:51:20,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303321968] [2019-10-13 19:51:20,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:20,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:20,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:51:20,685 INFO L87 Difference]: Start difference. First operand 2006 states and 2998 transitions. Second operand 3 states. [2019-10-13 19:51:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:20,771 INFO L93 Difference]: Finished difference Result 2401 states and 3609 transitions. [2019-10-13 19:51:20,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:20,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-10-13 19:51:20,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:20,772 INFO L225 Difference]: With dead ends: 2401 [2019-10-13 19:51:20,773 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:51:20,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 169 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:51:20,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:51:20,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:51:20,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:51:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:51:20,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2019-10-13 19:51:20,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:20,787 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:51:20,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:51:20,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:51:20,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:21,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:51:27,079 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 1