/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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.2.0-b8ad66e [2020-10-23 18:53:21,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 18:53:21,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 18:53:21,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 18:53:21,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 18:53:21,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 18:53:21,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 18:53:21,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 18:53:21,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 18:53:21,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 18:53:21,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 18:53:21,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 18:53:21,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 18:53:22,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 18:53:22,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 18:53:22,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 18:53:22,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 18:53:22,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 18:53:22,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 18:53:22,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 18:53:22,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 18:53:22,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 18:53:22,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 18:53:22,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 18:53:22,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 18:53:22,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 18:53:22,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 18:53:22,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 18:53:22,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 18:53:22,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 18:53:22,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 18:53:22,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 18:53:22,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 18:53:22,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 18:53:22,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 18:53:22,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 18:53:22,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 18:53:22,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 18:53:22,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 18:53:22,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 18:53:22,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 18:53:22,084 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 [2020-10-23 18:53:22,147 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 18:53:22,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 18:53:22,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-23 18:53:22,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-23 18:53:22,153 INFO L138 SettingsManager]: * Use SBE=true [2020-10-23 18:53:22,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 18:53:22,154 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 18:53:22,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 18:53:22,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 18:53:22,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 18:53:22,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 18:53:22,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 18:53:22,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 18:53:22,157 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 18:53:22,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 18:53:22,157 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 18:53:22,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 18:53:22,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 18:53:22,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-23 18:53:22,158 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 18:53:22,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 18:53:22,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 18:53:22,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 18:53:22,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-23 18:53:22,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-23 18:53:22,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-23 18:53:22,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-23 18:53:22,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 18:53:22,161 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-23 18:53:22,161 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 18:53:22,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 18:53:22,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 18:53:22,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 18:53:22,702 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 18:53:22,703 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 18:53:22,704 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-10-23 18:53:22,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2c94dda/149f2b8db7ce429cae527558de9285da/FLAGcde7501ad [2020-10-23 18:53:23,505 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 18:53:23,506 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-10-23 18:53:23,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2c94dda/149f2b8db7ce429cae527558de9285da/FLAGcde7501ad [2020-10-23 18:53:23,850 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2c94dda/149f2b8db7ce429cae527558de9285da [2020-10-23 18:53:23,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 18:53:23,863 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 18:53:23,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 18:53:23,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 18:53:23,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 18:53:23,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:53:23" (1/1) ... [2020-10-23 18:53:23,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd600c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:23, skipping insertion in model container [2020-10-23 18:53:23,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:53:23" (1/1) ... [2020-10-23 18:53:23,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 18:53:23,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 18:53:24,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:53:24,166 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 18:53:24,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:53:24,226 INFO L208 MainTranslator]: Completed translation [2020-10-23 18:53:24,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:24 WrapperNode [2020-10-23 18:53:24,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 18:53:24,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 18:53:24,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 18:53:24,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 18:53:24,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:24" (1/1) ... [2020-10-23 18:53:24,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:24" (1/1) ... [2020-10-23 18:53:24,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:24" (1/1) ... [2020-10-23 18:53:24,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:24" (1/1) ... [2020-10-23 18:53:24,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:24" (1/1) ... [2020-10-23 18:53:24,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:24" (1/1) ... [2020-10-23 18:53:24,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:24" (1/1) ... [2020-10-23 18:53:24,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 18:53:24,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 18:53:24,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 18:53:24,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 18:53:24,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:24" (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 [2020-10-23 18:53:24,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 18:53:24,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 18:53:24,382 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 18:53:24,382 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-10-23 18:53:24,383 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-10-23 18:53:24,383 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-10-23 18:53:24,383 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-10-23 18:53:24,383 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-10-23 18:53:24,383 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-10-23 18:53:24,384 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-10-23 18:53:24,384 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-10-23 18:53:24,384 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-10-23 18:53:24,385 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-10-23 18:53:24,386 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-10-23 18:53:24,386 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-10-23 18:53:24,387 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 18:53:24,387 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 18:53:24,387 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 18:53:24,387 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 18:53:24,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 18:53:24,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 18:53:24,388 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-10-23 18:53:24,388 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-10-23 18:53:24,388 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-10-23 18:53:24,388 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-10-23 18:53:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-10-23 18:53:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-10-23 18:53:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-10-23 18:53:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-10-23 18:53:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-10-23 18:53:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-10-23 18:53:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-10-23 18:53:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-10-23 18:53:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 18:53:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 18:53:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 18:53:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 18:53:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 18:53:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 18:53:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 18:53:24,950 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 18:53:24,951 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-10-23 18:53:24,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:53:24 BoogieIcfgContainer [2020-10-23 18:53:24,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 18:53:24,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 18:53:24,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 18:53:24,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 18:53:24,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:53:23" (1/3) ... [2020-10-23 18:53:24,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc0e6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:53:24, skipping insertion in model container [2020-10-23 18:53:24,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:24" (2/3) ... [2020-10-23 18:53:24,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc0e6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:53:24, skipping insertion in model container [2020-10-23 18:53:24,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:53:24" (3/3) ... [2020-10-23 18:53:24,970 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-10-23 18:53:24,985 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-23 18:53:24,991 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 18:53:25,011 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 18:53:25,061 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 18:53:25,061 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 18:53:25,061 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-23 18:53:25,061 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 18:53:25,062 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 18:53:25,062 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 18:53:25,062 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 18:53:25,062 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 18:53:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2020-10-23 18:53:25,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-23 18:53:25,098 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:25,099 INFO L422 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] [2020-10-23 18:53:25,100 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:25,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:25,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1379772032, now seen corresponding path program 1 times [2020-10-23 18:53:25,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:25,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085479550] [2020-10-23 18:53:25,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:25,710 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-10-23 18:53:25,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:25,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:25,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:25,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:25,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-23 18:53:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:25,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:25,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:53:25,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085479550] [2020-10-23 18:53:25,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:53:25,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:53:25,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282020160] [2020-10-23 18:53:25,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:53:25,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:25,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:53:25,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-23 18:53:25,884 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 6 states. [2020-10-23 18:53:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:27,457 INFO L93 Difference]: Finished difference Result 362 states and 562 transitions. [2020-10-23 18:53:27,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:53:27,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-10-23 18:53:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:27,478 INFO L225 Difference]: With dead ends: 362 [2020-10-23 18:53:27,478 INFO L226 Difference]: Without dead ends: 250 [2020-10-23 18:53:27,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:53:27,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-10-23 18:53:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 186. [2020-10-23 18:53:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-10-23 18:53:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 247 transitions. [2020-10-23 18:53:27,592 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 247 transitions. Word has length 66 [2020-10-23 18:53:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:27,593 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 247 transitions. [2020-10-23 18:53:27,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:53:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 247 transitions. [2020-10-23 18:53:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-23 18:53:27,599 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:27,599 INFO L422 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] [2020-10-23 18:53:27,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 18:53:27,600 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:27,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:27,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1159353771, now seen corresponding path program 1 times [2020-10-23 18:53:27,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:27,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140797651] [2020-10-23 18:53:27,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:27,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:27,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:27,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:27,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:27,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-10-23 18:53:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:27,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:27,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:53:27,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140797651] [2020-10-23 18:53:27,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:53:27,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 18:53:27,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664938949] [2020-10-23 18:53:27,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 18:53:27,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:27,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 18:53:27,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-23 18:53:27,921 INFO L87 Difference]: Start difference. First operand 186 states and 247 transitions. Second operand 7 states. [2020-10-23 18:53:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:28,706 INFO L93 Difference]: Finished difference Result 408 states and 564 transitions. [2020-10-23 18:53:28,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:53:28,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2020-10-23 18:53:28,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:28,712 INFO L225 Difference]: With dead ends: 408 [2020-10-23 18:53:28,712 INFO L226 Difference]: Without dead ends: 239 [2020-10-23 18:53:28,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:53:28,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-10-23 18:53:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 183. [2020-10-23 18:53:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-23 18:53:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 242 transitions. [2020-10-23 18:53:28,759 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 242 transitions. Word has length 67 [2020-10-23 18:53:28,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:28,760 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 242 transitions. [2020-10-23 18:53:28,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 18:53:28,760 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 242 transitions. [2020-10-23 18:53:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-23 18:53:28,764 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:28,764 INFO L422 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] [2020-10-23 18:53:28,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 18:53:28,765 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:28,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:28,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1279577159, now seen corresponding path program 1 times [2020-10-23 18:53:28,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:28,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450911231] [2020-10-23 18:53:28,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:28,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:28,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:28,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:28,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:29,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-23 18:53:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:29,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-23 18:53:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:29,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:29,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:53:29,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450911231] [2020-10-23 18:53:29,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:53:29,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-23 18:53:29,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504713884] [2020-10-23 18:53:29,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 18:53:29,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:29,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 18:53:29,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:53:29,148 INFO L87 Difference]: Start difference. First operand 183 states and 242 transitions. Second operand 14 states. [2020-10-23 18:53:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:32,911 INFO L93 Difference]: Finished difference Result 865 states and 1338 transitions. [2020-10-23 18:53:32,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-10-23 18:53:32,912 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2020-10-23 18:53:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:32,920 INFO L225 Difference]: With dead ends: 865 [2020-10-23 18:53:32,921 INFO L226 Difference]: Without dead ends: 699 [2020-10-23 18:53:32,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=377, Invalid=1785, Unknown=0, NotChecked=0, Total=2162 [2020-10-23 18:53:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2020-10-23 18:53:33,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 466. [2020-10-23 18:53:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-10-23 18:53:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 663 transitions. [2020-10-23 18:53:33,033 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 663 transitions. Word has length 73 [2020-10-23 18:53:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:33,033 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 663 transitions. [2020-10-23 18:53:33,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 18:53:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 663 transitions. [2020-10-23 18:53:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-23 18:53:33,036 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:33,037 INFO L422 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] [2020-10-23 18:53:33,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 18:53:33,037 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:33,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:33,038 INFO L82 PathProgramCache]: Analyzing trace with hash -110854073, now seen corresponding path program 1 times [2020-10-23 18:53:33,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:33,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989017131] [2020-10-23 18:53:33,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:33,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:33,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:33,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:33,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:33,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-10-23 18:53:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:33,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:33,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:53:33,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989017131] [2020-10-23 18:53:33,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:53:33,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:53:33,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066682617] [2020-10-23 18:53:33,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:53:33,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:33,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:53:33,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-23 18:53:33,258 INFO L87 Difference]: Start difference. First operand 466 states and 663 transitions. Second operand 6 states. [2020-10-23 18:53:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:34,305 INFO L93 Difference]: Finished difference Result 1350 states and 2013 transitions. [2020-10-23 18:53:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:53:34,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2020-10-23 18:53:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:34,319 INFO L225 Difference]: With dead ends: 1350 [2020-10-23 18:53:34,319 INFO L226 Difference]: Without dead ends: 901 [2020-10-23 18:53:34,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:53:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2020-10-23 18:53:34,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 743. [2020-10-23 18:53:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2020-10-23 18:53:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1054 transitions. [2020-10-23 18:53:34,497 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1054 transitions. Word has length 67 [2020-10-23 18:53:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:34,497 INFO L481 AbstractCegarLoop]: Abstraction has 743 states and 1054 transitions. [2020-10-23 18:53:34,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:53:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1054 transitions. [2020-10-23 18:53:34,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-23 18:53:34,509 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:34,509 INFO L422 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] [2020-10-23 18:53:34,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 18:53:34,510 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:34,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash -708580500, now seen corresponding path program 1 times [2020-10-23 18:53:34,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:34,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448799764] [2020-10-23 18:53:34,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:34,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:34,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:34,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:34,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:34,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-10-23 18:53:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:34,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-10-23 18:53:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:34,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:53:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:34,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:34,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-23 18:53:34,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448799764] [2020-10-23 18:53:34,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:53:34,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 18:53:34,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159821396] [2020-10-23 18:53:34,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 18:53:34,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:34,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 18:53:34,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-23 18:53:34,790 INFO L87 Difference]: Start difference. First operand 743 states and 1054 transitions. Second operand 7 states. [2020-10-23 18:53:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:35,918 INFO L93 Difference]: Finished difference Result 1930 states and 2883 transitions. [2020-10-23 18:53:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:53:35,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2020-10-23 18:53:35,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:35,930 INFO L225 Difference]: With dead ends: 1930 [2020-10-23 18:53:35,930 INFO L226 Difference]: Without dead ends: 1208 [2020-10-23 18:53:35,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:53:35,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-10-23 18:53:36,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1096. [2020-10-23 18:53:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2020-10-23 18:53:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1573 transitions. [2020-10-23 18:53:36,142 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1573 transitions. Word has length 87 [2020-10-23 18:53:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:36,143 INFO L481 AbstractCegarLoop]: Abstraction has 1096 states and 1573 transitions. [2020-10-23 18:53:36,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 18:53:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1573 transitions. [2020-10-23 18:53:36,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-23 18:53:36,150 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:36,150 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:53:36,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 18:53:36,150 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:36,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:36,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1583944108, now seen corresponding path program 1 times [2020-10-23 18:53:36,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:36,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095977397] [2020-10-23 18:53:36,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:36,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:36,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:36,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:36,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:36,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-23 18:53:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:36,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:53:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:36,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:36,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:36,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 18:53:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:36,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:36,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-10-23 18:53:36,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095977397] [2020-10-23 18:53:36,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159448571] [2020-10-23 18:53:36,531 INFO L95 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 [2020-10-23 18:53:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:36,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-23 18:53:36,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:53:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-23 18:53:36,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:53:36,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2020-10-23 18:53:36,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606422894] [2020-10-23 18:53:36,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:53:36,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:36,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:53:36,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:53:36,864 INFO L87 Difference]: Start difference. First operand 1096 states and 1573 transitions. Second operand 3 states. [2020-10-23 18:53:37,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:37,321 INFO L93 Difference]: Finished difference Result 2125 states and 3232 transitions. [2020-10-23 18:53:37,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:53:37,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-10-23 18:53:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:37,337 INFO L225 Difference]: With dead ends: 2125 [2020-10-23 18:53:37,338 INFO L226 Difference]: Without dead ends: 1096 [2020-10-23 18:53:37,353 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:53:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2020-10-23 18:53:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1096. [2020-10-23 18:53:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2020-10-23 18:53:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1565 transitions. [2020-10-23 18:53:37,597 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1565 transitions. Word has length 98 [2020-10-23 18:53:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:37,597 INFO L481 AbstractCegarLoop]: Abstraction has 1096 states and 1565 transitions. [2020-10-23 18:53:37,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:53:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1565 transitions. [2020-10-23 18:53:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-10-23 18:53:37,601 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:37,604 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:53:37,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-10-23 18:53:37,819 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:37,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:37,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1271486918, now seen corresponding path program 1 times [2020-10-23 18:53:37,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:37,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979637719] [2020-10-23 18:53:37,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:37,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:38,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:38,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:38,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:38,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-10-23 18:53:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:38,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-10-23 18:53:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:38,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-23 18:53:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:38,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:53:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:38,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:38,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:38,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-23 18:53:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:38,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:38,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-23 18:53:38,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979637719] [2020-10-23 18:53:38,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638137755] [2020-10-23 18:53:38,201 INFO L95 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 [2020-10-23 18:53:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:38,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-23 18:53:38,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:53:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-10-23 18:53:38,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:53:38,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-10-23 18:53:38,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428781] [2020-10-23 18:53:38,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:53:38,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:38,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:53:38,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:53:38,454 INFO L87 Difference]: Start difference. First operand 1096 states and 1565 transitions. Second operand 3 states. [2020-10-23 18:53:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:38,649 INFO L93 Difference]: Finished difference Result 1902 states and 2868 transitions. [2020-10-23 18:53:38,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:53:38,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-10-23 18:53:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:38,659 INFO L225 Difference]: With dead ends: 1902 [2020-10-23 18:53:38,659 INFO L226 Difference]: Without dead ends: 873 [2020-10-23 18:53:38,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:53:38,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2020-10-23 18:53:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 866. [2020-10-23 18:53:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2020-10-23 18:53:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1175 transitions. [2020-10-23 18:53:38,833 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1175 transitions. Word has length 118 [2020-10-23 18:53:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:38,833 INFO L481 AbstractCegarLoop]: Abstraction has 866 states and 1175 transitions. [2020-10-23 18:53:38,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:53:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1175 transitions. [2020-10-23 18:53:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-23 18:53:38,837 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:38,837 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:53:39,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:53:39,051 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:39,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash 178594704, now seen corresponding path program 1 times [2020-10-23 18:53:39,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:39,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410251782] [2020-10-23 18:53:39,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:39,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:39,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:39,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:39,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:39,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-23 18:53:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:39,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:53:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:39,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:39,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:39,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-10-23 18:53:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:39,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:39,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:39,400 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-23 18:53:39,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410251782] [2020-10-23 18:53:39,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738177857] [2020-10-23 18:53:39,402 INFO L95 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 [2020-10-23 18:53:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:39,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-23 18:53:39,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:53:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:53:39,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:53:39,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2020-10-23 18:53:39,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267135364] [2020-10-23 18:53:39,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:53:39,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:39,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:53:39,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:53:39,597 INFO L87 Difference]: Start difference. First operand 866 states and 1175 transitions. Second operand 12 states. [2020-10-23 18:53:40,354 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-23 18:53:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:42,104 INFO L93 Difference]: Finished difference Result 1790 states and 2589 transitions. [2020-10-23 18:53:42,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-23 18:53:42,105 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2020-10-23 18:53:42,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:42,115 INFO L225 Difference]: With dead ends: 1790 [2020-10-23 18:53:42,115 INFO L226 Difference]: Without dead ends: 1010 [2020-10-23 18:53:42,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2020-10-23 18:53:42,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2020-10-23 18:53:42,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 938. [2020-10-23 18:53:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2020-10-23 18:53:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1269 transitions. [2020-10-23 18:53:42,270 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1269 transitions. Word has length 99 [2020-10-23 18:53:42,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:42,270 INFO L481 AbstractCegarLoop]: Abstraction has 938 states and 1269 transitions. [2020-10-23 18:53:42,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:53:42,270 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1269 transitions. [2020-10-23 18:53:42,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-23 18:53:42,274 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:42,274 INFO L422 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, 1] [2020-10-23 18:53:42,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:53:42,488 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:42,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:42,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1675690692, now seen corresponding path program 1 times [2020-10-23 18:53:42,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:42,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191365284] [2020-10-23 18:53:42,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:42,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:42,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:42,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:42,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:42,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-23 18:53:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:42,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:53:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:42,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:42,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:42,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-10-23 18:53:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:42,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:42,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-23 18:53:42,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191365284] [2020-10-23 18:53:42,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87961539] [2020-10-23 18:53:42,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:53:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:42,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 33 conjunts are in the unsatisfiable core [2020-10-23 18:53:42,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:53:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:53:43,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:53:43,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2020-10-23 18:53:43,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861546533] [2020-10-23 18:53:43,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-23 18:53:43,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:43,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-23 18:53:43,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-10-23 18:53:43,027 INFO L87 Difference]: Start difference. First operand 938 states and 1269 transitions. Second operand 16 states. [2020-10-23 18:53:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:47,931 INFO L93 Difference]: Finished difference Result 3070 states and 4672 transitions. [2020-10-23 18:53:47,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-10-23 18:53:47,932 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 100 [2020-10-23 18:53:47,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:47,950 INFO L225 Difference]: With dead ends: 3070 [2020-10-23 18:53:47,950 INFO L226 Difference]: Without dead ends: 2060 [2020-10-23 18:53:47,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=400, Invalid=2252, Unknown=0, NotChecked=0, Total=2652 [2020-10-23 18:53:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2020-10-23 18:53:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1910. [2020-10-23 18:53:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2020-10-23 18:53:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2760 transitions. [2020-10-23 18:53:48,235 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2760 transitions. Word has length 100 [2020-10-23 18:53:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:48,235 INFO L481 AbstractCegarLoop]: Abstraction has 1910 states and 2760 transitions. [2020-10-23 18:53:48,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-23 18:53:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2760 transitions. [2020-10-23 18:53:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-10-23 18:53:48,242 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:48,242 INFO L422 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, 1] [2020-10-23 18:53:48,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:53:48,456 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:48,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1757734131, now seen corresponding path program 1 times [2020-10-23 18:53:48,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:48,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117487910] [2020-10-23 18:53:48,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-23 18:53:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:53:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:53:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-10-23 18:53:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-10-23 18:53:48,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117487910] [2020-10-23 18:53:48,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:53:48,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 18:53:48,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33153554] [2020-10-23 18:53:48,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 18:53:48,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:48,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 18:53:48,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-23 18:53:48,703 INFO L87 Difference]: Start difference. First operand 1910 states and 2760 transitions. Second operand 7 states. [2020-10-23 18:53:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:49,842 INFO L93 Difference]: Finished difference Result 2873 states and 4302 transitions. [2020-10-23 18:53:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:53:49,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2020-10-23 18:53:49,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:49,858 INFO L225 Difference]: With dead ends: 2873 [2020-10-23 18:53:49,858 INFO L226 Difference]: Without dead ends: 1633 [2020-10-23 18:53:49,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:53:49,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2020-10-23 18:53:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1526. [2020-10-23 18:53:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1526 states. [2020-10-23 18:53:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2048 transitions. [2020-10-23 18:53:50,093 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2048 transitions. Word has length 126 [2020-10-23 18:53:50,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:50,093 INFO L481 AbstractCegarLoop]: Abstraction has 1526 states and 2048 transitions. [2020-10-23 18:53:50,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 18:53:50,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2048 transitions. [2020-10-23 18:53:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-23 18:53:50,099 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:50,099 INFO L422 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, 1, 1] [2020-10-23 18:53:50,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 18:53:50,100 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:50,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:50,100 INFO L82 PathProgramCache]: Analyzing trace with hash -935626536, now seen corresponding path program 1 times [2020-10-23 18:53:50,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:50,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701492798] [2020-10-23 18:53:50,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-23 18:53:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:53:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-10-23 18:53:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-23 18:53:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:53:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-23 18:53:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-10-23 18:53:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-10-23 18:53:50,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701492798] [2020-10-23 18:53:50,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618824613] [2020-10-23 18:53:50,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:53:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:50,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-23 18:53:50,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:53:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-10-23 18:53:50,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:53:50,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-10-23 18:53:50,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930453091] [2020-10-23 18:53:50,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:53:50,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:50,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:53:50,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:53:50,630 INFO L87 Difference]: Start difference. First operand 1526 states and 2048 transitions. Second operand 3 states. [2020-10-23 18:53:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:50,743 INFO L93 Difference]: Finished difference Result 1855 states and 2458 transitions. [2020-10-23 18:53:50,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:53:50,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2020-10-23 18:53:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:50,748 INFO L225 Difference]: With dead ends: 1855 [2020-10-23 18:53:50,749 INFO L226 Difference]: Without dead ends: 531 [2020-10-23 18:53:50,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:53:50,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-10-23 18:53:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 511. [2020-10-23 18:53:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2020-10-23 18:53:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 577 transitions. [2020-10-23 18:53:50,820 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 577 transitions. Word has length 144 [2020-10-23 18:53:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:50,821 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 577 transitions. [2020-10-23 18:53:50,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:53:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 577 transitions. [2020-10-23 18:53:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-10-23 18:53:50,826 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:50,826 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:53:51,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-23 18:53:51,041 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash -22308829, now seen corresponding path program 1 times [2020-10-23 18:53:51,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:51,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44122361] [2020-10-23 18:53:51,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:53:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:53:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 18:53:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-23 18:53:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:53:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-10-23 18:53:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-10-23 18:53:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-10-23 18:53:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2020-10-23 18:53:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-10-23 18:53:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-10-23 18:53:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-10-23 18:53:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:53:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-23 18:53:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2020-10-23 18:53:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 61 proven. 11 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2020-10-23 18:53:51,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44122361] [2020-10-23 18:53:51,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786604215] [2020-10-23 18:53:51,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:53:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:51,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-23 18:53:51,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:53:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2020-10-23 18:53:51,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:53:51,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-10-23 18:53:51,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251507006] [2020-10-23 18:53:51,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:53:51,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:51,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:53:51,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:53:51,760 INFO L87 Difference]: Start difference. First operand 511 states and 577 transitions. Second operand 3 states. [2020-10-23 18:53:51,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:51,814 INFO L93 Difference]: Finished difference Result 1024 states and 1174 transitions. [2020-10-23 18:53:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:53:51,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2020-10-23 18:53:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:51,824 INFO L225 Difference]: With dead ends: 1024 [2020-10-23 18:53:51,824 INFO L226 Difference]: Without dead ends: 534 [2020-10-23 18:53:51,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:53:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-10-23 18:53:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 511. [2020-10-23 18:53:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2020-10-23 18:53:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 567 transitions. [2020-10-23 18:53:51,890 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 567 transitions. Word has length 244 [2020-10-23 18:53:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:51,890 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 567 transitions. [2020-10-23 18:53:51,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:53:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 567 transitions. [2020-10-23 18:53:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-10-23 18:53:51,894 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:51,894 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:53:52,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:53:52,109 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:52,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash 259661770, now seen corresponding path program 1 times [2020-10-23 18:53:52,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:52,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384712890] [2020-10-23 18:53:52,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:53:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:53:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:53:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-10-23 18:53:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-23 18:53:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-10-23 18:53:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-10-23 18:53:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-10-23 18:53:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-10-23 18:53:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-10-23 18:53:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:53:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-23 18:53:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2020-10-23 18:53:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 44 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2020-10-23 18:53:52,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384712890] [2020-10-23 18:53:52,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589691856] [2020-10-23 18:53:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:53:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:52,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-23 18:53:52,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:53:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-10-23 18:53:52,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:53:52,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 14 [2020-10-23 18:53:52,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084991942] [2020-10-23 18:53:52,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:53:52,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:52,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:53:52,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:53:52,872 INFO L87 Difference]: Start difference. First operand 511 states and 567 transitions. Second operand 6 states. [2020-10-23 18:53:52,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:52,994 INFO L93 Difference]: Finished difference Result 769 states and 845 transitions. [2020-10-23 18:53:52,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 18:53:52,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2020-10-23 18:53:52,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:52,999 INFO L225 Difference]: With dead ends: 769 [2020-10-23 18:53:53,000 INFO L226 Difference]: Without dead ends: 439 [2020-10-23 18:53:53,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-10-23 18:53:53,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-10-23 18:53:53,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 436. [2020-10-23 18:53:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-10-23 18:53:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 471 transitions. [2020-10-23 18:53:53,092 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 471 transitions. Word has length 225 [2020-10-23 18:53:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:53,093 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 471 transitions. [2020-10-23 18:53:53,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:53:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 471 transitions. [2020-10-23 18:53:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-10-23 18:53:53,096 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:53,096 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:53:53,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:53:53,310 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:53,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:53,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1801032216, now seen corresponding path program 1 times [2020-10-23 18:53:53,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:53,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497113922] [2020-10-23 18:53:53,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-23 18:53:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:53:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-10-23 18:53:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-10-23 18:53:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-10-23 18:53:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-23 18:53:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:53:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-23 18:53:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-10-23 18:53:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 39 proven. 13 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-10-23 18:53:53,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497113922] [2020-10-23 18:53:53,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293764032] [2020-10-23 18:53:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:53:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:53,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-23 18:53:53,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:53:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-23 18:53:54,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:53:54,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 13 [2020-10-23 18:53:54,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752406707] [2020-10-23 18:53:54,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:53:54,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:54,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:53:54,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:53:54,004 INFO L87 Difference]: Start difference. First operand 436 states and 471 transitions. Second operand 3 states. [2020-10-23 18:53:54,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:54,065 INFO L93 Difference]: Finished difference Result 603 states and 651 transitions. [2020-10-23 18:53:54,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:53:54,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2020-10-23 18:53:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:54,070 INFO L225 Difference]: With dead ends: 603 [2020-10-23 18:53:54,070 INFO L226 Difference]: Without dead ends: 399 [2020-10-23 18:53:54,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:53:54,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2020-10-23 18:53:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 394. [2020-10-23 18:53:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-10-23 18:53:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 425 transitions. [2020-10-23 18:53:54,126 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 425 transitions. Word has length 180 [2020-10-23 18:53:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:54,129 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 425 transitions. [2020-10-23 18:53:54,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:53:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 425 transitions. [2020-10-23 18:53:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-10-23 18:53:54,132 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:54,132 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:53:54,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-10-23 18:53:54,347 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:54,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:54,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1112736867, now seen corresponding path program 1 times [2020-10-23 18:53:54,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:54,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316462771] [2020-10-23 18:53:54,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-23 18:53:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:53:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-10-23 18:53:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-10-23 18:53:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-10-23 18:53:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-23 18:53:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:53:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-23 18:53:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-10-23 18:53:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-10-23 18:53:54,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316462771] [2020-10-23 18:53:54,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398452607] [2020-10-23 18:53:54,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:53:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:54,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-23 18:53:54,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:53:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2020-10-23 18:53:54,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:53:54,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-10-23 18:53:54,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167272899] [2020-10-23 18:53:54,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:53:54,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:54,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:53:54,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:53:54,976 INFO L87 Difference]: Start difference. First operand 394 states and 425 transitions. Second operand 3 states. [2020-10-23 18:53:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:55,055 INFO L93 Difference]: Finished difference Result 563 states and 615 transitions. [2020-10-23 18:53:55,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:53:55,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2020-10-23 18:53:55,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:55,059 INFO L225 Difference]: With dead ends: 563 [2020-10-23 18:53:55,059 INFO L226 Difference]: Without dead ends: 395 [2020-10-23 18:53:55,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 218 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:53:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2020-10-23 18:53:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 390. [2020-10-23 18:53:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-10-23 18:53:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 416 transitions. [2020-10-23 18:53:55,121 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 416 transitions. Word has length 180 [2020-10-23 18:53:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:55,122 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 416 transitions. [2020-10-23 18:53:55,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:53:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 416 transitions. [2020-10-23 18:53:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-10-23 18:53:55,125 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:55,126 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:53:55,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-10-23 18:53:55,340 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:55,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:55,340 INFO L82 PathProgramCache]: Analyzing trace with hash -722371558, now seen corresponding path program 2 times [2020-10-23 18:53:55,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:55,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673585673] [2020-10-23 18:53:55,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-23 18:53:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:53:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-10-23 18:53:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-10-23 18:53:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-10-23 18:53:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-23 18:53:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:53:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-23 18:53:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-10-23 18:53:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 45 proven. 1 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-10-23 18:53:55,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673585673] [2020-10-23 18:53:55,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106594009] [2020-10-23 18:53:55,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:53:55,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-23 18:53:55,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 18:53:55,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-23 18:53:55,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:53:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-10-23 18:53:55,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:53:55,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-10-23 18:53:55,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633511982] [2020-10-23 18:53:55,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:53:55,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:55,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:53:55,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:53:55,910 INFO L87 Difference]: Start difference. First operand 390 states and 416 transitions. Second operand 3 states. [2020-10-23 18:53:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:53:55,970 INFO L93 Difference]: Finished difference Result 517 states and 554 transitions. [2020-10-23 18:53:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:53:55,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2020-10-23 18:53:55,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:53:55,974 INFO L225 Difference]: With dead ends: 517 [2020-10-23 18:53:55,974 INFO L226 Difference]: Without dead ends: 375 [2020-10-23 18:53:55,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:53:55,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-10-23 18:53:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2020-10-23 18:53:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-10-23 18:53:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 395 transitions. [2020-10-23 18:53:56,034 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 395 transitions. Word has length 180 [2020-10-23 18:53:56,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:53:56,034 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 395 transitions. [2020-10-23 18:53:56,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:53:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 395 transitions. [2020-10-23 18:53:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-10-23 18:53:56,037 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:53:56,037 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:53:56,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-10-23 18:53:56,253 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:53:56,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:53:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash -387773456, now seen corresponding path program 1 times [2020-10-23 18:53:56,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:53:56,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197319519] [2020-10-23 18:53:56,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:53:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:53:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:53:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:53:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:53:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-23 18:53:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:53:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-10-23 18:53:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-10-23 18:53:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-10-23 18:53:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-23 18:53:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:53:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-23 18:53:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-10-23 18:53:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:53:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:53:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2020-10-23 18:53:56,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197319519] [2020-10-23 18:53:56,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929095421] [2020-10-23 18:53:56,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:53:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:53:56,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 45 conjunts are in the unsatisfiable core [2020-10-23 18:53:56,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:53:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:53:57,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:53:57,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2020-10-23 18:53:57,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518699106] [2020-10-23 18:53:57,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-23 18:53:57,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:53:57,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-23 18:53:57,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2020-10-23 18:53:57,321 INFO L87 Difference]: Start difference. First operand 375 states and 395 transitions. Second operand 25 states. [2020-10-23 18:54:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:54:00,543 INFO L93 Difference]: Finished difference Result 513 states and 543 transitions. [2020-10-23 18:54:00,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-10-23 18:54:00,544 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 181 [2020-10-23 18:54:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:54:00,545 INFO L225 Difference]: With dead ends: 513 [2020-10-23 18:54:00,545 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 18:54:00,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=397, Invalid=2683, Unknown=0, NotChecked=0, Total=3080 [2020-10-23 18:54:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 18:54:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 18:54:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 18:54:00,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 18:54:00,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 181 [2020-10-23 18:54:00,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:54:00,554 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 18:54:00,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-23 18:54:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 18:54:00,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 18:54:00,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-10-23 18:54:00,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 18:54:02,400 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 152 [2020-10-23 18:54:03,891 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 152 [2020-10-23 18:54:04,185 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2020-10-23 18:54:08,043 WARN L193 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 77 [2020-10-23 18:54:08,990 WARN L193 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 79 [2020-10-23 18:54:09,489 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2020-10-23 18:54:10,055 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 49 [2020-10-23 18:54:10,185 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2020-10-23 18:54:10,497 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2020-10-23 18:54:10,660 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2020-10-23 18:54:10,838 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2020-10-23 18:54:10,966 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2020-10-23 18:54:12,394 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 189 DAG size of output: 120 [2020-10-23 18:54:13,456 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 149 DAG size of output: 72 [2020-10-23 18:54:14,224 WARN L193 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 73 [2020-10-23 18:54:15,315 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 157 DAG size of output: 77 [2020-10-23 18:54:16,044 WARN L193 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2020-10-23 18:54:17,468 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 189 DAG size of output: 120 [2020-10-23 18:54:18,315 WARN L193 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2020-10-23 18:54:19,272 WARN L193 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 90 [2020-10-23 18:54:19,435 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2020-10-23 18:54:19,600 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 1 [2020-10-23 18:54:20,734 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 183 DAG size of output: 96 [2020-10-23 18:54:20,860 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-10-23 18:54:21,750 WARN L193 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2020-10-23 18:54:22,032 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2020-10-23 18:54:22,706 WARN L193 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 92 [2020-10-23 18:54:23,309 WARN L193 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2020-10-23 18:54:23,455 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2020-10-23 18:54:23,574 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2020-10-23 18:54:23,693 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 43 [2020-10-23 18:54:24,214 WARN L193 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 84 [2020-10-23 18:54:24,338 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 1 [2020-10-23 18:54:25,645 WARN L193 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 212 DAG size of output: 85 [2020-10-23 18:54:25,961 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2020-10-23 18:54:26,738 WARN L193 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 73 [2020-10-23 18:54:27,881 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 150 DAG size of output: 90 [2020-10-23 18:54:28,755 WARN L193 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 65 [2020-10-23 18:54:28,896 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2020-10-23 18:54:28,902 INFO L274 CegarLoopResult]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2020-10-23 18:54:28,903 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-23 18:54:28,903 INFO L274 CegarLoopResult]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2020-10-23 18:54:28,903 INFO L274 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-23 18:54:28,903 INFO L274 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 212 231) no Hoare annotation was computed. [2020-10-23 18:54:28,903 INFO L274 CegarLoopResult]: For program point L220(lines 220 225) no Hoare annotation was computed. [2020-10-23 18:54:28,903 INFO L274 CegarLoopResult]: For program point L216(lines 216 226) no Hoare annotation was computed. [2020-10-23 18:54:28,903 INFO L277 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 212 231) the Hoare annotation is: true [2020-10-23 18:54:28,904 INFO L270 CegarLoopResult]: At program point L228(lines 215 230) the Hoare annotation is: (let ((.cse15 (<= 1 exists_runnable_thread_~__retres1~2))) (let ((.cse10 (not (= ~p_num_write~0 0))) (.cse3 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~c_dr_pc~0 0))) (.cse14 (not (= ~c_dr_st~0 0))) (.cse16 (not (<= 2 ~p_dw_st~0))) (.cse17 (not (= ~q_free~0 0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse4 (not (<= 2 ~q_read_ev~0))) (.cse5 (not (= ~c_dr_st~0 2))) (.cse12 (not (<= 2 ~q_write_ev~0))) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse9 (not (= ~c_dr_pc~0 1))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (and (<= exists_runnable_thread_~__retres1~2 1) .cse15)) (.cse11 (not (= ~q_free~0 1))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~p_dw_pc~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse0 .cse2 .cse1 .cse3 .cse11 .cse5 .cse4 .cse6 .cse12 .cse13) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 .cse13) (or .cse10 .cse14 .cse0 .cse2 .cse1 .cse3 .cse11 .cse4 .cse6 .cse7 .cse12 .cse13) (or .cse14 .cse1 .cse3 .cse4 .cse15 .cse6 .cse7 .cse12 .cse16 .cse8 (not (= ~p_num_write~0 1)) .cse17) (let ((.cse18 (+ ~c_num_read~0 1))) (or .cse9 .cse14 .cse1 (not (<= ~p_num_write~0 .cse18)) (not (<= .cse18 ~p_num_write~0)) .cse4 .cse6 .cse15 .cse12 .cse16 .cse8 .cse17)) (or .cse0 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse4 .cse5 .cse12 .cse13 .cse9 (not (<= ~c_num_read~0 ~p_num_write~0)) .cse1 .cse2 .cse11 .cse6 .cse8)))) [2020-10-23 18:54:28,904 INFO L274 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 212 231) no Hoare annotation was computed. [2020-10-23 18:54:28,904 INFO L274 CegarLoopResult]: For program point L203-1(lines 194 211) no Hoare annotation was computed. [2020-10-23 18:54:28,904 INFO L274 CegarLoopResult]: For program point init_threadsEXIT(lines 194 211) no Hoare annotation was computed. [2020-10-23 18:54:28,905 INFO L270 CegarLoopResult]: At program point init_threadsENTRY(lines 194 211) the Hoare annotation is: (or (not (= ~p_num_write~0 0)) (not (= ~p_dw_i~0 1)) (not (= |old(~c_dr_st~0)| 0)) (not (= ~c_num_read~0 0)) (and (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~p_dw_st~0 0)) (not (= ~q_free~0 1)) (not (<= 2 ~q_read_ev~0)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= ~c_dr_pc~0 0)) (not (= |old(~p_dw_st~0)| 0)) (not (<= 2 ~q_write_ev~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-10-23 18:54:28,905 INFO L274 CegarLoopResult]: For program point L198-1(lines 197 210) no Hoare annotation was computed. [2020-10-23 18:54:28,905 INFO L270 CegarLoopResult]: At program point mainENTRY(lines 351 362) the Hoare annotation is: (or (not (= |old(~c_dr_pc~0)| 0)) (not (= |old(~c_dr_st~0)| 0)) (= |old(~p_dw_i~0)| 1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~c_dr_pc~0 0) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~c_num_read~0 0) (= ~p_dw_st~0 0) (= |old(~q_free~0)| ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= |old(~c_num_read~0)| 0))) [2020-10-23 18:54:28,905 INFO L274 CegarLoopResult]: For program point mainFINAL(lines 351 362) no Hoare annotation was computed. [2020-10-23 18:54:28,905 INFO L274 CegarLoopResult]: For program point mainEXIT(lines 351 362) no Hoare annotation was computed. [2020-10-23 18:54:28,905 INFO L274 CegarLoopResult]: For program point L357(line 357) no Hoare annotation was computed. [2020-10-23 18:54:28,906 INFO L270 CegarLoopResult]: At program point L356(line 356) the Hoare annotation is: (or (not (= |old(~c_dr_pc~0)| 0)) (not (= |old(~c_dr_st~0)| 0)) (= |old(~p_dw_i~0)| 1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~c_dr_pc~0 0) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~c_num_read~0 0) (= ~p_dw_st~0 0) (= |old(~q_free~0)| ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= |old(~c_num_read~0)| 0))) [2020-10-23 18:54:28,906 INFO L270 CegarLoopResult]: At program point L356-1(line 356) the Hoare annotation is: (or (not (= |old(~c_dr_pc~0)| 0)) (and (<= 2 ~q_write_ev~0) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~q_read_ev~0) (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= |old(~c_dr_st~0)| 0)) (= |old(~p_dw_i~0)| 1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= |old(~c_num_read~0)| 0))) [2020-10-23 18:54:28,906 INFO L270 CegarLoopResult]: At program point do_write_pENTRY(lines 93 135) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse20 (= ~c_dr_st~0 2)) (.cse3 (= |old(~q_free~0)| ~q_free~0)) (.cse4 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse5 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse6 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse7 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse8 (= ~p_num_write~0 |old(~p_num_write~0)|))) (let ((.cse16 (not (= ~c_dr_pc~0 1))) (.cse0 (not (<= 2 |old(~q_write_ev~0)|))) (.cse19 (not (= |old(~p_dw_pc~0)| 1))) (.cse1 (not (= |old(~q_free~0)| 1))) (.cse9 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse10 (not (= ~p_dw_i~0 1))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (<= 2 ~q_read_ev~0))) (.cse17 (and .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (.cse13 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse14 (not (= |old(~p_num_write~0)| 0))) (.cse15 (not (= ~c_dr_pc~0 0))) (.cse18 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 (= ~c_dr_st~0 |old(~c_dr_st~0)|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 (not (= |old(~c_dr_st~0)| 0)) .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse16 .cse0 .cse1 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse18) (or .cse16 .cse0 .cse19 .cse10 .cse12 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse13 .cse18 (and .cse20 (= ~p_last_write~0 ~q_buf_0~0) .cse3 (= ~p_dw_pc~0 1) .cse4 .cse5 .cse6 .cse8) (not (<= ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse19 .cse10 .cse11 .cse17 .cse12 .cse13 .cse15 .cse18) (or .cse1 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13 .cse14 .cse15 .cse18)))) [2020-10-23 18:54:28,907 INFO L270 CegarLoopResult]: At program point L126(line 126) the Hoare annotation is: (let ((.cse7 (= ~p_dw_pc~0 1)) (.cse2 (not (= |old(~p_dw_pc~0)| 1))) (.cse14 (not (= ~c_dr_pc~0 0))) (.cse0 (not (= ~c_dr_pc~0 1))) (.cse1 (not (<= 2 |old(~q_write_ev~0)|))) (.cse15 (not (= |old(~q_free~0)| 1))) (.cse16 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse13 (not (= ~c_num_read~0 0))) (.cse10 (not (<= 2 ~q_read_ev~0))) (.cse3 (= ~q_free~0 0)) (.cse5 (= ~c_dr_st~0 2)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse17 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0)) (.cse11 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse18 (not (= |old(~p_num_write~0)| 0))) (.cse12 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 (let ((.cse4 (+ ~c_num_read~0 1))) (and .cse3 (<= .cse4 ~p_num_write~0) .cse5 (<= ~p_num_write~0 .cse4) .cse6 .cse7 .cse8)) .cse9 .cse10 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse11 .cse12 (not (<= ~c_num_read~0 |old(~p_num_write~0)|))) (or (and .cse5 .cse6 .cse7 .cse8) .cse2 .cse9 .cse13 .cse10 .cse11 .cse14 .cse12) (or .cse1 .cse15 .cse16 .cse9 (not (= |old(~c_dr_st~0)| 0)) .cse13 (and .cse3 .cse6 .cse8 (= ~c_dr_st~0 0) .cse17) .cse10 .cse11 .cse18 .cse14) (or .cse15 (and .cse5 .cse6 .cse8) .cse16 .cse9 .cse13 .cse10 .cse11 .cse18 .cse14 .cse12) (or .cse0 .cse1 .cse15 .cse16 .cse9 .cse13 .cse10 (and .cse3 .cse5 .cse6 .cse8 .cse17) .cse11 .cse18 .cse12))) [2020-10-23 18:54:28,907 INFO L274 CegarLoopResult]: For program point L126-1(line 126) no Hoare annotation was computed. [2020-10-23 18:54:28,907 INFO L274 CegarLoopResult]: For program point L110(lines 109 129) no Hoare annotation was computed. [2020-10-23 18:54:28,907 INFO L274 CegarLoopResult]: For program point do_write_pEXIT(lines 93 135) no Hoare annotation was computed. [2020-10-23 18:54:28,908 INFO L270 CegarLoopResult]: At program point L111(lines 97 134) the Hoare annotation is: (let ((.cse15 (= ~c_dr_pc~0 0)) (.cse13 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse24 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse19 (= |old(~q_free~0)| ~q_free~0)) (.cse20 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse21 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse25 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse22 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse23 (= ~p_dw_i~0 1))) (let ((.cse14 (or (and .cse24 .cse19 .cse20 .cse21 .cse25 .cse23 .cse22) (and .cse23 (not (= ~q_free~0 0))))) (.cse3 (and .cse24 (= ~c_dr_st~0 |old(~c_dr_st~0)|) .cse19 .cse13 .cse20 .cse21 .cse25 .cse22)) (.cse2 (not (= |old(~q_free~0)| 1))) (.cse4 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse6 (not (= ~c_num_read~0 0))) (.cse9 (not (= |old(~p_num_write~0)| 0))) (.cse16 (not .cse15)) (.cse0 (not (= ~c_dr_pc~0 1))) (.cse1 (not (<= 2 |old(~q_write_ev~0)|))) (.cse11 (= ~c_dr_st~0 2)) (.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= ~p_dw_pc~0 1)) (.cse17 (not (= |old(~p_dw_pc~0)| 1))) (.cse5 (not .cse23)) (.cse7 (not (<= 2 ~q_read_ev~0))) (.cse8 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse10 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (and .cse11 .cse12 .cse13 .cse14 .cse15) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10) (or .cse17 (and .cse11 .cse12 .cse18 .cse13 .cse14 .cse15) .cse5 .cse6 .cse7 .cse8 .cse16 .cse10) (or .cse1 .cse3 .cse2 .cse4 .cse5 (not (= |old(~c_dr_st~0)| 0)) .cse6 .cse7 .cse8 .cse9 .cse16) (or .cse0 .cse1 (and .cse11 .cse12 .cse18 .cse19 .cse13 .cse20 .cse21 .cse22) .cse17 .cse5 .cse7 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse8 .cse10 (not (<= ~c_num_read~0 |old(~p_num_write~0)|)))))) [2020-10-23 18:54:28,908 INFO L270 CegarLoopResult]: At program point L109-1(lines 97 134) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 1)) (.cse8 (not (= |old(~p_dw_pc~0)| 1))) (.cse26 (not (= ~c_dr_pc~0 0))) (.cse1 (not (<= 2 |old(~q_write_ev~0)|))) (.cse21 (not (= |old(~q_free~0)| 1))) (.cse24 (not (= ~c_num_read~0 0))) (.cse15 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse27 (= ~c_dr_st~0 2)) (.cse16 (= |old(~q_free~0)| ~q_free~0)) (.cse17 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse18 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse19 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse20 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse12 (not (<= 2 ~q_read_ev~0))) (.cse3 (<= 2 ~q_write_ev~0)) (.cse7 (= ~c_dr_st~0 0)) (.cse13 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse25 (not (= |old(~p_num_write~0)| 0))) (.cse14 (not (= 2 |old(~c_dr_st~0)|))) (.cse0 (not (= ~c_dr_pc~0 1))) (.cse23 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse2 (= ~q_free~0 0)) (.cse9 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse22 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0))) (and (or .cse0 .cse1 (let ((.cse4 (+ ~c_num_read~0 1))) (and .cse2 .cse3 (<= .cse4 ~p_num_write~0) (<= ~p_num_write~0 .cse4) .cse5 .cse6 .cse7)) .cse8 (and .cse2 .cse9 .cse5 .cse6 .cse10) .cse11 .cse12 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse13 .cse14 (not (<= ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse1 (and .cse15 .cse9 .cse16 .cse10 .cse17 .cse18 .cse19 .cse20) .cse21 (and .cse2 .cse3 .cse5 .cse10 .cse7 .cse22) .cse23 .cse11 (not (= |old(~c_dr_st~0)| 0)) .cse24 .cse12 .cse13 .cse25 .cse26) (or (and .cse27 .cse5 .cse6 .cse10) .cse8 .cse11 .cse24 .cse12 .cse13 .cse26 .cse14) (or .cse21 (and .cse27 .cse5 .cse10) .cse23 .cse11 .cse24 .cse12 .cse13 .cse25 .cse26 .cse14) (or .cse1 .cse21 .cse24 (and .cse15 .cse27 .cse16 .cse10 .cse17 .cse18 .cse19 .cse20) .cse12 (and .cse2 .cse3 .cse5 .cse7 .cse22) .cse13 .cse25 .cse14 .cse0 .cse23 .cse11 (and .cse2 .cse9 .cse5 .cse10 .cse22)))) [2020-10-23 18:54:28,908 INFO L274 CegarLoopResult]: For program point L101(lines 101 105) no Hoare annotation was computed. [2020-10-23 18:54:28,909 INFO L270 CegarLoopResult]: At program point L130(lines 93 135) the Hoare annotation is: (let ((.cse14 (= ~q_free~0 0)) (.cse20 (<= 2 ~q_write_ev~0)) (.cse16 (<= 2 ~p_dw_st~0)) (.cse22 (= ~c_dr_st~0 0)) (.cse19 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0)) (.cse15 (= ~c_dr_st~0 2)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (<= 2 ~q_read_ev~0)) (.cse18 (= ~p_dw_pc~0 1)) (.cse25 (= ~c_dr_pc~0 0)) (.cse24 (= ~p_dw_i~0 1))) (let ((.cse8 (and .cse15 .cse17 .cse23 .cse18 .cse25 .cse24)) (.cse7 (not .cse25)) (.cse0 (not (= |old(~q_free~0)| 1))) (.cse1 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse12 (and .cse14 .cse20 .cse16 .cse17 .cse18 .cse22 .cse19)) (.cse3 (not (= ~c_num_read~0 0))) (.cse6 (not (= |old(~p_num_write~0)| 0))) (.cse13 (not (= ~c_dr_pc~0 1))) (.cse11 (not (<= 2 |old(~q_write_ev~0)|))) (.cse10 (not (= |old(~p_dw_pc~0)| 1))) (.cse2 (not .cse24)) (.cse4 (not .cse23)) (.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse9 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (or .cse11 .cse0 .cse12 .cse1 .cse2 (not (= |old(~c_dr_st~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse13 .cse11 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9) (or .cse13 .cse11 .cse10 .cse2 .cse4 (and .cse14 .cse15 .cse16 .cse17 .cse18) (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (let ((.cse21 (+ ~c_num_read~0 1))) (and .cse14 .cse20 (<= .cse21 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse21) .cse17 .cse18 .cse22)) .cse5 .cse9 (not (<= ~c_num_read~0 |old(~p_num_write~0)|)))))) [2020-10-23 18:54:28,909 INFO L274 CegarLoopResult]: For program point errorEXIT(lines 7 14) no Hoare annotation was computed. [2020-10-23 18:54:28,909 INFO L274 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-10-23 18:54:28,909 INFO L277 CegarLoopResult]: At program point errorENTRY(lines 7 14) the Hoare annotation is: true [2020-10-23 18:54:28,909 INFO L274 CegarLoopResult]: For program point errorFINAL(lines 7 14) no Hoare annotation was computed. [2020-10-23 18:54:28,909 INFO L270 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 68 92) the Hoare annotation is: (let ((.cse17 (= |old(~p_dw_st~0)| ~p_dw_st~0))) (let ((.cse9 (and (= ~c_dr_st~0 |old(~c_dr_st~0)|) .cse17)) (.cse10 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not (= ~q_free~0 1))) (.cse15 (not (= ~c_dr_pc~0 0))) (.cse12 (not (<= 2 ~q_write_ev~0))) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (= ~c_dr_pc~0 1))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~c_num_read~0 0))) (.cse3 (not (<= 2 ~q_read_ev~0))) (.cse4 (and (= ~c_dr_st~0 2) .cse17)) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= 2 |old(~c_dr_st~0)|))) (.cse16 (not (= ~p_num_write~0 1))) (.cse8 (not (= ~q_free~0 0)))) (and (let ((.cse1 (+ ~c_num_read~0 1))) (or .cse0 (not (<= ~p_num_write~0 .cse1)) .cse2 (not (<= .cse1 ~p_num_write~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (or .cse0 .cse9 (not (<= ~c_num_read~0 ~p_num_write~0)) (not (<= ~p_num_write~0 ~c_num_read~0)) .cse2 .cse10 .cse11 .cse5 .cse12 .cse7 .cse13) (or .cse9 (not (= |old(~c_dr_st~0)| 0)) .cse2 .cse14 .cse3 .cse5 .cse15 .cse16 .cse8) (or .cse2 .cse14 .cse3 .cse5 .cse4 .cse15 .cse6) (or .cse9 .cse2 .cse10 (not (= ~c_num_read~0 1)) .cse11 .cse5 .cse15 .cse12 .cse7 .cse13 .cse16) (or .cse0 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse16 .cse8)))) [2020-10-23 18:54:28,909 INFO L274 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2020-10-23 18:54:28,910 INFO L274 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2020-10-23 18:54:28,910 INFO L274 CegarLoopResult]: For program point L84-2(lines 68 92) no Hoare annotation was computed. [2020-10-23 18:54:28,910 INFO L274 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2020-10-23 18:54:28,910 INFO L270 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse17 (= |old(~p_dw_st~0)| ~p_dw_st~0))) (let ((.cse9 (and (= ~c_dr_st~0 |old(~c_dr_st~0)|) .cse17)) (.cse10 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not (= ~q_free~0 1))) (.cse15 (not (= ~c_dr_pc~0 0))) (.cse12 (not (<= 2 ~q_write_ev~0))) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (= ~c_dr_pc~0 1))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~c_num_read~0 0))) (.cse3 (not (<= 2 ~q_read_ev~0))) (.cse4 (and (= ~c_dr_st~0 2) .cse17)) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= 2 |old(~c_dr_st~0)|))) (.cse16 (not (= ~p_num_write~0 1))) (.cse8 (not (= ~q_free~0 0)))) (and (let ((.cse1 (+ ~c_num_read~0 1))) (or .cse0 (not (<= ~p_num_write~0 .cse1)) .cse2 (not (<= .cse1 ~p_num_write~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (or .cse0 .cse9 (not (<= ~c_num_read~0 ~p_num_write~0)) (not (<= ~p_num_write~0 ~c_num_read~0)) .cse2 .cse10 .cse11 .cse5 .cse12 .cse7 .cse13) (or .cse9 (not (= |old(~c_dr_st~0)| 0)) .cse2 .cse14 .cse3 .cse5 .cse15 .cse16 .cse8) (or .cse2 .cse14 .cse3 .cse5 .cse4 .cse15 .cse6) (or .cse9 .cse2 .cse10 (not (= ~c_num_read~0 1)) .cse11 .cse5 .cse15 .cse12 .cse7 .cse13 .cse16) (or .cse0 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse16 .cse8)))) [2020-10-23 18:54:28,910 INFO L270 CegarLoopResult]: At program point L76-2(lines 76 80) the Hoare annotation is: (let ((.cse18 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse19 (<= immediate_notify_threads_~tmp~0 0)) (.cse20 (<= 0 immediate_notify_threads_~tmp~0))) (let ((.cse5 (and (= ~c_dr_st~0 2) .cse18 .cse19 .cse20)) (.cse6 (not (= 2 |old(~c_dr_st~0)|))) (.cse9 (not (= ~c_num_read~0 0))) (.cse3 (not (<= 2 ~q_read_ev~0))) (.cse11 (not (= ~c_dr_pc~0 0))) (.cse10 (not (= ~p_num_write~0 1))) (.cse8 (not (= ~q_free~0 0))) (.cse0 (not (= ~c_dr_pc~0 1))) (.cse12 (and (= ~c_dr_st~0 |old(~c_dr_st~0)|) .cse18 .cse19 .cse20)) (.cse13 (= ~p_dw_st~0 0)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse14 (not (<= 2 |old(~p_dw_st~0)|))) (.cse15 (not (= ~q_free~0 1))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse16 (not (<= 2 ~q_write_ev~0))) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (let ((.cse1 (+ ~c_num_read~0 1))) (or .cse0 (not (<= ~p_num_write~0 .cse1)) .cse2 (not (<= .cse1 ~p_num_write~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (or .cse0 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse2 .cse9 .cse3 .cse4 .cse5 .cse11 .cse6) (or .cse12 .cse13 .cse2 .cse14 (not (= ~c_num_read~0 1)) .cse15 .cse4 .cse11 .cse16 .cse7 .cse17 .cse10) (or .cse12 (not (= |old(~c_dr_st~0)| 0)) .cse2 .cse9 .cse3 .cse4 .cse11 .cse10 .cse8) (or .cse0 .cse12 (not (<= ~c_num_read~0 ~p_num_write~0)) .cse13 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse2 .cse14 .cse15 .cse4 .cse16 .cse7 .cse17)))) [2020-10-23 18:54:28,911 INFO L274 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 68 92) no Hoare annotation was computed. [2020-10-23 18:54:28,911 INFO L274 CegarLoopResult]: For program point L74-1(line 74) no Hoare annotation was computed. [2020-10-23 18:54:28,911 INFO L274 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-10-23 18:54:28,911 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= |#t~string6.base| |old(#t~string6.base)|) (= ~c_num_read~0 |old(~c_num_read~0)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |old(#valid)| |#valid|) (= |#t~string5.base| |old(#t~string5.base)|) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~p_dw_st~0 |old(~p_dw_st~0)|) (= |#NULL.base| |old(#NULL.base)|) (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_free~0 |old(~q_free~0)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~c_dr_i~0 |old(~c_dr_i~0)|)) [2020-10-23 18:54:28,911 INFO L274 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-10-23 18:54:28,911 INFO L270 CegarLoopResult]: At program point evalENTRY(lines 232 285) the Hoare annotation is: (let ((.cse8 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse9 (= ~a_t~0 |old(~a_t~0)|)) (.cse10 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse25 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse12 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse14 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse26 (= ~c_dr_st~0 2)) (.cse17 (= |old(~q_free~0)| ~q_free~0)) (.cse18 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse19 (= ~p_num_write~0 |old(~p_num_write~0)|))) (let ((.cse0 (not (= |old(~p_dw_pc~0)| 1))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (and .cse8 .cse9 .cse10 .cse11 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) .cse25 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse12 .cse14 .cse26 .cse17 .cse18 .cse19)) (.cse7 (not (= |old(~c_dr_pc~0)| 0))) (.cse20 (not (= |old(~q_free~0)| 1))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (<= 2 |old(~q_read_ev~0)|))) (.cse21 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse22 (not (= |old(~p_num_write~0)| 0))) (.cse23 (not (= |old(~p_dw_st~0)| 0))) (.cse6 (not (= 2 |old(~c_dr_st~0)|))) (.cse24 (not (= |old(~c_num_read~0)| 0))) (.cse13 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~p_dw_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~q_free~0)| 0)) .cse5 .cse6) (or (not (<= 2 |old(~q_write_ev~0)|)) .cse7 (and .cse8 .cse9 .cse10 .cse11 (= ~c_dr_st~0 |old(~c_dr_st~0)|) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20 .cse1 (not (= |old(~c_dr_st~0)| 0)) .cse2 .cse21 .cse5 .cse22 .cse23 .cse24) (or .cse7 .cse0 .cse1 .cse2 .cse5 (and .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse26 .cse17 .cse18 .cse19) .cse6 .cse24) (or .cse20 .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6) (or .cse7 .cse20 .cse1 .cse2 .cse21 .cse5 .cse22 .cse23 .cse6 .cse24 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19))))) [2020-10-23 18:54:28,912 INFO L270 CegarLoopResult]: At program point L256(line 256) the Hoare annotation is: (let ((.cse13 (= ~c_dr_st~0 2)) (.cse25 (<= 2 ~q_read_ev~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (= ~p_dw_pc~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse28 (= ~p_dw_i~0 1)) (.cse19 (= ~c_num_read~0 0))) (let ((.cse1 (not (= |old(~q_free~0)| 1))) (.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse12 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse15 (= |old(~q_free~0)| ~q_free~0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse20 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse4 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse7 (not (= |old(~p_num_write~0)| 0))) (.cse8 (not (= |old(~p_dw_st~0)| 0))) (.cse0 (not (= |old(~c_dr_pc~0)| 0))) (.cse5 (and .cse13 .cse25 .cse14 .cse27 .cse18 .cse28 .cse19)) (.cse10 (not (= |old(~c_num_read~0)| 0))) (.cse21 (not (= |old(~p_dw_pc~0)| 1))) (.cse2 (not .cse28)) (.cse3 (not (<= 2 |old(~q_read_ev~0)|))) (.cse22 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse9 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (or .cse1 .cse21 .cse2 .cse3 .cse22 .cse4 .cse6 .cse9) (let ((.cse23 (<= 2 ~q_write_ev~0)) (.cse24 (<= 1 eval_~tmp___1~0)) (.cse26 (= ~c_dr_pc~0 1))) (or (not (<= 2 |old(~q_write_ev~0)|)) .cse1 (and .cse23 .cse24 .cse13 .cse14 .cse25 .cse16 (= ~q_free~0 1) .cse20 .cse19 .cse26) (and .cse11 .cse12 .cse24 .cse14 .cse15 (= ~c_dr_st~0 0) .cse16 .cse17 .cse18 .cse19 .cse20) .cse4 .cse6 .cse7 .cse8 .cse0 (and .cse23 .cse24 .cse13 (<= ~p_num_write~0 ~c_num_read~0) .cse14 .cse25 .cse27 (<= ~c_num_read~0 ~p_num_write~0) .cse26) .cse2 (not (= |old(~c_dr_st~0)| 0)) .cse3 .cse10)) (or .cse0 .cse21 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10) (or .cse21 .cse2 .cse3 .cse22 (not (= |old(~q_free~0)| 0)) .cse6 .cse9)))) [2020-10-23 18:54:28,912 INFO L274 CegarLoopResult]: For program point L244(lines 244 248) no Hoare annotation was computed. [2020-10-23 18:54:28,912 INFO L274 CegarLoopResult]: For program point L244-1(lines 239 279) no Hoare annotation was computed. [2020-10-23 18:54:28,912 INFO L274 CegarLoopResult]: For program point L242(line 242) no Hoare annotation was computed. [2020-10-23 18:54:28,913 INFO L270 CegarLoopResult]: At program point L240(line 240) the Hoare annotation is: (let ((.cse9 (= ~c_dr_st~0 2)) (.cse33 (= ~p_last_write~0 ~q_buf_0~0)) (.cse34 (<= 2 ~q_read_ev~0)) (.cse35 (= ~p_dw_pc~0 1)) (.cse6 (= ~c_dr_pc~0 0)) (.cse41 (= ~p_dw_i~0 1)) (.cse8 (= ~c_num_read~0 0))) (let ((.cse19 (not (= |old(~p_num_write~0)| 0))) (.cse21 (not (= |old(~p_dw_st~0)| 0))) (.cse0 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse13 (not (= |old(~c_dr_pc~0)| 0))) (.cse20 (and .cse9 .cse33 .cse34 .cse35 .cse6 .cse41 .cse8)) (.cse23 (not (= |old(~c_num_read~0)| 0))) (.cse14 (not (= |old(~q_free~0)| 1))) (.cse24 (not (= |old(~p_dw_pc~0)| 1))) (.cse1 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse2 (= ~a_t~0 |old(~a_t~0)|)) (.cse3 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse26 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse4 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse27 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse5 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse7 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse10 (= |old(~q_free~0)| ~q_free~0)) (.cse11 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse12 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse15 (not .cse41)) (.cse16 (not (<= 2 |old(~q_read_ev~0)|))) (.cse25 (not (<= 2 |old(~p_dw_st~0)|))) (.cse17 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse18 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse22 (not (= 2 |old(~c_dr_st~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse24 .cse15 .cse16 .cse25 (and .cse1 .cse2 .cse0 .cse3 .cse26 .cse4 .cse27 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12) (not (= |old(~q_free~0)| 0)) .cse18 .cse22) (let ((.cse28 (= ~q_free~0 0)) (.cse32 (<= 2 ~p_dw_st~0)) (.cse36 (= ~c_dr_st~0 0)) (.cse40 (= ~q_free~0 1)) (.cse37 (= ~c_dr_pc~0 1)) (.cse29 (<= 2 ~q_write_ev~0)) (.cse31 (<= 1 eval_~tmp___1~0)) (.cse38 (= ~p_dw_st~0 0)) (.cse39 (= ~c_last_read~0 ~p_last_write~0))) (or (not (<= 2 |old(~q_write_ev~0)|)) (let ((.cse30 (+ ~c_num_read~0 1))) (and .cse28 .cse29 (<= .cse30 ~p_num_write~0) .cse31 .cse32 (<= ~p_num_write~0 .cse30) .cse33 .cse34 .cse35 .cse36 .cse37)) .cse14 (and .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse6 .cse8) .cse17 (and .cse29 .cse31 .cse9 .cse38 .cse33 .cse34 .cse39 .cse40 .cse41 .cse12 .cse8 .cse37) .cse18 .cse19 .cse21 (and .cse9 .cse32 .cse33 .cse34 .cse35 .cse39 .cse40) .cse13 (and .cse28 .cse9 .cse32 .cse33 .cse34 .cse35) .cse15 (and .cse0 .cse2 .cse3 .cse36 .cse5 .cse6 .cse40 .cse41 .cse7 .cse8 .cse38 .cse39 .cse11 .cse12) (not (= |old(~c_dr_st~0)| 0)) .cse16 (and .cse40 .cse41 (<= ~c_num_read~0 ~p_num_write~0) .cse37 .cse29 .cse31 .cse9 (<= ~p_num_write~0 ~c_num_read~0) .cse38 .cse33 .cse34 .cse35 .cse39) .cse23)) (or .cse13 .cse24 .cse15 .cse16 .cse20 .cse18 .cse22 .cse23) (or .cse14 .cse24 (and .cse1 .cse2 .cse3 .cse26 .cse4 .cse27 .cse5 .cse7 .cse9 .cse35 .cse10 .cse11 .cse12) .cse15 .cse16 .cse25 .cse17 .cse18 .cse22)))) [2020-10-23 18:54:28,913 INFO L270 CegarLoopResult]: At program point L271(line 271) the Hoare annotation is: (let ((.cse0 (not (= |old(~q_free~0)| 1))) (.cse5 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse10 (not (= |old(~p_num_write~0)| 0))) (.cse11 (not (= |old(~p_dw_st~0)| 0))) (.cse8 (not (= |old(~c_dr_pc~0)| 0))) (.cse9 (not (= |old(~c_num_read~0)| 0))) (.cse1 (not (= |old(~p_dw_pc~0)| 1))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (<= 2 |old(~q_read_ev~0)|))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse1 .cse2 .cse3 .cse6 .cse7 .cse9) (or .cse8 .cse0 .cse2 .cse3 .cse5 .cse6 .cse10 .cse11 .cse7 .cse9) (let ((.cse12 (= ~q_free~0 0)) (.cse13 (<= 2 ~q_write_ev~0)) (.cse16 (<= 2 ~p_dw_st~0)) (.cse18 (<= 2 ~q_read_ev~0)) (.cse19 (= ~p_dw_pc~0 1)) (.cse15 (<= 1 eval_~tmp___1~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~c_num_read~0 0))) (or (not (<= 2 |old(~q_write_ev~0)|)) (let ((.cse14 (+ ~c_num_read~0 1))) (and .cse12 .cse13 (<= .cse14 ~p_num_write~0) .cse15 .cse16 (<= ~p_num_write~0 .cse14) .cse17 .cse18 .cse19 (= ~c_dr_pc~0 1))) .cse0 (and .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse20 .cse21) .cse5 .cse6 .cse10 .cse11 .cse8 (and (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse15 (= ~p_dw_st~0 0) .cse17 (= |old(~q_free~0)| ~q_free~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse20 .cse21 (= ~p_num_write~0 |old(~p_num_write~0)|)) .cse2 (not (= |old(~c_dr_st~0)| 0)) .cse3 .cse9)) (or .cse1 .cse2 .cse3 .cse4 (not (= |old(~q_free~0)| 0)) .cse6 .cse7))) [2020-10-23 18:54:28,913 INFO L274 CegarLoopResult]: For program point L253(lines 253 260) no Hoare annotation was computed. [2020-10-23 18:54:28,914 INFO L274 CegarLoopResult]: For program point evalEXIT(lines 232 285) no Hoare annotation was computed. [2020-10-23 18:54:28,914 INFO L274 CegarLoopResult]: For program point L249(lines 239 279) no Hoare annotation was computed. [2020-10-23 18:54:28,914 INFO L270 CegarLoopResult]: At program point L280(lines 232 285) the Hoare annotation is: (let ((.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (<= 2 ~q_read_ev~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse19 (= ~p_dw_i~0 1)) (.cse11 (= ~c_dr_st~0 2))) (let ((.cse9 (not (= |old(~p_num_write~0)| 0))) (.cse10 (not (= |old(~p_dw_st~0)| 0))) (.cse7 (not (= |old(~q_free~0)| 1))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse4 (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_num_read~0 |old(~c_num_read~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) .cse11 (= |old(~q_free~0)| ~q_free~0) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|))) (.cse16 (not (= |old(~c_dr_pc~0)| 0))) (.cse0 (not (= |old(~p_dw_pc~0)| 1))) (.cse1 (not .cse19)) (.cse2 (not (<= 2 |old(~q_read_ev~0)|))) (.cse18 (and .cse11 .cse13 .cse14 .cse15 (= ~c_dr_pc~0 0) .cse19 (= ~c_num_read~0 0))) (.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (= 2 |old(~c_dr_st~0)|))) (.cse17 (not (= |old(~c_num_read~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~q_free~0)| 0)) .cse5 .cse6) (let ((.cse12 (<= 2 ~p_dw_st~0))) (or (not (<= 2 |old(~q_write_ev~0)|)) .cse7 .cse8 .cse5 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 (= ~c_last_read~0 ~p_last_write~0) (= ~q_free~0 1)) .cse16 (and (= ~q_free~0 0) .cse11 .cse12 .cse13 .cse14 .cse15) .cse1 (not (= |old(~c_dr_st~0)| 0)) .cse2 .cse17)) (or .cse16 .cse7 .cse1 .cse2 .cse8 .cse5 .cse9 .cse18 .cse10 .cse6 .cse17) (or .cse7 .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (or .cse16 .cse0 .cse1 .cse2 .cse18 .cse5 .cse6 .cse17)))) [2020-10-23 18:54:28,914 INFO L274 CegarLoopResult]: For program point L268(lines 268 275) no Hoare annotation was computed. [2020-10-23 18:54:28,915 INFO L270 CegarLoopResult]: At program point L264(lines 239 279) the Hoare annotation is: (let ((.cse9 (= ~c_dr_st~0 2)) (.cse33 (= ~p_last_write~0 ~q_buf_0~0)) (.cse34 (<= 2 ~q_read_ev~0)) (.cse35 (= ~p_dw_pc~0 1)) (.cse6 (= ~c_dr_pc~0 0)) (.cse41 (= ~p_dw_i~0 1)) (.cse8 (= ~c_num_read~0 0))) (let ((.cse19 (not (= |old(~p_num_write~0)| 0))) (.cse21 (not (= |old(~p_dw_st~0)| 0))) (.cse0 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse13 (not (= |old(~c_dr_pc~0)| 0))) (.cse20 (and .cse9 .cse33 .cse34 .cse35 .cse6 .cse41 .cse8)) (.cse23 (not (= |old(~c_num_read~0)| 0))) (.cse14 (not (= |old(~q_free~0)| 1))) (.cse24 (not (= |old(~p_dw_pc~0)| 1))) (.cse1 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse2 (= ~a_t~0 |old(~a_t~0)|)) (.cse3 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse26 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse4 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse27 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse5 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse7 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse10 (= |old(~q_free~0)| ~q_free~0)) (.cse11 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse12 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse15 (not .cse41)) (.cse16 (not (<= 2 |old(~q_read_ev~0)|))) (.cse25 (not (<= 2 |old(~p_dw_st~0)|))) (.cse17 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse18 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse22 (not (= 2 |old(~c_dr_st~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse24 .cse15 .cse16 .cse25 (and .cse1 .cse2 .cse0 .cse3 .cse26 .cse4 .cse27 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12) (not (= |old(~q_free~0)| 0)) .cse18 .cse22) (let ((.cse28 (= ~q_free~0 0)) (.cse32 (<= 2 ~p_dw_st~0)) (.cse36 (= ~c_dr_st~0 0)) (.cse40 (= ~q_free~0 1)) (.cse37 (= ~c_dr_pc~0 1)) (.cse29 (<= 2 ~q_write_ev~0)) (.cse31 (<= 1 eval_~tmp___1~0)) (.cse38 (= ~p_dw_st~0 0)) (.cse39 (= ~c_last_read~0 ~p_last_write~0))) (or (not (<= 2 |old(~q_write_ev~0)|)) (let ((.cse30 (+ ~c_num_read~0 1))) (and .cse28 .cse29 (<= .cse30 ~p_num_write~0) .cse31 .cse32 (<= ~p_num_write~0 .cse30) .cse33 .cse34 .cse35 .cse36 .cse37)) .cse14 (and .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse6 .cse8) .cse17 (and .cse29 .cse31 .cse9 .cse38 .cse33 .cse34 .cse39 .cse40 .cse41 .cse12 .cse8 .cse37) .cse18 .cse19 .cse21 (and .cse9 .cse32 .cse33 .cse34 .cse35 .cse39 .cse40) .cse13 (and .cse28 .cse9 .cse32 .cse33 .cse34 .cse35) .cse15 (and .cse0 .cse2 .cse3 .cse36 .cse5 .cse6 .cse40 .cse41 .cse7 .cse8 .cse38 .cse39 .cse11 .cse12) (not (= |old(~c_dr_st~0)| 0)) .cse16 (and .cse40 .cse41 (<= ~c_num_read~0 ~p_num_write~0) .cse37 .cse29 .cse31 .cse9 (<= ~p_num_write~0 ~c_num_read~0) .cse38 .cse33 .cse34 .cse35 .cse39) .cse23)) (or .cse13 .cse24 .cse15 .cse16 .cse20 .cse18 .cse22 .cse23) (or .cse14 .cse24 (and .cse1 .cse2 .cse3 .cse26 .cse4 .cse27 .cse5 .cse7 .cse9 .cse35 .cse10 .cse11 .cse12) .cse15 .cse16 .cse25 .cse17 .cse18 .cse22)))) [2020-10-23 18:54:28,915 INFO L277 CegarLoopResult]: At program point L301(lines 290 303) the Hoare annotation is: true [2020-10-23 18:54:28,915 INFO L274 CegarLoopResult]: For program point L294(lines 294 299) no Hoare annotation was computed. [2020-10-23 18:54:28,915 INFO L274 CegarLoopResult]: For program point stop_simulationEXIT(lines 286 304) no Hoare annotation was computed. [2020-10-23 18:54:28,915 INFO L277 CegarLoopResult]: At program point L292(line 292) the Hoare annotation is: true [2020-10-23 18:54:28,915 INFO L277 CegarLoopResult]: At program point stop_simulationENTRY(lines 286 304) the Hoare annotation is: true [2020-10-23 18:54:28,915 INFO L274 CegarLoopResult]: For program point L292-1(line 292) no Hoare annotation was computed. [2020-10-23 18:54:28,916 INFO L274 CegarLoopResult]: For program point stop_simulationFINAL(lines 286 304) no Hoare annotation was computed. [2020-10-23 18:54:28,916 INFO L270 CegarLoopResult]: At program point L64(lines 52 66) the Hoare annotation is: (let ((.cse1 (not (= ~c_num_read~0 0))) (.cse2 (not (<= 2 ~q_read_ev~0))) (.cse13 (not (= ~c_dr_pc~0 1))) (.cse14 (not (<= ~c_num_read~0 ~p_num_write~0))) (.cse7 (not (= ~p_dw_st~0 0))) (.cse15 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse10 (not (<= 2 ~q_write_ev~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse8 (not (= ~c_num_read~0 1))) (.cse9 (not (= ~q_free~0 1))) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (= ~c_dr_pc~0 0))) (.cse5 (and (<= 0 is_do_read_c_triggered_~__retres1~1) (<= is_do_read_c_triggered_~__retres1~1 0))) (.cse16 (not (<= 2 ~p_dw_st~0))) (.cse11 (not (= ~p_dw_pc~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse6 (not (= ~p_num_write~0 1)))) (and (or (not (= ~c_dr_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~q_free~0 0))) (or .cse7 .cse0 .cse8 .cse9 .cse3 .cse4 .cse5 .cse10 .cse11 .cse12 .cse6) (or .cse13 .cse14 .cse15 .cse0 .cse9 .cse3 .cse5 .cse10 .cse16 .cse11 .cse12) (or .cse0 .cse1 .cse2 (not (= ~c_dr_st~0 2)) .cse3 .cse4 .cse5) (or .cse13 .cse14 .cse7 .cse15 .cse0 .cse9 .cse3 .cse5 .cse10 .cse11 .cse12) (or .cse0 .cse8 .cse9 .cse3 .cse4 .cse5 .cse16 .cse11 .cse12 .cse6))) [2020-10-23 18:54:28,916 INFO L277 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 49 67) the Hoare annotation is: true [2020-10-23 18:54:28,916 INFO L274 CegarLoopResult]: For program point L54(lines 54 59) no Hoare annotation was computed. [2020-10-23 18:54:28,916 INFO L274 CegarLoopResult]: For program point L53(lines 53 62) no Hoare annotation was computed. [2020-10-23 18:54:28,916 INFO L274 CegarLoopResult]: For program point L53-2(lines 53 62) no Hoare annotation was computed. [2020-10-23 18:54:28,917 INFO L274 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 49 67) no Hoare annotation was computed. [2020-10-23 18:54:28,917 INFO L274 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 49 67) no Hoare annotation was computed. [2020-10-23 18:54:28,917 INFO L270 CegarLoopResult]: At program point start_simulationENTRY(lines 305 333) the Hoare annotation is: (or (not (<= 2 |old(~q_write_ev~0)|)) (not (= |old(~c_dr_pc~0)| 0)) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~c_dr_pc~0 0) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~c_num_read~0 0) (= ~p_dw_st~0 0) (= |old(~q_free~0)| ~q_free~0) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= |old(~q_free~0)| 1)) (not (= ~p_dw_i~0 1)) (not (= |old(~c_dr_st~0)| 0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= |old(~c_num_read~0)| 0))) [2020-10-23 18:54:28,917 INFO L274 CegarLoopResult]: For program point L320(line 320) no Hoare annotation was computed. [2020-10-23 18:54:28,917 INFO L270 CegarLoopResult]: At program point L319(line 319) the Hoare annotation is: (let ((.cse1 (<= 2 ~p_dw_st~0)) (.cse3 (<= 2 ~q_read_ev~0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse8 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse9 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse10 (= ~p_dw_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= |old(~q_free~0)| ~q_free~0)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse13 (= ~p_num_write~0 |old(~p_num_write~0)|))) (or (not (<= 2 |old(~q_write_ev~0)|)) (not (= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_free~0 1)) (not (= |old(~c_dr_pc~0)| 0)) (and (= ~q_free~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~p_dw_i~0 1)) (not (= |old(~c_dr_st~0)| 0)) (not (<= 2 |old(~q_read_ev~0)|)) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse2 .cse11 (= ~c_dr_st~0 0) .cse5 .cse12 .cse6 .cse7 .cse13) (and .cse8 .cse9 .cse0 .cse10 .cse2 .cse11 .cse5 .cse12 .cse6 .cse7 .cse13) (not (= |old(~c_num_read~0)| 0)))) [2020-10-23 18:54:28,918 INFO L270 CegarLoopResult]: At program point L319-1(line 319) the Hoare annotation is: (let ((.cse1 (<= 2 ~p_dw_st~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~q_read_ev~0)) (.cse4 (= ~p_dw_pc~0 1))) (or (not (<= 2 |old(~q_write_ev~0)|)) (not (= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_last_read~0 ~p_last_write~0) (= ~q_free~0 1)) (not (= |old(~c_dr_pc~0)| 0)) (and (= ~q_free~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~p_dw_i~0 1)) (not (= |old(~c_dr_st~0)| 0)) (not (<= 2 |old(~q_read_ev~0)|)) (and .cse0 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 0) (= ~c_num_read~0 0)) (not (= |old(~c_num_read~0)| 0)))) [2020-10-23 18:54:28,918 INFO L274 CegarLoopResult]: For program point L316(line 316) no Hoare annotation was computed. [2020-10-23 18:54:28,918 INFO L274 CegarLoopResult]: For program point start_simulationEXIT(lines 305 333) no Hoare annotation was computed. [2020-10-23 18:54:28,918 INFO L270 CegarLoopResult]: At program point L315-1(lines 312 327) the Hoare annotation is: (let ((.cse1 (<= 2 ~p_dw_st~0)) (.cse3 (<= 2 ~q_read_ev~0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse8 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse9 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse10 (= ~p_dw_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= |old(~q_free~0)| ~q_free~0)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse13 (= ~p_num_write~0 |old(~p_num_write~0)|))) (or (not (<= 2 |old(~q_write_ev~0)|)) (not (= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_free~0 1)) (not (= |old(~c_dr_pc~0)| 0)) (and (= ~q_free~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~p_dw_i~0 1)) (not (= |old(~c_dr_st~0)| 0)) (not (<= 2 |old(~q_read_ev~0)|)) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse2 .cse11 (= ~c_dr_st~0 0) .cse5 .cse12 .cse6 .cse7 .cse13) (and .cse8 .cse9 .cse0 .cse10 .cse2 .cse11 .cse5 .cse12 .cse6 .cse7 .cse13) (not (= |old(~c_num_read~0)| 0)))) [2020-10-23 18:54:28,918 INFO L270 CegarLoopResult]: At program point L312(line 312) the Hoare annotation is: (or (not (<= 2 |old(~q_write_ev~0)|)) (not (= |old(~c_dr_pc~0)| 0)) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~c_dr_pc~0 0) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~c_num_read~0 0) (= ~p_dw_st~0 0) (= |old(~q_free~0)| ~q_free~0) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= |old(~q_free~0)| 1)) (not (= ~p_dw_i~0 1)) (not (= |old(~c_dr_st~0)| 0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= |old(~c_num_read~0)| 0))) [2020-10-23 18:54:28,918 INFO L277 CegarLoopResult]: At program point L328(lines 305 333) the Hoare annotation is: true [2020-10-23 18:54:28,919 INFO L274 CegarLoopResult]: For program point L322(lines 322 326) no Hoare annotation was computed. [2020-10-23 18:54:28,919 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-23 18:54:28,919 INFO L270 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~q_free~0 0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~p_dw_i~0 1)) (= ~p_num_write~0 0) (= ~c_dr_pc~0 0) (= ~c_num_read~0 0)) [2020-10-23 18:54:28,919 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 18:54:28,919 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-23 18:54:28,919 INFO L274 CegarLoopResult]: For program point L34-2(lines 34 43) no Hoare annotation was computed. [2020-10-23 18:54:28,919 INFO L274 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 30 48) no Hoare annotation was computed. [2020-10-23 18:54:28,919 INFO L274 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 30 48) no Hoare annotation was computed. [2020-10-23 18:54:28,920 INFO L270 CegarLoopResult]: At program point L45(lines 33 47) the Hoare annotation is: (let ((.cse0 (not (= ~c_dr_pc~0 1))) (.cse10 (not (= ~p_num_write~0 1))) (.cse7 (not (= ~q_free~0 0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse8 (not (= ~c_num_read~0 0))) (.cse3 (not (<= 2 ~q_read_ev~0))) (.cse4 (not (= ~c_dr_st~0 2))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (and (<= 0 is_do_write_p_triggered_~__retres1~0) (<= is_do_write_p_triggered_~__retres1~0 0))) (.cse9 (not (= ~c_dr_pc~0 0)))) (and (let ((.cse1 (+ ~c_num_read~0 1))) (or .cse0 (not (<= ~p_num_write~0 .cse1)) .cse2 (not (<= .cse1 ~p_num_write~0)) .cse3 .cse4 .cse5 .cse6 (not (= ~p_dw_pc~0 1)) .cse7)) (or (not (= ~c_dr_st~0 0)) .cse2 .cse8 .cse3 .cse5 .cse9 .cse6 .cse10 .cse7) (or .cse0 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7) (or .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse9))) [2020-10-23 18:54:28,920 INFO L277 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 30 48) the Hoare annotation is: true [2020-10-23 18:54:28,920 INFO L274 CegarLoopResult]: For program point L35(lines 35 40) no Hoare annotation was computed. [2020-10-23 18:54:28,920 INFO L274 CegarLoopResult]: For program point L34(lines 34 43) no Hoare annotation was computed. [2020-10-23 18:54:28,920 INFO L274 CegarLoopResult]: For program point do_read_cEXIT(lines 137 193) no Hoare annotation was computed. [2020-10-23 18:54:28,920 INFO L270 CegarLoopResult]: At program point L188(lines 137 193) the Hoare annotation is: (let ((.cse21 (= ~p_num_write~0 1)) (.cse3 (<= 2 ~p_dw_st~0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse25 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= ~c_num_read~0 1)) (.cse23 (<= 2 ~q_write_ev~0)) (.cse2 (= ~c_dr_st~0 2)) (.cse7 (= ~p_dw_st~0 0)) (.cse4 (<= 2 ~q_read_ev~0)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 1)) (.cse26 (= ~p_dw_i~0 1))) (let ((.cse1 (not (= |old(~c_dr_pc~0)| 1))) (.cse20 (not (= |old(~c_dr_pc~0)| 0))) (.cse9 (not .cse26)) (.cse10 (not (<= 2 |old(~q_read_ev~0)|))) (.cse11 (not (<= 2 |old(~p_dw_st~0)|))) (.cse16 (and .cse24 .cse23 .cse2 .cse7 .cse4 .cse5 .cse6 .cse26 .cse8)) (.cse12 (not (= |old(~q_free~0)| 0))) (.cse13 (not .cse25)) (.cse17 (and .cse21 .cse24 .cse2 .cse3 .cse25 .cse4 .cse22 .cse5 .cse6 .cse26)) (.cse14 (not .cse23)) (.cse18 (not (= |old(~c_num_read~0)| 0))) (.cse15 (not .cse22)) (.cse19 (not .cse21))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse0 ~p_num_write~0)) .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= ~p_num_write~0 .cse0)) (and .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse4 .cse5 .cse6 (<= ~c_num_read~0 ~p_num_write~0) .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)) (or .cse1 .cse9 .cse10 .cse11 .cse16 .cse13 .cse12 .cse17 .cse14 .cse18 .cse15 .cse19) (or .cse20 (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse9 .cse10 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse13 (not (= |old(~p_dw_st~0)| 0)) (and .cse2 .cse7 .cse4 (= |old(~q_free~0)| ~q_free~0) .cse5 (= ~c_num_read~0 0) .cse8) .cse14 .cse18) (or .cse20 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13 .cse17 .cse14 .cse18 .cse15 .cse19)))) [2020-10-23 18:54:28,921 INFO L274 CegarLoopResult]: For program point L153(lines 152 187) no Hoare annotation was computed. [2020-10-23 18:54:28,921 INFO L270 CegarLoopResult]: At program point L184(line 184) the Hoare annotation is: (let ((.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= |old(~q_free~0)| 0))) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse0 (not (= |old(~c_dr_pc~0)| 0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (<= 2 |old(~q_read_ev~0)|))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (<= 2 ~q_write_ev~0))) (.cse7 (not (= |old(~c_num_read~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~p_num_write~0 1))) (let ((.cse9 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse9 ~p_num_write~0)) (not (= |old(~c_dr_pc~0)| 1)) (not (<= ~p_num_write~0 .cse9)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8)) (or .cse0 (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse1 .cse2 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse5 (not (= |old(~p_dw_st~0)| 0)) .cse6 .cse7))) [2020-10-23 18:54:28,921 INFO L270 CegarLoopResult]: At program point L184-1(lines 140 192) the Hoare annotation is: (let ((.cse25 (= ~p_dw_st~0 0)) (.cse20 (+ |old(~c_num_read~0)| 1)) (.cse21 (<= 2 ~p_dw_st~0)) (.cse22 (<= 2 ~q_read_ev~0)) (.cse23 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~q_free~0 1)) (.cse24 (= ~p_dw_i~0 1))) (let ((.cse0 (and (= ~c_num_read~0 1) .cse21 .cse22 .cse23 .cse19 .cse24)) (.cse1 (and .cse25 .cse22 .cse23 .cse19 .cse24 (= .cse20 ~c_num_read~0))) (.cse11 (not (= ~p_num_write~0 1))) (.cse18 (not (= |old(~c_dr_pc~0)| 0))) (.cse12 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse13 (= ~a_t~0 |old(~a_t~0)|)) (.cse14 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse15 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse16 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse17 (= ~c_num_read~0 0)) (.cse9 (not (= |old(~c_num_read~0)| 0))) (.cse2 (not (= |old(~c_dr_pc~0)| 1))) (.cse3 (not .cse24)) (.cse4 (not (<= 2 |old(~q_read_ev~0)|))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse7 (not (= |old(~q_free~0)| 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (<= 2 ~q_write_ev~0))) (.cse10 (not (= ~p_dw_pc~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse8 .cse11 (and .cse12 .cse13 .cse14 .cse15 (= |old(~q_free~0)| ~q_free~0) .cse16 (= ~c_dr_pc~0 0) .cse17) .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (or .cse18 (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) (and .cse12 .cse13 .cse14 .cse15 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) .cse16 .cse19 .cse17) .cse3 .cse4 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse6 (not (= |old(~p_dw_st~0)| 0)) .cse8 .cse9) (or (not (<= .cse20 ~p_num_write~0)) (and .cse21 .cse22 .cse23 .cse19 .cse24) .cse2 (not (<= ~p_num_write~0 .cse20)) .cse3 .cse4 .cse5 .cse7 .cse6 (and .cse25 (<= ~p_num_write~0 ~c_num_read~0) .cse22 .cse23 .cse19 .cse24 (<= ~c_num_read~0 ~p_num_write~0) (= ~c_dr_pc~0 1)) .cse8 .cse10)))) [2020-10-23 18:54:28,922 INFO L270 CegarLoopResult]: At program point L145(lines 140 192) the Hoare annotation is: (let ((.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse9 (not (= |old(~c_dr_pc~0)| 0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (<= 2 |old(~q_read_ev~0)|))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse10 (not (= |old(~c_num_read~0)| 0)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse0 ~p_num_write~0)) (not (= |old(~c_dr_pc~0)| 1)) (let ((.cse1 (+ ~c_num_read~0 1))) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (<= .cse1 ~p_num_write~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (<= ~p_num_write~0 .cse1) (= |old(~q_free~0)| ~q_free~0) (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_pc~0 1))) (not (<= ~p_num_write~0 .cse0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (or .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse8 (not (= ~p_num_write~0 1))) (or .cse9 (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse2 .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse6 (not (= |old(~p_dw_st~0)| 0)) .cse7 .cse10))) [2020-10-23 18:54:28,922 INFO L274 CegarLoopResult]: For program point L174(lines 174 186) no Hoare annotation was computed. [2020-10-23 18:54:28,922 INFO L274 CegarLoopResult]: For program point L141(lines 141 149) no Hoare annotation was computed. [2020-10-23 18:54:28,922 INFO L270 CegarLoopResult]: At program point do_read_cENTRY(lines 137 193) the Hoare annotation is: (let ((.cse15 (not (= |old(~c_dr_pc~0)| 0))) (.cse1 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse2 (= ~a_t~0 |old(~a_t~0)|)) (.cse3 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse5 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse6 (= |old(~q_free~0)| ~q_free~0)) (.cse7 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_num_read~0 0)) (.cse8 (not (= ~p_dw_i~0 1))) (.cse9 (not (<= 2 |old(~q_read_ev~0)|))) (.cse10 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not (= |old(~q_free~0)| 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (<= 2 ~q_write_ev~0))) (.cse18 (not (= |old(~c_num_read~0)| 0))) (.cse14 (not (= ~p_dw_pc~0 1)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse0 ~p_num_write~0)) (not (= |old(~c_dr_pc~0)| 1)) (let ((.cse4 (+ ~c_num_read~0 1))) (and .cse1 .cse2 .cse3 (<= .cse4 ~p_num_write~0) .cse5 (<= ~p_num_write~0 .cse4) .cse6 .cse7 (= ~c_dr_pc~0 1))) (not (<= ~p_num_write~0 .cse0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (or .cse15 (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) (and .cse1 .cse2 .cse3 .cse5 (= ~p_dw_st~0 0) .cse6 .cse16 .cse17) .cse8 .cse9 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse12 (not (= |old(~p_dw_st~0)| 0)) .cse13 .cse18) (or .cse15 (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse16 .cse17) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 (not (= ~p_num_write~0 1))))) [2020-10-23 18:54:28,922 INFO L274 CegarLoopResult]: For program point L154-1(lines 154 164) no Hoare annotation was computed. [2020-10-23 18:54:28,923 INFO L270 CegarLoopResult]: At program point L179(line 179) the Hoare annotation is: (let ((.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= |old(~q_free~0)| 0))) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse0 (not (= |old(~c_dr_pc~0)| 0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (<= 2 |old(~q_read_ev~0)|))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (<= 2 ~q_write_ev~0))) (.cse7 (not (= |old(~c_num_read~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~p_num_write~0 1))) (let ((.cse9 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse9 ~p_num_write~0)) (not (= |old(~c_dr_pc~0)| 1)) (not (<= ~p_num_write~0 .cse9)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8)) (or .cse0 (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse1 .cse2 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse5 (not (= |old(~p_dw_st~0)| 0)) .cse6 .cse7))) [2020-10-23 18:54:28,923 INFO L274 CegarLoopResult]: For program point L144(lines 144 148) no Hoare annotation was computed. [2020-10-23 18:54:28,923 INFO L274 CegarLoopResult]: For program point L175(lines 175 181) no Hoare annotation was computed. [2020-10-23 18:54:28,923 INFO L270 CegarLoopResult]: At program point L171(line 171) the Hoare annotation is: (let ((.cse12 (not (= |old(~c_dr_pc~0)| 0))) (.cse6 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse7 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= ~q_free~0 1)) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (<= 2 |old(~q_read_ev~0)|))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= |old(~q_free~0)| 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (<= 2 ~q_write_ev~0))) (.cse13 (not (= |old(~c_num_read~0)| 0))) (.cse11 (not (= ~p_dw_pc~0 1)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse0 ~p_num_write~0)) (not (= |old(~c_dr_pc~0)| 1)) (not (<= ~p_num_write~0 .cse0)) .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse9 (<= ~c_num_read~0 ~p_num_write~0) (= ~c_dr_pc~0 1)) .cse10 .cse11)) (or .cse12 (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse1 .cse2 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse5 (not (= |old(~p_dw_st~0)| 0)) .cse10 .cse13) (or .cse12 (and (= ~c_num_read~0 1) .cse6 .cse7 .cse8 (= ~c_dr_pc~0 0) .cse9) .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse13 .cse11 (not (= ~p_num_write~0 1))))) [2020-10-23 18:54:28,923 INFO L274 CegarLoopResult]: For program point L171-1(line 171) no Hoare annotation was computed. [2020-10-23 18:54:28,923 INFO L274 CegarLoopResult]: For program point init_modelFINAL(lines 334 350) no Hoare annotation was computed. [2020-10-23 18:54:28,923 INFO L274 CegarLoopResult]: For program point init_modelEXIT(lines 334 350) no Hoare annotation was computed. [2020-10-23 18:54:28,924 INFO L270 CegarLoopResult]: At program point init_modelENTRY(lines 334 350) the Hoare annotation is: (or (not (= |old(~c_dr_pc~0)| 0)) (not (= ~c_dr_st~0 0)) (not (= ~p_dw_st~0 0)) (and (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= |old(~q_free~0)| ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~c_dr_pc~0 0) (= ~c_num_read~0 0) (= ~p_num_write~0 |old(~p_num_write~0)|)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~c_num_read~0)| 0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-10-23 18:54:29,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:54:29 BoogieIcfgContainer [2020-10-23 18:54:29,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 18:54:29,008 INFO L168 Benchmark]: Toolchain (without parser) took 65150.33 ms. Allocated memory was 152.0 MB in the beginning and 742.4 MB in the end (delta: 590.3 MB). Free memory was 127.0 MB in the beginning and 473.5 MB in the end (delta: -346.5 MB). Peak memory consumption was 447.7 MB. Max. memory is 8.0 GB. [2020-10-23 18:54:29,009 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 152.0 MB. Free memory is still 124.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 18:54:29,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.26 ms. Allocated memory is still 152.0 MB. Free memory was 126.4 MB in the beginning and 114.7 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-10-23 18:54:29,010 INFO L168 Benchmark]: Boogie Preprocessor took 52.82 ms. Allocated memory is still 152.0 MB. Free memory was 114.7 MB in the beginning and 112.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-23 18:54:29,010 INFO L168 Benchmark]: RCFGBuilder took 673.71 ms. Allocated memory is still 152.0 MB. Free memory was 112.8 MB in the beginning and 119.8 MB in the end (delta: -7.1 MB). Peak memory consumption was 15.5 MB. Max. memory is 8.0 GB. [2020-10-23 18:54:29,010 INFO L168 Benchmark]: TraceAbstraction took 64048.93 ms. Allocated memory was 152.0 MB in the beginning and 742.4 MB in the end (delta: 590.3 MB). Free memory was 119.3 MB in the beginning and 473.5 MB in the end (delta: -354.2 MB). Peak memory consumption was 438.5 MB. Max. memory is 8.0 GB. [2020-10-23 18:54:29,013 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 152.0 MB. Free memory is still 124.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 363.26 ms. Allocated memory is still 152.0 MB. Free memory was 126.4 MB in the beginning and 114.7 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 52.82 ms. Allocated memory is still 152.0 MB. Free memory was 114.7 MB in the beginning and 112.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 673.71 ms. Allocated memory is still 152.0 MB. Free memory was 112.8 MB in the beginning and 119.8 MB in the end (delta: -7.1 MB). Peak memory consumption was 15.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 64048.93 ms. Allocated memory was 152.0 MB in the beginning and 742.4 MB in the end (delta: 590.3 MB). Free memory was 119.3 MB in the beginning and 473.5 MB in the end (delta: -354.2 MB). Peak memory consumption was 438.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_num_read == 1 && 2 <= p_dw_st) && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1) || (((((p_dw_st == 0 && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1) && \old(c_num_read) + 1 == c_num_read)) || !(\old(c_dr_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(p_last_write == q_buf_0)) || !(\old(q_free) == 0)) || !(2 <= q_write_ev)) || !(\old(c_num_read) == 0)) || !(p_dw_pc == 1)) || !(p_num_write == 1)) && (((((((((((((((((c_num_read == 1 && 2 <= p_dw_st) && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1) || (((((p_dw_st == 0 && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1) && \old(c_num_read) + 1 == c_num_read)) || !(2 <= q_write_ev)) || !(p_num_write == 1)) || (((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && c_dr_pc == 0) && c_num_read == 0)) || !(\old(c_dr_pc) == 0)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(p_last_write == q_buf_0)) || !(\old(q_free) == 0)) || !(\old(c_num_read) == 0)) || !(p_dw_pc == 1))) && ((((((((((!(\old(c_dr_pc) == 0) || !(p_num_write == 0)) || !(\old(q_free) == 1)) || (((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && q_free == 1) && c_num_read == 0)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(p_last_write == \old(c_last_read))) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(2 <= q_write_ev)) || !(\old(c_num_read) == 0))) && (((((((((((!(\old(c_num_read) + 1 <= p_num_write) || ((((2 <= p_dw_st && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1)) || !(\old(c_dr_pc) == 1)) || !(p_num_write <= \old(c_num_read) + 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || (((((((p_dw_st == 0 && p_num_write <= c_num_read) && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(2 <= q_write_ev)) || !(p_dw_pc == 1)) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: ((((((((((!(\old(p_dw_pc) == 1) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || ((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && c_dr_st == 2) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st))) && ((((((((((((!(2 <= \old(q_write_ev)) || !(\old(q_free) == 1)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(\old(p_dw_st) == 0)) || ((((((c_dr_st == 2 && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1)) || !(\old(c_dr_pc) == 0)) || (((((q_free == 0 && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1)) || !(p_dw_i == 1)) || !(\old(c_dr_st) == 0)) || !(2 <= \old(q_read_ev))) || !(\old(c_num_read) == 0))) && ((((((((((!(\old(c_dr_pc) == 0) || !(\old(q_free) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0)) || !(\old(p_dw_st) == 0)) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == 0))) && ((((((((!(\old(q_free) == 1) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(c_last_read) == \old(p_last_write))) || ((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && c_dr_st == 2) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st)))) && (((((((!(\old(c_dr_pc) == 0) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == 0)) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((!(\old(c_num_read) + 1 <= p_num_write) || !(\old(c_dr_pc) == 1)) || ((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_num_read + 1 <= p_num_write) && c_dr_st == \old(c_dr_st)) && p_num_write <= c_num_read + 1) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && c_dr_pc == 1)) || !(p_num_write <= \old(c_num_read) + 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(2 <= q_write_ev)) || !(p_dw_pc == 1)) && (((((((((!(\old(c_dr_pc) == 0) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(2 <= q_write_ev)) || !(\old(c_num_read) == 0)) || !(p_dw_pc == 1)) || !(p_num_write == 1))) && (((((((((!(\old(c_dr_pc) == 0) || !(p_num_write == 0)) || !(\old(q_free) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(p_last_write == \old(c_last_read))) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(2 <= q_write_ev)) || !(\old(c_num_read) == 0)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((!(c_dr_pc == 1) || !(p_num_write <= c_num_read + 1)) || !(p_dw_i == 1)) || !(c_num_read + 1 <= p_num_write)) || !(2 <= q_read_ev)) || !(c_dr_st == 2)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(p_dw_pc == 1)) || !(q_free == 0)) && ((((((((!(c_dr_st == 0) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || (0 <= __retres1 && __retres1 <= 0)) || !(p_num_write == 1)) || !(q_free == 0))) && ((((((((!(c_dr_pc == 1) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(c_dr_st == 2)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(p_num_write == 1)) || !(q_free == 0))) && ((((((!(p_dw_i == 1) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(c_dr_st == 2)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(c_dr_pc == 0)) - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: ((((((((((((((!(2 <= \old(q_write_ev)) || !(\old(q_free) == 1)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(\old(p_dw_st) == 0)) || ((((((c_dr_st == 2 && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1)) || !(\old(c_dr_pc) == 0)) || (((((q_free == 0 && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1)) || !(p_dw_i == 1)) || !(\old(c_dr_st) == 0)) || !(2 <= \old(q_read_ev))) || (((((c_dr_st == 2 && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 0) && c_num_read == 0)) || ((((((((((\old(p_dw_pc) == p_dw_pc && \old(q_read_ev) == q_read_ev) && p_dw_st == 0) && p_last_write == q_buf_0) && \old(q_free) == q_free) && c_dr_st == 0) && c_last_read == p_last_write) && q_write_ev == \old(q_write_ev)) && c_dr_pc == 0) && c_num_read == 0) && p_num_write == \old(p_num_write))) || ((((((((((\old(p_dw_pc) == p_dw_pc && \old(q_read_ev) == q_read_ev) && c_dr_st == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && \old(q_free) == q_free) && c_last_read == p_last_write) && q_write_ev == \old(q_write_ev)) && c_dr_pc == 0) && c_num_read == 0) && p_num_write == \old(p_num_write))) || !(\old(c_num_read) == 0) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((((((((((!(p_dw_st == 0) || !(p_dw_i == 1)) || (__retres1 <= 1 && 1 <= __retres1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(c_dr_st == 2)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || !(p_dw_pc == 1)) && (((((((((((!(c_dr_pc == 1) || !(p_num_write == 0)) || !(p_dw_st == 0)) || (__retres1 <= 1 && 1 <= __retres1)) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(q_free == 1)) || !(c_dr_st == 2)) || !(2 <= q_read_ev)) || !(p_last_write == q_buf_0)) || !(2 <= q_write_ev)) || !(c_last_read == p_last_write))) && ((((((((((!(p_num_write == 0) || !(p_dw_st == 0)) || !(p_dw_i == 1)) || (__retres1 <= 1 && 1 <= __retres1)) || !(c_num_read == 0)) || !(q_free == 1)) || !(2 <= q_read_ev)) || !(c_dr_st == 2)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || !(c_last_read == p_last_write))) && (((((((((((!(p_num_write == 0) || !(c_dr_st == 0)) || !(p_dw_st == 0)) || (__retres1 <= 1 && 1 <= __retres1)) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(q_free == 1)) || !(2 <= q_read_ev)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || !(2 <= q_write_ev)) || !(c_last_read == p_last_write))) && (((((((((((!(c_dr_st == 0) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || 1 <= __retres1) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || !(2 <= q_write_ev)) || !(2 <= p_dw_st)) || !(p_dw_pc == 1)) || !(p_num_write == 1)) || !(q_free == 0))) && (((((((((((!(c_dr_pc == 1) || !(c_dr_st == 0)) || !(p_dw_i == 1)) || !(p_num_write <= c_num_read + 1)) || !(c_num_read + 1 <= p_num_write)) || !(2 <= q_read_ev)) || !(p_last_write == q_buf_0)) || 1 <= __retres1) || !(2 <= q_write_ev)) || !(2 <= p_dw_st)) || !(p_dw_pc == 1)) || !(q_free == 0))) && ((((((((((((!(p_dw_st == 0) || !(p_num_write <= c_num_read)) || !(2 <= q_read_ev)) || !(c_dr_st == 2)) || !(2 <= q_write_ev)) || !(c_last_read == p_last_write)) || !(c_dr_pc == 1)) || !(c_num_read <= p_num_write)) || !(p_dw_i == 1)) || (__retres1 <= 1 && 1 <= __retres1)) || !(q_free == 1)) || !(p_last_write == q_buf_0)) || !(p_dw_pc == 1)) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((!(c_dr_pc == 1) || !(2 <= \old(q_write_ev))) || !(\old(q_free) == 1)) || (((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_num_write == \old(p_num_write))) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(2 == \old(c_dr_st))) && (((((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && \old(p_dw_st) == p_dw_st) && (((((((\old(p_dw_pc) == p_dw_pc && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_dw_i == 1) && p_num_write == \old(p_num_write)) || (p_dw_i == 1 && !(q_free == 0)))) && c_dr_pc == 0) || !(\old(q_free) == 1)) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(c_dr_pc == 0)) || !(2 == \old(c_dr_st)))) && (((((((!(\old(p_dw_pc) == 1) || (((((c_dr_st == 2 && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_dw_st) == p_dw_st) && (((((((\old(p_dw_pc) == p_dw_pc && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_dw_i == 1) && p_num_write == \old(p_num_write)) || (p_dw_i == 1 && !(q_free == 0)))) && c_dr_pc == 0)) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(c_dr_pc == 0)) || !(2 == \old(c_dr_st)))) && ((((((((((!(2 <= \old(q_write_ev)) || (((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_num_write == \old(p_num_write))) || !(\old(q_free) == 1)) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(c_dr_st) == 0)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(c_dr_pc == 0))) && (((((((((!(c_dr_pc == 1) || !(2 <= \old(q_write_ev))) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= q_read_ev)) || !(\old(p_num_write) <= c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st))) || !(c_num_read <= \old(p_num_write))) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(c_num_read) + 1 <= p_num_write) || !(\old(c_dr_pc) == 1)) || ((((c_dr_st == 2 && 2 <= p_dw_st) && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1)) || !(p_num_write <= \old(c_num_read) + 1)) || (((((((c_dr_st == 2 && p_num_write <= c_num_read) && p_dw_st == 0) && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(2 <= q_write_ev)) || !(p_dw_pc == 1)) && (((((((((((!(\old(c_dr_pc) == 1) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || ((((((((c_num_read == 1 && 2 <= q_write_ev) && c_dr_st == 2) && p_dw_st == 0) && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1)) || !(p_last_write == q_buf_0)) || !(\old(q_free) == 0)) || (((((((((p_num_write == 1 && c_num_read == 1) && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1)) || !(2 <= q_write_ev)) || !(\old(c_num_read) == 0)) || !(p_dw_pc == 1)) || !(p_num_write == 1))) && ((((((((((!(\old(c_dr_pc) == 0) || !(p_num_write == 0)) || !(\old(q_free) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(p_last_write == \old(c_last_read))) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || ((((((c_dr_st == 2 && p_dw_st == 0) && 2 <= q_read_ev) && \old(q_free) == q_free) && c_last_read == p_last_write) && c_num_read == 0) && c_dr_pc == 1)) || !(2 <= q_write_ev)) || !(\old(c_num_read) == 0))) && (((((((((((!(\old(c_dr_pc) == 0) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || ((((((((c_num_read == 1 && 2 <= q_write_ev) && c_dr_st == 2) && p_dw_st == 0) && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1)) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || (((((((((p_num_write == 1 && c_num_read == 1) && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1)) || !(2 <= q_write_ev)) || !(\old(c_num_read) == 0)) || !(p_dw_pc == 1)) || !(p_num_write == 1)) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(p_dw_pc) == p_dw_pc && c_last_read == \old(c_last_read)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && c_dr_pc == 0) && p_last_write == \old(p_last_write)) && c_num_read == 0) && c_dr_st == 2) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write)) || !(\old(c_dr_pc) == 0)) || !(\old(q_free) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0)) || !(\old(p_dw_st) == 0)) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == 0)) && (((((((!(\old(p_dw_pc) == 1) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || ((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && c_dr_st == 2) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st)))) && (((((((((((((((((!(2 <= \old(q_write_ev)) || ((((((((((q_free == 0 && 2 <= q_write_ev) && c_num_read + 1 <= p_num_write) && 1 <= tmp___1) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_st == 0) && c_dr_pc == 1)) || !(\old(q_free) == 1)) || ((((((((((q_free == 0 && 2 <= q_write_ev) && 1 <= tmp___1) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_st == 0) && \old(p_num_write) + 1 == p_num_write) && c_dr_pc == 0) && c_num_read == 0)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((((2 <= q_write_ev && 1 <= tmp___1) && c_dr_st == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1) && p_num_write == \old(p_num_write)) && c_num_read == 0) && c_dr_pc == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(\old(p_dw_st) == 0)) || ((((((c_dr_st == 2 && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1)) || !(\old(c_dr_pc) == 0)) || (((((q_free == 0 && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1)) || !(p_dw_i == 1)) || (((((((((((((\old(p_dw_pc) == p_dw_pc && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == 0) && q_write_ev == \old(q_write_ev)) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && p_last_write == \old(p_last_write)) && c_num_read == 0) && p_dw_st == 0) && c_last_read == p_last_write) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(c_dr_st) == 0)) || !(2 <= \old(q_read_ev))) || ((((((((((((q_free == 1 && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && 2 <= q_write_ev) && 1 <= tmp___1) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write)) || !(\old(c_num_read) == 0))) && (((((((!(\old(c_dr_pc) == 0) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == 0))) && ((((((((!(\old(q_free) == 1) || !(\old(p_dw_pc) == 1)) || ((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && c_dr_st == 2) && p_dw_pc == 1) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st))) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((!(c_dr_pc == 1) || !(2 <= \old(q_write_ev))) || ((((((q_free == 0 && 2 <= q_write_ev) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0)) || !(\old(p_dw_pc) == 1)) || ((((q_free == 0 && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_dw_st) == p_dw_st)) || !(p_dw_i == 1)) || !(2 <= q_read_ev)) || !(\old(p_num_write) <= c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st))) || !(c_num_read <= \old(p_num_write))) && (((((((((((!(2 <= \old(q_write_ev)) || (((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_num_write == \old(p_num_write))) || !(\old(q_free) == 1)) || (((((q_free == 0 && 2 <= q_write_ev) && p_last_write == q_buf_0) && \old(p_dw_st) == p_dw_st) && c_dr_st == 0) && \old(p_num_write) + 1 == p_num_write)) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(c_dr_st) == 0)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(c_dr_pc == 0))) && ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_dw_st) == p_dw_st) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(c_dr_pc == 0)) || !(2 == \old(c_dr_st)))) && (((((((((!(\old(q_free) == 1) || ((c_dr_st == 2 && p_last_write == q_buf_0) && \old(p_dw_st) == p_dw_st)) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(c_dr_pc == 0)) || !(2 == \old(c_dr_st)))) && ((((((((((((!(2 <= \old(q_write_ev)) || !(\old(q_free) == 1)) || !(c_num_read == 0)) || (((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == 2) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_num_write == \old(p_num_write))) || !(2 <= q_read_ev)) || ((((q_free == 0 && 2 <= q_write_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && \old(p_num_write) + 1 == p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(2 == \old(c_dr_st))) || !(c_dr_pc == 1)) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || ((((q_free == 0 && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && \old(p_dw_st) == p_dw_st) && \old(p_num_write) + 1 == p_num_write)) - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(q_free) == 1) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(c_dr_pc == 0)) || (((((c_dr_st == 2 && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 0) && p_dw_i == 1)) || !(2 == \old(c_dr_st))) && (((((((!(\old(p_dw_pc) == 1) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(c_dr_pc == 0)) || (((((c_dr_st == 2 && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 0) && p_dw_i == 1)) || !(2 == \old(c_dr_st)))) && ((((((((((!(2 <= \old(q_write_ev)) || !(\old(q_free) == 1)) || ((((((q_free == 0 && 2 <= q_write_ev) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && \old(p_num_write) + 1 == p_num_write)) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(c_dr_st) == 0)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(c_dr_pc == 0))) && (((((((((((!(c_dr_pc == 1) || !(2 <= \old(q_write_ev))) || (((((q_free == 0 && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write)) || !(\old(q_free) == 1)) || !(c_last_read == \old(p_last_write))) || ((((((q_free == 0 && 2 <= q_write_ev) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && \old(p_num_write) + 1 == p_num_write)) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(2 == \old(c_dr_st)))) && ((((((((((!(c_dr_pc == 1) || !(2 <= \old(q_write_ev))) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= q_read_ev)) || ((((q_free == 0 && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1)) || !(\old(p_num_write) <= c_num_read)) || (((((((q_free == 0 && 2 <= q_write_ev) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st))) || !(c_num_read <= \old(p_num_write))) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((((((((!(c_dr_st == 0) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || (0 <= __retres1 && __retres1 <= 0)) || !(p_num_write == 1)) || !(q_free == 0)) && ((((((((((!(p_dw_st == 0) || !(p_dw_i == 1)) || !(c_num_read == 1)) || !(q_free == 1)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= q_write_ev)) || !(p_dw_pc == 1)) || !(c_last_read == p_last_write)) || !(p_num_write == 1))) && ((((((((((!(c_dr_pc == 1) || !(c_num_read <= p_num_write)) || !(p_num_write <= c_num_read)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= q_write_ev)) || !(2 <= p_dw_st)) || !(p_dw_pc == 1)) || !(c_last_read == p_last_write))) && ((((((!(p_dw_i == 1) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(c_dr_st == 2)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || (0 <= __retres1 && __retres1 <= 0))) && ((((((((((!(c_dr_pc == 1) || !(c_num_read <= p_num_write)) || !(p_dw_st == 0)) || !(p_num_write <= c_num_read)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= q_write_ev)) || !(p_dw_pc == 1)) || !(c_last_read == p_last_write))) && (((((((((!(p_dw_i == 1) || !(c_num_read == 1)) || !(q_free == 1)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= p_dw_st)) || !(p_dw_pc == 1)) || !(c_last_read == p_last_write)) || !(p_num_write == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 35.7s, OverallIterations: 17, TraceHistogramMax: 6, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 28.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2548 SDtfs, 5093 SDslu, 3160 SDs, 0 SdLazy, 9191 SolverSat, 1613 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2554 GetRequests, 2257 SyntacticMatches, 8 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2364 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1910occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 1015 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 3919 PreInvPairs, 4440 NumberOfFragments, 8286 HoareAnnotationTreeSize, 3919 FomulaSimplifications, 3468006 FormulaSimplificationTreeSizeReduction, 6.5s HoareSimplificationTime, 46 FomulaSimplificationsInter, 166466 FormulaSimplificationTreeSizeReductionInter, 21.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 3984 NumberOfCodeBlocks, 3984 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3956 ConstructedInterpolants, 0 QuantifiedInterpolants, 1453764 SizeOfPredicates, 23 NumberOfNonLiveVariables, 9545 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 2506/2810 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...