/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_FUNCTIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 14:58:34,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 14:58:34,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 14:58:34,190 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 14:58:34,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 14:58:34,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 14:58:34,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 14:58:34,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 14:58:34,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 14:58:34,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 14:58:34,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 14:58:34,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 14:58:34,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 14:58:34,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 14:58:34,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 14:58:34,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 14:58:34,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 14:58:34,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 14:58:34,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 14:58:34,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 14:58:34,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 14:58:34,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 14:58:34,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 14:58:34,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 14:58:34,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 14:58:34,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 14:58:34,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 14:58:34,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 14:58:34,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 14:58:34,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 14:58:34,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 14:58:34,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 14:58:34,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 14:58:34,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 14:58:34,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 14:58:34,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 14:58:34,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 14:58:34,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 14:58:34,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 14:58:34,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 14:58:34,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 14:58:34,249 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-07-20 14:58:34,286 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 14:58:34,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 14:58:34,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 14:58:34,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 14:58:34,288 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 14:58:34,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 14:58:34,290 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 14:58:34,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 14:58:34,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 14:58:34,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 14:58:34,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 14:58:34,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 14:58:34,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 14:58:34,292 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 14:58:34,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 14:58:34,292 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 14:58:34,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 14:58:34,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 14:58:34,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 14:58:34,293 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 14:58:34,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 14:58:34,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 14:58:34,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 14:58:34,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 14:58:34,295 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 14:58:34,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 14:58:34,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:34,295 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 14:58:34,296 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 14:58:34,296 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_FUNCTIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-20 14:58:34,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 14:58:34,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 14:58:34,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 14:58:34,575 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 14:58:34,576 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 14:58:34,577 INFO L429 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-07-20 14:58:34,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d559e53f/78dd4a3ea30e456280d4979b48942e8c/FLAGd06c73b45 [2020-07-20 14:58:35,100 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 14:58:35,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-20 14:58:35,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d559e53f/78dd4a3ea30e456280d4979b48942e8c/FLAGd06c73b45 [2020-07-20 14:58:35,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d559e53f/78dd4a3ea30e456280d4979b48942e8c [2020-07-20 14:58:35,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 14:58:35,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 14:58:35,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 14:58:35,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 14:58:35,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 14:58:35,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:58:35" (1/1) ... [2020-07-20 14:58:35,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f41f43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:58:35, skipping insertion in model container [2020-07-20 14:58:35,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:58:35" (1/1) ... [2020-07-20 14:58:35,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 14:58:35,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 14:58:35,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 14:58:35,749 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 14:58:35,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 14:58:35,799 INFO L208 MainTranslator]: Completed translation [2020-07-20 14:58:35,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:58:35 WrapperNode [2020-07-20 14:58:35,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 14:58:35,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 14:58:35,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 14:58:35,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 14:58:35,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:58:35" (1/1) ... [2020-07-20 14:58:35,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:58:35" (1/1) ... [2020-07-20 14:58:35,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:58:35" (1/1) ... [2020-07-20 14:58:35,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:58:35" (1/1) ... [2020-07-20 14:58:35,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:58:35" (1/1) ... [2020-07-20 14:58:35,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:58:35" (1/1) ... [2020-07-20 14:58:35,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:58:35" (1/1) ... [2020-07-20 14:58:35,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 14:58:35,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 14:58:35,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 14:58:35,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 14:58:35,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:58:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 14:58:36,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 14:58:36,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 14:58:36,004 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 14:58:36,005 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-07-20 14:58:36,005 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-07-20 14:58:36,005 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-07-20 14:58:36,005 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-07-20 14:58:36,005 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-07-20 14:58:36,006 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 14:58:36,006 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 14:58:36,006 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 14:58:36,006 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 14:58:36,006 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 14:58:36,006 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 14:58:36,007 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 14:58:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 14:58:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 14:58:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 14:58:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-07-20 14:58:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-07-20 14:58:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-07-20 14:58:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-07-20 14:58:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-07-20 14:58:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 14:58:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 14:58:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 14:58:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 14:58:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 14:58:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 14:58:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 14:58:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 14:58:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 14:58:36,391 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 14:58:36,391 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 14:58:36,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:58:36 BoogieIcfgContainer [2020-07-20 14:58:36,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 14:58:36,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 14:58:36,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 14:58:36,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 14:58:36,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 02:58:35" (1/3) ... [2020-07-20 14:58:36,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c52891b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:58:36, skipping insertion in model container [2020-07-20 14:58:36,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:58:35" (2/3) ... [2020-07-20 14:58:36,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c52891b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:58:36, skipping insertion in model container [2020-07-20 14:58:36,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:58:36" (3/3) ... [2020-07-20 14:58:36,405 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-07-20 14:58:36,416 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 14:58:36,423 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 14:58:36,442 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 14:58:36,476 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 14:58:36,476 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 14:58:36,476 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 14:58:36,476 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 14:58:36,477 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 14:58:36,477 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 14:58:36,477 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 14:58:36,477 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 14:58:36,504 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2020-07-20 14:58:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 14:58:36,513 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:36,514 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] [2020-07-20 14:58:36,515 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:36,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:36,520 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2020-07-20 14:58:36,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:36,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [311981085] [2020-07-20 14:58:36,527 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:36,747 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 14:58:36,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:36,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 14:58:36,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:58:36,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:36,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [311981085] [2020-07-20 14:58:36,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:36,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:58:36,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997344450] [2020-07-20 14:58:36,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:58:36,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:36,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:58:36,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:36,845 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2020-07-20 14:58:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:36,941 INFO L93 Difference]: Finished difference Result 279 states and 395 transitions. [2020-07-20 14:58:36,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:58:36,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-20 14:58:36,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:36,958 INFO L225 Difference]: With dead ends: 279 [2020-07-20 14:58:36,958 INFO L226 Difference]: Without dead ends: 175 [2020-07-20 14:58:36,963 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-07-20 14:58:37,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2020-07-20 14:58:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-07-20 14:58:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2020-07-20 14:58:37,033 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 65 [2020-07-20 14:58:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:37,033 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2020-07-20 14:58:37,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:58:37,034 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2020-07-20 14:58:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 14:58:37,040 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:37,040 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-07-20 14:58:37,254 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:37,254 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:37,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:37,255 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2020-07-20 14:58:37,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:37,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1903945848] [2020-07-20 14:58:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:37,404 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:58:37,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:37,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 14:58:37,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:58:37,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:37,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1903945848] [2020-07-20 14:58:37,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:37,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:58:37,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119687130] [2020-07-20 14:58:37,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:58:37,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:37,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:58:37,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:37,458 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 3 states. [2020-07-20 14:58:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:37,514 INFO L93 Difference]: Finished difference Result 368 states and 491 transitions. [2020-07-20 14:58:37,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:58:37,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-20 14:58:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:37,519 INFO L225 Difference]: With dead ends: 368 [2020-07-20 14:58:37,519 INFO L226 Difference]: Without dead ends: 217 [2020-07-20 14:58:37,522 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-07-20 14:58:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 189. [2020-07-20 14:58:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-07-20 14:58:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 241 transitions. [2020-07-20 14:58:37,551 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 241 transitions. Word has length 66 [2020-07-20 14:58:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:37,551 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 241 transitions. [2020-07-20 14:58:37,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:58:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 241 transitions. [2020-07-20 14:58:37,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 14:58:37,555 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:37,555 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-07-20 14:58:37,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:37,769 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:37,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:37,770 INFO L82 PathProgramCache]: Analyzing trace with hash 258652184, now seen corresponding path program 1 times [2020-07-20 14:58:37,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:37,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [837337848] [2020-07-20 14:58:37,772 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:37,834 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 14:58:37,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:37,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 14:58:37,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:58:37,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:37,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [837337848] [2020-07-20 14:58:37,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:37,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:58:37,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249306106] [2020-07-20 14:58:37,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:58:37,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:37,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:58:37,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:37,862 INFO L87 Difference]: Start difference. First operand 189 states and 241 transitions. Second operand 3 states. [2020-07-20 14:58:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:37,888 INFO L93 Difference]: Finished difference Result 358 states and 459 transitions. [2020-07-20 14:58:37,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:58:37,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-20 14:58:37,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:37,892 INFO L225 Difference]: With dead ends: 358 [2020-07-20 14:58:37,892 INFO L226 Difference]: Without dead ends: 186 [2020-07-20 14:58:37,894 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:37,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-07-20 14:58:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2020-07-20 14:58:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-07-20 14:58:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2020-07-20 14:58:37,920 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 66 [2020-07-20 14:58:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:37,920 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2020-07-20 14:58:37,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:58:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2020-07-20 14:58:37,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-20 14:58:37,924 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:37,924 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] [2020-07-20 14:58:38,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:38,138 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:38,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:38,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1757497946, now seen corresponding path program 1 times [2020-07-20 14:58:38,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:38,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1965541746] [2020-07-20 14:58:38,140 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:38,270 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:58:38,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:38,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 14:58:38,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:58:38,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:38,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1965541746] [2020-07-20 14:58:38,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:38,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 14:58:38,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331086108] [2020-07-20 14:58:38,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 14:58:38,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:38,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 14:58:38,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-20 14:58:38,348 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand 5 states. [2020-07-20 14:58:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:38,883 INFO L93 Difference]: Finished difference Result 587 states and 834 transitions. [2020-07-20 14:58:38,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 14:58:38,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-07-20 14:58:38,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:38,889 INFO L225 Difference]: With dead ends: 587 [2020-07-20 14:58:38,889 INFO L226 Difference]: Without dead ends: 418 [2020-07-20 14:58:38,891 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 14:58:38,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-07-20 14:58:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 374. [2020-07-20 14:58:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-07-20 14:58:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 521 transitions. [2020-07-20 14:58:38,956 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 521 transitions. Word has length 72 [2020-07-20 14:58:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:38,960 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 521 transitions. [2020-07-20 14:58:38,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 14:58:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 521 transitions. [2020-07-20 14:58:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 14:58:38,964 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:38,971 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-07-20 14:58:39,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:39,186 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:39,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1988256317, now seen corresponding path program 1 times [2020-07-20 14:58:39,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:39,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684571830] [2020-07-20 14:58:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:39,303 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:58:39,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:39,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-20 14:58:39,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:58:39,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:39,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684571830] [2020-07-20 14:58:39,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:39,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:58:39,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948477709] [2020-07-20 14:58:39,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:58:39,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:39,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:58:39,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:39,351 INFO L87 Difference]: Start difference. First operand 374 states and 521 transitions. Second operand 3 states. [2020-07-20 14:58:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:39,408 INFO L93 Difference]: Finished difference Result 749 states and 1084 transitions. [2020-07-20 14:58:39,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:58:39,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-20 14:58:39,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:39,415 INFO L225 Difference]: With dead ends: 749 [2020-07-20 14:58:39,415 INFO L226 Difference]: Without dead ends: 392 [2020-07-20 14:58:39,417 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-07-20 14:58:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 387. [2020-07-20 14:58:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-07-20 14:58:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 541 transitions. [2020-07-20 14:58:39,469 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 541 transitions. Word has length 66 [2020-07-20 14:58:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:39,470 INFO L479 AbstractCegarLoop]: Abstraction has 387 states and 541 transitions. [2020-07-20 14:58:39,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:58:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 541 transitions. [2020-07-20 14:58:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 14:58:39,472 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:39,473 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-07-20 14:58:39,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:39,682 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:39,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:39,684 INFO L82 PathProgramCache]: Analyzing trace with hash -490335048, now seen corresponding path program 1 times [2020-07-20 14:58:39,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:39,685 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1182839329] [2020-07-20 14:58:39,685 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:39,793 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:58:39,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:39,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 14:58:39,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:58:39,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:39,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1182839329] [2020-07-20 14:58:39,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:39,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:58:39,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128359326] [2020-07-20 14:58:39,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:58:39,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:39,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:58:39,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:39,830 INFO L87 Difference]: Start difference. First operand 387 states and 541 transitions. Second operand 3 states. [2020-07-20 14:58:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:39,893 INFO L93 Difference]: Finished difference Result 1068 states and 1577 transitions. [2020-07-20 14:58:39,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:58:39,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-20 14:58:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:39,899 INFO L225 Difference]: With dead ends: 1068 [2020-07-20 14:58:39,899 INFO L226 Difference]: Without dead ends: 698 [2020-07-20 14:58:39,902 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:39,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2020-07-20 14:58:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 674. [2020-07-20 14:58:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-07-20 14:58:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 945 transitions. [2020-07-20 14:58:39,954 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 945 transitions. Word has length 66 [2020-07-20 14:58:39,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:39,954 INFO L479 AbstractCegarLoop]: Abstraction has 674 states and 945 transitions. [2020-07-20 14:58:39,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:58:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 945 transitions. [2020-07-20 14:58:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-20 14:58:39,956 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:39,956 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] [2020-07-20 14:58:40,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:40,173 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:40,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:40,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1613085175, now seen corresponding path program 1 times [2020-07-20 14:58:40,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:40,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1328953422] [2020-07-20 14:58:40,175 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:40,226 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 14:58:40,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:40,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 14:58:40,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:58:40,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:40,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1328953422] [2020-07-20 14:58:40,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:40,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:58:40,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525582669] [2020-07-20 14:58:40,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:58:40,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:40,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:58:40,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:40,247 INFO L87 Difference]: Start difference. First operand 674 states and 945 transitions. Second operand 3 states. [2020-07-20 14:58:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:40,325 INFO L93 Difference]: Finished difference Result 1688 states and 2496 transitions. [2020-07-20 14:58:40,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:58:40,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-07-20 14:58:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:40,333 INFO L225 Difference]: With dead ends: 1688 [2020-07-20 14:58:40,333 INFO L226 Difference]: Without dead ends: 1031 [2020-07-20 14:58:40,338 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:40,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2020-07-20 14:58:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1031. [2020-07-20 14:58:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2020-07-20 14:58:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1460 transitions. [2020-07-20 14:58:40,406 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1460 transitions. Word has length 86 [2020-07-20 14:58:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:40,406 INFO L479 AbstractCegarLoop]: Abstraction has 1031 states and 1460 transitions. [2020-07-20 14:58:40,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:58:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1460 transitions. [2020-07-20 14:58:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-07-20 14:58:40,439 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:40,439 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, 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] [2020-07-20 14:58:40,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:40,655 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:40,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:40,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1344012707, now seen corresponding path program 1 times [2020-07-20 14:58:40,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:40,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2073792121] [2020-07-20 14:58:40,656 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:40,719 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 14:58:40,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:40,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 14:58:40,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-07-20 14:58:40,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:40,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2073792121] [2020-07-20 14:58:40,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:40,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:58:40,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815062983] [2020-07-20 14:58:40,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:58:40,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:40,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:58:40,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:40,761 INFO L87 Difference]: Start difference. First operand 1031 states and 1460 transitions. Second operand 3 states. [2020-07-20 14:58:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:40,818 INFO L93 Difference]: Finished difference Result 1806 states and 2552 transitions. [2020-07-20 14:58:40,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:58:40,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2020-07-20 14:58:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:40,825 INFO L225 Difference]: With dead ends: 1806 [2020-07-20 14:58:40,825 INFO L226 Difference]: Without dead ends: 830 [2020-07-20 14:58:40,829 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2020-07-20 14:58:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2020-07-20 14:58:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2020-07-20 14:58:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1166 transitions. [2020-07-20 14:58:40,887 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1166 transitions. Word has length 148 [2020-07-20 14:58:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:40,888 INFO L479 AbstractCegarLoop]: Abstraction has 830 states and 1166 transitions. [2020-07-20 14:58:40,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:58:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1166 transitions. [2020-07-20 14:58:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-07-20 14:58:40,890 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:40,890 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] [2020-07-20 14:58:41,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:41,104 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:41,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:41,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1306254340, now seen corresponding path program 1 times [2020-07-20 14:58:41,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:41,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2144641745] [2020-07-20 14:58:41,109 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:41,229 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 14:58:41,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:41,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-20 14:58:41,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-20 14:58:41,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:41,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2144641745] [2020-07-20 14:58:41,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:41,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:58:41,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131739414] [2020-07-20 14:58:41,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:58:41,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:41,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:58:41,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:41,286 INFO L87 Difference]: Start difference. First operand 830 states and 1166 transitions. Second operand 3 states. [2020-07-20 14:58:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:41,375 INFO L93 Difference]: Finished difference Result 1605 states and 2369 transitions. [2020-07-20 14:58:41,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:58:41,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2020-07-20 14:58:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:41,384 INFO L225 Difference]: With dead ends: 1605 [2020-07-20 14:58:41,384 INFO L226 Difference]: Without dead ends: 830 [2020-07-20 14:58:41,391 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2020-07-20 14:58:41,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2020-07-20 14:58:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2020-07-20 14:58:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1160 transitions. [2020-07-20 14:58:41,522 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1160 transitions. Word has length 97 [2020-07-20 14:58:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:41,523 INFO L479 AbstractCegarLoop]: Abstraction has 830 states and 1160 transitions. [2020-07-20 14:58:41,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:58:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1160 transitions. [2020-07-20 14:58:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-07-20 14:58:41,526 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:41,526 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] [2020-07-20 14:58:41,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:41,741 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:41,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:41,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1546521669, now seen corresponding path program 1 times [2020-07-20 14:58:41,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:41,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265245027] [2020-07-20 14:58:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:41,830 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 14:58:41,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:41,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-20 14:58:41,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:58:41,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:58:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 14:58:41,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265245027] [2020-07-20 14:58:41,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 14:58:41,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2020-07-20 14:58:41,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184614855] [2020-07-20 14:58:41,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 14:58:41,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:41,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 14:58:41,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 14:58:41,948 INFO L87 Difference]: Start difference. First operand 830 states and 1160 transitions. Second operand 4 states. [2020-07-20 14:58:42,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:42,097 INFO L93 Difference]: Finished difference Result 907 states and 1288 transitions. [2020-07-20 14:58:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-20 14:58:42,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-07-20 14:58:42,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:42,104 INFO L225 Difference]: With dead ends: 907 [2020-07-20 14:58:42,105 INFO L226 Difference]: Without dead ends: 904 [2020-07-20 14:58:42,105 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-20 14:58:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2020-07-20 14:58:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 897. [2020-07-20 14:58:42,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2020-07-20 14:58:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1271 transitions. [2020-07-20 14:58:42,165 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1271 transitions. Word has length 97 [2020-07-20 14:58:42,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:42,165 INFO L479 AbstractCegarLoop]: Abstraction has 897 states and 1271 transitions. [2020-07-20 14:58:42,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 14:58:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1271 transitions. [2020-07-20 14:58:42,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-07-20 14:58:42,168 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:42,168 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-20 14:58:42,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:42,384 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1432579718, now seen corresponding path program 1 times [2020-07-20 14:58:42,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:42,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [114675314] [2020-07-20 14:58:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:42,518 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:58:42,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:42,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 14:58:42,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-20 14:58:42,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:42,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [114675314] [2020-07-20 14:58:42,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:42,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 14:58:42,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162545809] [2020-07-20 14:58:42,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 14:58:42,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:42,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 14:58:42,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 14:58:42,568 INFO L87 Difference]: Start difference. First operand 897 states and 1271 transitions. Second operand 6 states. [2020-07-20 14:58:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:42,677 INFO L93 Difference]: Finished difference Result 1904 states and 2806 transitions. [2020-07-20 14:58:42,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 14:58:42,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2020-07-20 14:58:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:42,686 INFO L225 Difference]: With dead ends: 1904 [2020-07-20 14:58:42,686 INFO L226 Difference]: Without dead ends: 1024 [2020-07-20 14:58:42,692 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-20 14:58:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2020-07-20 14:58:42,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 878. [2020-07-20 14:58:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2020-07-20 14:58:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1185 transitions. [2020-07-20 14:58:42,767 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1185 transitions. Word has length 148 [2020-07-20 14:58:42,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:42,767 INFO L479 AbstractCegarLoop]: Abstraction has 878 states and 1185 transitions. [2020-07-20 14:58:42,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 14:58:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1185 transitions. [2020-07-20 14:58:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-20 14:58:42,769 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:42,770 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] [2020-07-20 14:58:42,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:42,983 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:42,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:42,983 INFO L82 PathProgramCache]: Analyzing trace with hash 697227160, now seen corresponding path program 1 times [2020-07-20 14:58:42,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:42,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [101013906] [2020-07-20 14:58:42,986 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:43,136 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:58:43,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:43,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 14:58:43,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:58:43,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:43,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [101013906] [2020-07-20 14:58:43,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:43,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 14:58:43,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961784220] [2020-07-20 14:58:43,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 14:58:43,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:43,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 14:58:43,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 14:58:43,193 INFO L87 Difference]: Start difference. First operand 878 states and 1185 transitions. Second operand 5 states. [2020-07-20 14:58:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:43,754 INFO L93 Difference]: Finished difference Result 2364 states and 3435 transitions. [2020-07-20 14:58:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 14:58:43,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-07-20 14:58:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:43,766 INFO L225 Difference]: With dead ends: 2364 [2020-07-20 14:58:43,766 INFO L226 Difference]: Without dead ends: 1529 [2020-07-20 14:58:43,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-20 14:58:43,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2020-07-20 14:58:43,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1419. [2020-07-20 14:58:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2020-07-20 14:58:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1968 transitions. [2020-07-20 14:58:43,877 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1968 transitions. Word has length 98 [2020-07-20 14:58:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:43,877 INFO L479 AbstractCegarLoop]: Abstraction has 1419 states and 1968 transitions. [2020-07-20 14:58:43,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 14:58:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1968 transitions. [2020-07-20 14:58:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-20 14:58:43,880 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:43,880 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-07-20 14:58:44,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:44,094 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:44,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:44,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1565088270, now seen corresponding path program 1 times [2020-07-20 14:58:44,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:44,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [810053671] [2020-07-20 14:58:44,095 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:44,192 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:58:44,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:44,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 14:58:44,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-20 14:58:44,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:44,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [810053671] [2020-07-20 14:58:44,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:44,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 14:58:44,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179802579] [2020-07-20 14:58:44,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 14:58:44,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:44,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 14:58:44,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 14:58:44,225 INFO L87 Difference]: Start difference. First operand 1419 states and 1968 transitions. Second operand 6 states. [2020-07-20 14:58:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:44,357 INFO L93 Difference]: Finished difference Result 2806 states and 4121 transitions. [2020-07-20 14:58:44,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 14:58:44,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2020-07-20 14:58:44,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:44,366 INFO L225 Difference]: With dead ends: 2806 [2020-07-20 14:58:44,366 INFO L226 Difference]: Without dead ends: 1449 [2020-07-20 14:58:44,376 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 14:58:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-07-20 14:58:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1449. [2020-07-20 14:58:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2020-07-20 14:58:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1972 transitions. [2020-07-20 14:58:44,464 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 1972 transitions. Word has length 99 [2020-07-20 14:58:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:44,465 INFO L479 AbstractCegarLoop]: Abstraction has 1449 states and 1972 transitions. [2020-07-20 14:58:44,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 14:58:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1972 transitions. [2020-07-20 14:58:44,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-20 14:58:44,467 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:44,467 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] [2020-07-20 14:58:44,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:44,682 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:44,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:44,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1191538996, now seen corresponding path program 1 times [2020-07-20 14:58:44,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:44,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [506599209] [2020-07-20 14:58:44,684 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:44,782 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:58:44,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:44,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 14:58:44,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-20 14:58:44,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:44,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [506599209] [2020-07-20 14:58:44,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:44,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 14:58:44,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027140176] [2020-07-20 14:58:44,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 14:58:44,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:44,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 14:58:44,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 14:58:44,815 INFO L87 Difference]: Start difference. First operand 1449 states and 1972 transitions. Second operand 6 states. [2020-07-20 14:58:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:44,906 INFO L93 Difference]: Finished difference Result 2908 states and 4178 transitions. [2020-07-20 14:58:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 14:58:44,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2020-07-20 14:58:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:44,916 INFO L225 Difference]: With dead ends: 2908 [2020-07-20 14:58:44,916 INFO L226 Difference]: Without dead ends: 1521 [2020-07-20 14:58:44,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 14:58:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2020-07-20 14:58:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1521. [2020-07-20 14:58:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2020-07-20 14:58:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2032 transitions. [2020-07-20 14:58:45,010 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2032 transitions. Word has length 99 [2020-07-20 14:58:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:45,011 INFO L479 AbstractCegarLoop]: Abstraction has 1521 states and 2032 transitions. [2020-07-20 14:58:45,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 14:58:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2032 transitions. [2020-07-20 14:58:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-07-20 14:58:45,013 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:45,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-20 14:58:45,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:45,227 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:45,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:45,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1611389462, now seen corresponding path program 1 times [2020-07-20 14:58:45,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:45,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [495372773] [2020-07-20 14:58:45,228 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:45,399 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:58:45,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:45,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 14:58:45,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-20 14:58:45,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:45,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [495372773] [2020-07-20 14:58:45,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:45,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:58:45,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731788431] [2020-07-20 14:58:45,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:58:45,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:45,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:58:45,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:45,515 INFO L87 Difference]: Start difference. First operand 1521 states and 2032 transitions. Second operand 3 states. [2020-07-20 14:58:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:45,617 INFO L93 Difference]: Finished difference Result 2696 states and 3700 transitions. [2020-07-20 14:58:45,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:58:45,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2020-07-20 14:58:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:45,627 INFO L225 Difference]: With dead ends: 2696 [2020-07-20 14:58:45,627 INFO L226 Difference]: Without dead ends: 1554 [2020-07-20 14:58:45,636 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2020-07-20 14:58:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1521. [2020-07-20 14:58:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2020-07-20 14:58:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2028 transitions. [2020-07-20 14:58:45,731 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2028 transitions. Word has length 119 [2020-07-20 14:58:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:45,732 INFO L479 AbstractCegarLoop]: Abstraction has 1521 states and 2028 transitions. [2020-07-20 14:58:45,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:58:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2028 transitions. [2020-07-20 14:58:45,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-20 14:58:45,734 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:45,734 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] [2020-07-20 14:58:45,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:45,947 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:45,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:45,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2020-07-20 14:58:45,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:45,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1526470967] [2020-07-20 14:58:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:46,078 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:58:46,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:46,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-20 14:58:46,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:58:46,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:58:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 14:58:46,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1526470967] [2020-07-20 14:58:46,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 14:58:46,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2020-07-20 14:58:46,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716310231] [2020-07-20 14:58:46,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 14:58:46,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:46,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 14:58:46,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-20 14:58:46,363 INFO L87 Difference]: Start difference. First operand 1521 states and 2028 transitions. Second operand 12 states. [2020-07-20 14:58:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:48,240 INFO L93 Difference]: Finished difference Result 5661 states and 9466 transitions. [2020-07-20 14:58:48,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-20 14:58:48,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2020-07-20 14:58:48,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:48,283 INFO L225 Difference]: With dead ends: 5661 [2020-07-20 14:58:48,283 INFO L226 Difference]: Without dead ends: 5658 [2020-07-20 14:58:48,287 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2020-07-20 14:58:48,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2020-07-20 14:58:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 4912. [2020-07-20 14:58:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4912 states. [2020-07-20 14:58:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4912 states to 4912 states and 7820 transitions. [2020-07-20 14:58:48,683 INFO L78 Accepts]: Start accepts. Automaton has 4912 states and 7820 transitions. Word has length 99 [2020-07-20 14:58:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:48,683 INFO L479 AbstractCegarLoop]: Abstraction has 4912 states and 7820 transitions. [2020-07-20 14:58:48,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 14:58:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 4912 states and 7820 transitions. [2020-07-20 14:58:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-20 14:58:48,689 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:48,690 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] [2020-07-20 14:58:48,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:48,905 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:48,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:48,906 INFO L82 PathProgramCache]: Analyzing trace with hash 83738947, now seen corresponding path program 2 times [2020-07-20 14:58:48,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:48,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [307992421] [2020-07-20 14:58:48,907 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:48,961 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 14:58:48,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:48,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 14:58:48,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 14:58:49,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:49,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [307992421] [2020-07-20 14:58:49,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:49,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:58:49,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857255799] [2020-07-20 14:58:49,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:58:49,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:49,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:58:49,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:49,035 INFO L87 Difference]: Start difference. First operand 4912 states and 7820 transitions. Second operand 3 states. [2020-07-20 14:58:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:49,222 INFO L93 Difference]: Finished difference Result 7679 states and 12731 transitions. [2020-07-20 14:58:49,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:58:49,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-07-20 14:58:49,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:49,246 INFO L225 Difference]: With dead ends: 7679 [2020-07-20 14:58:49,246 INFO L226 Difference]: Without dead ends: 3673 [2020-07-20 14:58:49,294 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2020-07-20 14:58:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3452. [2020-07-20 14:58:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2020-07-20 14:58:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 5008 transitions. [2020-07-20 14:58:49,531 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 5008 transitions. Word has length 125 [2020-07-20 14:58:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:49,533 INFO L479 AbstractCegarLoop]: Abstraction has 3452 states and 5008 transitions. [2020-07-20 14:58:49,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:58:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 5008 transitions. [2020-07-20 14:58:49,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-20 14:58:49,541 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:58:49,541 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] [2020-07-20 14:58:49,756 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:49,757 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:58:49,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:58:49,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1615516102, now seen corresponding path program 1 times [2020-07-20 14:58:49,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:58:49,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [457494638] [2020-07-20 14:58:49,758 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:49,822 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 14:58:49,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:58:49,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 14:58:49,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:58:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-20 14:58:49,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:58:49,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [457494638] [2020-07-20 14:58:49,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:58:49,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:58:49,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310378684] [2020-07-20 14:58:49,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:58:49,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:58:49,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:58:49,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:49,852 INFO L87 Difference]: Start difference. First operand 3452 states and 5008 transitions. Second operand 3 states. [2020-07-20 14:58:49,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:58:49,945 INFO L93 Difference]: Finished difference Result 4199 states and 6087 transitions. [2020-07-20 14:58:49,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:58:49,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-07-20 14:58:49,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:58:49,949 INFO L225 Difference]: With dead ends: 4199 [2020-07-20 14:58:49,949 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 14:58:49,972 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:58:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 14:58:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 14:58:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 14:58:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 14:58:49,974 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2020-07-20 14:58:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:58:49,974 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 14:58:49,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:58:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 14:58:49,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 14:58:50,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:58:50,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 14:58:53,353 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2020-07-20 14:58:53,735 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2020-07-20 14:58:53,948 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2020-07-20 14:58:54,226 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2020-07-20 14:58:54,575 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2020-07-20 14:58:54,845 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2020-07-20 14:58:55,030 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2020-07-20 14:58:55,427 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2020-07-20 14:58:55,665 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2020-07-20 14:58:58,261 WARN L193 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 145 DAG size of output: 117 [2020-07-20 14:58:58,428 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2020-07-20 14:58:58,653 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2020-07-20 14:58:59,219 WARN L193 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2020-07-20 14:58:59,424 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-07-20 14:59:01,432 WARN L193 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 125 DAG size of output: 110 [2020-07-20 14:59:02,425 WARN L193 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 103 [2020-07-20 14:59:02,695 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2020-07-20 14:59:03,648 WARN L193 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2020-07-20 14:59:03,806 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2020-07-20 14:59:04,410 WARN L193 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2020-07-20 14:59:06,868 WARN L193 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 145 DAG size of output: 117 [2020-07-20 14:59:07,141 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2020-07-20 14:59:07,561 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2020-07-20 14:59:08,064 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2020-07-20 14:59:08,706 WARN L193 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2020-07-20 14:59:08,982 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2020-07-20 14:59:09,160 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2020-07-20 14:59:09,165 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2020-07-20 14:59:09,165 INFO L268 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2020-07-20 14:59:09,165 INFO L268 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2020-07-20 14:59:09,166 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2020-07-20 14:59:09,166 INFO L264 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 0 ~p_dw_st~0))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse1 (not (<= 2 ~q_write_ev~0))) (.cse5 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse6 (not (= 1 ~q_free~0))) (.cse7 (not (= 1 ~c_dr_i~0))) (.cse2 (not (<= 2 ~q_read_ev~0))) (.cse8 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (not (<= ~c_dr_pc~0 0)) .cse0 .cse1 (not (= 0 ~p_num_write~0)) .cse2 (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse3 (not (<= 1 ~c_dr_pc~0)) .cse4 .cse1 (not (= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 (not (<= 2 ~c_dr_st~0)) .cse7 .cse2 .cse8))) [2020-07-20 14:59:09,166 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2020-07-20 14:59:09,167 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2020-07-20 14:59:09,167 INFO L268 CegarLoopResult]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2020-07-20 14:59:09,167 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (not (<= ~c_dr_pc~0 0)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (<= 2 ~q_write_ev~0)) (not (= 0 ~p_num_write~0)) (not (<= 2 ~q_read_ev~0)) (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) (not (= 1 ~p_dw_i~0)) (= 0 ~p_dw_st~0) (not (= 1 ~q_free~0)) (not (= 1 ~c_dr_i~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-20 14:59:09,167 INFO L268 CegarLoopResult]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2020-07-20 14:59:09,167 INFO L264 CegarLoopResult]: At program point L354-1(line 354) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (and (<= ~p_dw_pc~0 0) (<= 2 ~q_read_ev~0) (= 1 ~p_dw_i~0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~q_free~0) (= 1 ~c_dr_i~0) (<= 2 ~q_write_ev~0)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 14:59:09,167 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 14:59:09,168 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2020-07-20 14:59:09,168 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2020-07-20 14:59:09,168 INFO L268 CegarLoopResult]: For program point L355(line 355) no Hoare annotation was computed. [2020-07-20 14:59:09,168 INFO L264 CegarLoopResult]: At program point L354(line 354) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 14:59:09,168 INFO L264 CegarLoopResult]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse4 (= 0 ~q_free~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (<= 2 ~q_write_ev~0)) (.cse3 (not (<= 2 |old(~q_write_ev~0)|))) (.cse8 (not (= 1 ~c_dr_i~0))) (.cse9 (not (<= 2 ~q_read_ev~0)))) (and (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse0 (not (<= 1 ~c_dr_pc~0)) .cse1 .cse2 (not (<= 2 |old(~c_dr_st~0)|)) .cse3 (and .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 .cse6 .cse7) .cse8 .cse9) (or (not (= 0 ~c_num_read~0)) (not (<= ~c_dr_pc~0 0)) .cse0 .cse1 (not (= 0 |old(~p_num_write~0)|)) .cse2 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (and .cse4 (= 1 ~p_num_write~0) .cse5 .cse6 .cse7) .cse3 (not (<= |old(~p_dw_pc~0)| 0)) .cse8 .cse9))) [2020-07-20 14:59:09,168 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse4 (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse6 (= 1 ~q_free~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~q_write_ev~0)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 |old(~q_write_ev~0)|))) (.cse8 (not (= 1 ~c_dr_i~0))) (.cse9 (not (<= 2 ~q_read_ev~0)))) (and (or (not (= 0 ~c_num_read~0)) (not (<= ~c_dr_pc~0 0)) .cse0 .cse1 (not (= 0 |old(~p_num_write~0)|)) .cse2 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) .cse3 (not (<= |old(~p_dw_pc~0)| 0)) (and .cse4 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0) .cse5 .cse6 .cse7) .cse8 .cse9) (or (and (<= 2 ~c_dr_st~0) .cse4 (= ~c_num_read~0 ~p_num_write~0) .cse6 .cse5 .cse7) (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse0 (not (<= 1 ~c_dr_pc~0)) .cse1 .cse2 (not (<= 2 |old(~c_dr_st~0)|)) .cse3 .cse8 .cse9))) [2020-07-20 14:59:09,168 INFO L264 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse3 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (not (= 1 |old(~q_free~0)|))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not (<= 2 |old(~q_write_ev~0)|))) (.cse7 (not (= 1 ~c_dr_i~0))) (.cse8 (not (<= 2 ~q_read_ev~0)))) (and (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (and (<= 2 ~c_dr_st~0) .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2) .cse3 (not (<= 1 ~c_dr_pc~0)) .cse4 .cse5 (not (<= 2 |old(~c_dr_st~0)|)) .cse6 .cse7 .cse8) (or (not (= 0 ~c_num_read~0)) (not (<= ~c_dr_pc~0 0)) .cse3 .cse4 (not (= 0 |old(~p_num_write~0)|)) .cse5 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (and .cse0 .cse1 (= 1 ~p_num_write~0) .cse2) .cse6 (not (<= |old(~p_dw_pc~0)| 0)) .cse7 .cse8))) [2020-07-20 14:59:09,169 INFO L268 CegarLoopResult]: For program point L124-1(line 124) no Hoare annotation was computed. [2020-07-20 14:59:09,169 INFO L268 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2020-07-20 14:59:09,169 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2020-07-20 14:59:09,169 INFO L264 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~q_write_ev~0)) (.cse6 (not (<= 2 |old(~q_write_ev~0)|))) (.cse7 (not (= 1 ~c_dr_i~0))) (.cse8 (not (<= 2 ~q_read_ev~0)))) (and (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse0 (not (<= 1 ~c_dr_pc~0)) .cse1 .cse2 (not (<= 2 |old(~c_dr_st~0)|)) (and (<= 2 ~c_dr_st~0) .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5) .cse6 .cse7 .cse8) (or (not (= 0 ~c_num_read~0)) (not (<= ~c_dr_pc~0 0)) .cse0 .cse1 (not (= 0 |old(~p_num_write~0)|)) .cse2 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (and .cse3 (= 0 ~p_num_write~0) .cse4 .cse5) .cse6 (not (<= |old(~p_dw_pc~0)| 0)) .cse7 .cse8))) [2020-07-20 14:59:09,169 INFO L264 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse4 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse10 (not (<= 2 ~q_read_ev~0))) (.cse5 (not (= 1 |old(~q_free~0)|))) (.cse6 (not (= 1 ~p_dw_i~0))) (.cse7 (= 0 ~q_free~0)) (.cse0 (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= 1 ~q_free~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse9 (not (= 1 ~c_dr_i~0)))) (and (or (and (<= 2 ~c_dr_st~0) .cse0 (= ~c_num_read~0 ~p_num_write~0) .cse1 .cse2 .cse3) (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse4 (not (<= 1 ~c_dr_pc~0)) .cse5 .cse6 (not (<= 2 |old(~c_dr_st~0)|)) (and .cse7 .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3) .cse8 .cse9 .cse10) (or (not (<= ~c_dr_pc~0 0)) .cse4 (not (= 0 |old(~p_num_write~0)|)) .cse8 (not (<= |old(~p_dw_pc~0)| 0)) .cse10 (not (= 0 ~c_num_read~0)) .cse5 .cse6 (and .cse7 .cse0 (= 1 ~p_num_write~0) .cse2 .cse3) (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (and .cse0 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0) .cse2 .cse1 .cse3) .cse9))) [2020-07-20 14:59:09,169 INFO L268 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2020-07-20 14:59:09,169 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-07-20 14:59:09,169 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-20 14:59:09,170 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-07-20 14:59:09,170 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-07-20 14:59:09,170 INFO L264 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (<= 1 ~c_dr_pc~0))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 ~q_write_ev~0))) (.cse4 (not (= 1 ~q_free~0))) (.cse5 (not (= 1 ~c_dr_i~0))) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0)) .cse5 .cse6 (not (= 1 ~c_num_read~0)) .cse7) (or (<= 2 ~c_dr_st~0) .cse0 .cse8 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (not (<= 2 |old(~c_dr_st~0)|)) (not (= 0 ~q_free~0)) .cse5 (not (<= 2 ~q_read_ev~0))) (or .cse0 .cse8 .cse1 .cse2 .cse3 (not (= ~c_num_read~0 ~p_num_write~0)) .cse4 .cse5 .cse6 .cse7))) [2020-07-20 14:59:09,170 INFO L268 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2020-07-20 14:59:09,170 INFO L268 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-07-20 14:59:09,170 INFO L268 CegarLoopResult]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2020-07-20 14:59:09,170 INFO L268 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2020-07-20 14:59:09,170 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2020-07-20 14:59:09,171 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (<= 1 ~c_dr_pc~0))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 ~q_write_ev~0))) (.cse4 (not (= 1 ~q_free~0))) (.cse5 (not (= 1 ~c_dr_i~0))) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0)) .cse5 .cse6 (not (= 1 ~c_num_read~0)) .cse7) (or (<= 2 ~c_dr_st~0) .cse0 .cse8 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (not (<= 2 |old(~c_dr_st~0)|)) (not (= 0 ~q_free~0)) .cse5 (not (<= 2 ~q_read_ev~0))) (or .cse0 .cse8 .cse1 .cse2 .cse3 (not (= ~c_num_read~0 ~p_num_write~0)) .cse4 .cse5 .cse6 .cse7))) [2020-07-20 14:59:09,171 INFO L264 CegarLoopResult]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse12 (= 0 immediate_notify_threads_~tmp~0))) (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (<= 2 ~q_write_ev~0))) (.cse4 (and (<= 1 ~p_dw_pc~0) (= 0 ~p_dw_st~0))) (.cse5 (and (<= 2 ~p_dw_st~0) .cse12)) (.cse6 (not (= 1 ~q_free~0))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse7 (not (= 1 ~p_num_write~0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (<= 1 ~c_dr_pc~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse11 (not (= 0 ~q_free~0))) (.cse8 (not (= 1 ~c_dr_i~0))) (.cse13 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 1 ~c_num_read~0)) .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~c_num_read~0 ~p_num_write~0)) .cse4 .cse5 .cse6 .cse8 .cse9) (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) (not (<= ~c_dr_pc~0 0)) .cse0 .cse2 .cse7 .cse11 .cse8 .cse12 .cse13) (or .cse0 .cse10 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (not (<= 2 |old(~c_dr_st~0)|)) (and (<= 2 ~c_dr_st~0) .cse12) .cse11 .cse8 .cse13)))) [2020-07-20 14:59:09,171 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-07-20 14:59:09,171 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 14:59:09,171 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (= ~c_num_read~0 ~p_num_write~0)) (<= |old(~q_free~0)| ~q_free~0)) [2020-07-20 14:59:09,171 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 14:59:09,172 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse13 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse6 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse7 (not (<= 2 |old(~c_dr_st~0)|))) (.cse11 (<= 2 ~c_dr_st~0)) (.cse17 (<= 1 ~c_dr_pc~0)) (.cse24 (= 0 ~c_num_read~0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (= 1 ~q_free~0)) (.cse3 (not (= 1 |old(~q_free~0)|))) (.cse10 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~p_num_write~0)|))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse12 (not (= 0 |old(~q_free~0)|))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse23 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (= 0 ~q_free~0)) (.cse15 (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse16 (<= 2 ~q_read_ev~0)) (.cse25 (<= ~c_dr_pc~0 0)) (.cse18 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (<= 2 ~p_dw_st~0)) (.cse20 (<= 2 ~q_write_ev~0)) (.cse26 (not (<= |old(~c_dr_pc~0)| 0))) (.cse1 (not (<= 2 |old(~q_write_ev~0)|))) (.cse8 (not (= 1 ~c_dr_i~0))) (.cse9 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 .cse1 (= 1 ~c_num_read~0) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 1 |old(~c_num_read~0)|)) .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse4 .cse12 .cse5 .cse6 .cse7 .cse1 .cse8 .cse9 .cse13) (or .cse0 .cse4 .cse12 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse14 .cse15 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse16 .cse17 .cse18 .cse19 .cse20) .cse5 .cse6 .cse1 .cse8 .cse9 .cse13) (or .cse0 .cse3 .cse4 .cse5 .cse6 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse7 .cse1 (and .cse11 .cse15 .cse16 .cse21 (= ~c_num_read~0 ~p_num_write~0) .cse17 .cse18 .cse22 .cse19 .cse20) .cse8 .cse9 .cse10) (or .cse0 .cse2 .cse4 .cse12 .cse5 .cse23 .cse24 .cse1 .cse8 .cse9) (or .cse0 (not (= 0 |old(~p_dw_st~0)|)) (and .cse15 .cse16 .cse24 .cse21 (= 0 ~p_dw_st~0) .cse25 (= 0 ~p_num_write~0) .cse18 .cse22 .cse20) (not (= 0 |old(~p_num_write~0)|)) .cse1 (not (<= |old(~p_dw_pc~0)| 0)) .cse3 .cse5 .cse23 .cse26 .cse8 .cse9 .cse10) (or .cse0 .cse2 .cse4 .cse12 .cse5 .cse23 (and .cse14 .cse15 .cse16 (= 1 ~p_num_write~0) .cse25 .cse18 .cse19 .cse20) .cse26 .cse1 .cse8 .cse9))) [2020-07-20 14:59:09,172 INFO L264 CegarLoopResult]: At program point L254(line 254) the Hoare annotation is: (let ((.cse14 (<= 2 ~c_dr_st~0)) (.cse15 (<= 2 ~q_read_ev~0)) (.cse16 (= ~c_num_read~0 ~p_num_write~0)) (.cse17 (<= 1 ~c_dr_pc~0)) (.cse18 (= 1 ~q_free~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (<= 2 ~q_write_ev~0))) (let ((.cse8 (and (<= 1 |old(~p_dw_pc~0)|) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse11 (not (= 1 |old(~q_free~0)|))) (.cse4 (not (= 0 |old(~c_num_read~0)|))) (.cse13 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse9 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse12 (not (<= 2 |old(~c_dr_st~0)|))) (.cse5 (not (<= 2 |old(~q_write_ev~0)|))) (.cse6 (not (= 1 ~c_dr_i~0))) (.cse7 (not (<= 2 |old(~q_read_ev~0)|))) (.cse10 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 (not (= 1 |old(~p_num_write~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse11 .cse1 .cse3 .cse9 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse12 .cse5 .cse6 .cse7 .cse13) (or .cse0 (not (= 0 |old(~p_dw_st~0)|)) (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (not (= 0 |old(~p_num_write~0)|)) .cse5 (not (<= |old(~p_dw_pc~0)| 0)) (and (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse15 (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (<= 1 eval_~tmp___1~0) (= 0 ~p_num_write~0) .cse19 .cse18 .cse20) .cse11 .cse3 .cse4 (not (<= |old(~c_dr_pc~0)| 0)) .cse6 .cse7 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse12 .cse5 .cse6 .cse7 .cse10)))) [2020-07-20 14:59:09,172 INFO L268 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-07-20 14:59:09,172 INFO L268 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2020-07-20 14:59:09,172 INFO L268 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-07-20 14:59:09,173 INFO L264 CegarLoopResult]: At program point L238(line 238) the Hoare annotation is: (let ((.cse22 (= 0 ~q_free~0)) (.cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse35 (= 0 ~p_dw_st~0)) (.cse39 (<= 1 |old(~p_dw_pc~0)|)) (.cse38 (= 1 ~p_dw_i~0)) (.cse37 (= 1 ~c_dr_i~0)) (.cse1 (<= 2 ~c_dr_st~0)) (.cse2 (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse23 (<= 2 ~q_read_ev~0)) (.cse31 (= ~c_last_read~0 ~p_last_write~0)) (.cse34 (= ~c_num_read~0 ~p_num_write~0)) (.cse32 (<= 1 ~c_dr_pc~0)) (.cse26 (= ~p_last_write~0 ~q_buf_0~0)) (.cse33 (= 1 ~q_free~0)) (.cse27 (<= 2 ~p_dw_st~0)) (.cse28 (<= 2 ~q_write_ev~0))) (let ((.cse14 (= 1 ~c_num_read~0)) (.cse18 (and .cse1 .cse2 .cse23 .cse31 .cse34 .cse32 .cse26 .cse33 .cse27 .cse28)) (.cse0 (not (= ~c_num_read~0 |old(~p_num_write~0)|))) (.cse13 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse25 (<= ~c_dr_pc~0 0)) (.cse16 (not (= 1 |old(~q_free~0)|))) (.cse30 (not (<= |old(~c_dr_pc~0)| 0))) (.cse17 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse19 (and .cse39 .cse1 .cse23 .cse38 .cse31 .cse34 .cse32 .cse33 .cse26 .cse37 .cse27 .cse28)) (.cse20 (and .cse39 .cse1 .cse23 .cse38 .cse31 .cse35 .cse34 .cse32 .cse33 .cse26 .cse28)) (.cse21 (and .cse39 .cse22 .cse3 .cse23 .cse38 .cse32 .cse26 .cse37 .cse27 .cse28)) (.cse36 (= 1 ~p_num_write~0)) (.cse4 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse15 (not (= 1 |old(~p_num_write~0)|))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= 0 |old(~q_free~0)|))) (.cse7 (not .cse38)) (.cse8 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse29 (not (= 0 |old(~c_num_read~0)|))) (.cse24 (= 0 ~c_num_read~0)) (.cse9 (not (<= 2 |old(~c_dr_st~0)|))) (.cse10 (not (<= 2 |old(~q_write_ev~0)|))) (.cse11 (not .cse37)) (.cse12 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 .cse10 .cse14 .cse15 .cse16 .cse5 .cse7 .cse8 (not (= 1 |old(~c_num_read~0)|)) .cse9 .cse11 .cse12 .cse17) (or .cse4 .cse16 .cse5 .cse7 .cse8 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse9 .cse10 .cse18 .cse11 .cse12 .cse17) (or .cse19 .cse4 .cse6 .cse20 .cse21 .cse10 (and .cse22 .cse2 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse15 .cse5 .cse7 .cse29 .cse30 (and .cse14 .cse1 .cse2 .cse23 .cse31 .cse32 .cse26 .cse33 .cse27 .cse28) .cse11 .cse12) (or .cse19 .cse4 .cse6 .cse20 .cse21 .cse10 .cse18 .cse5 (and .cse0 .cse22 .cse2 .cse3 .cse23 .cse32 .cse26 .cse27 .cse28) .cse7 .cse8 .cse11 .cse12 .cse13) (or .cse4 (not (= 0 |old(~p_dw_st~0)|)) (and .cse1 .cse23 .cse31 .cse34 .cse35 .cse32 .cse33 .cse26 .cse28) (not (= 0 |old(~p_num_write~0)|)) .cse10 (not (<= |old(~p_dw_pc~0)| 0)) (and .cse1 .cse23 .cse31 .cse34 .cse32 .cse33 .cse26 .cse27 .cse28) (and .cse22 .cse23 .cse24 .cse36 .cse26 .cse27 .cse28) (and .cse2 .cse23 .cse31 .cse24 .cse35 .cse25 (= 0 ~p_num_write~0) .cse26 .cse33 .cse28) .cse16 (and .cse22 .cse3 .cse23 .cse32 .cse26 .cse27 .cse28) .cse7 .cse29 .cse30 .cse11 .cse12 .cse17) (or .cse19 .cse4 .cse6 .cse20 .cse21 .cse36 .cse10 .cse15 .cse5 .cse7 .cse29 .cse11 .cse12) (or .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse29 .cse24 .cse9 .cse10 .cse11 .cse12)))) [2020-07-20 14:59:09,173 INFO L264 CegarLoopResult]: At program point L269(line 269) the Hoare annotation is: (let ((.cse11 (= 0 ~q_free~0)) (.cse20 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse13 (<= 2 ~q_read_ev~0)) (.cse28 (= 1 ~p_dw_i~0)) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (= 1 ~c_dr_i~0)) (.cse17 (<= 2 ~p_dw_st~0)) (.cse18 (<= 2 ~q_write_ev~0))) (let ((.cse1 (not (= 1 |old(~p_num_write~0)|))) (.cse5 (and (<= 1 |old(~p_dw_pc~0)|) .cse11 .cse20 .cse13 .cse28 .cse21 .cse16 .cse27 .cse17 .cse18)) (.cse12 (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse14 (= 0 ~c_num_read~0)) (.cse7 (= 1 ~p_num_write~0)) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse19 (not (<= |old(~c_dr_pc~0)| 0))) (.cse24 (not (= 1 |old(~q_free~0)|))) (.cse25 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse4 (not .cse28)) (.cse22 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse26 (not (<= 2 |old(~c_dr_st~0)|))) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse9 (not .cse27)) (.cse10 (not (<= 2 |old(~q_read_ev~0)|))) (.cse23 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse9 .cse10) (or .cse0 .cse2 .cse3 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse11 .cse12 .cse20 .cse13 .cse21 .cse16 .cse17 .cse18) .cse4 .cse22 .cse5 .cse8 .cse9 .cse10 .cse23) (or .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse12 .cse13 .cse14 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse15 (<= 1 eval_~tmp___1~0) (= 0 ~p_num_write~0) .cse16 (= 1 ~q_free~0) .cse18) .cse8 (not (<= |old(~p_dw_pc~0)| 0)) (and .cse11 .cse13 .cse14 .cse7 .cse16 .cse17 .cse18) .cse24 (and .cse11 .cse20 .cse13 .cse21 .cse16 .cse17 .cse18) .cse4 .cse6 .cse19 .cse9 .cse10 .cse25) (or .cse0 .cse24 .cse2 .cse4 .cse22 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse26 .cse8 .cse9 .cse10 .cse25) (or .cse0 .cse2 .cse3 .cse4 .cse22 .cse26 .cse8 .cse9 .cse10 .cse23)))) [2020-07-20 14:59:09,173 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2020-07-20 14:59:09,173 INFO L268 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2020-07-20 14:59:09,173 INFO L268 CegarLoopResult]: For program point L247(lines 237 277) no Hoare annotation was computed. [2020-07-20 14:59:09,173 INFO L264 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse16 (= 0 ~q_free~0)) (.cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse35 (<= 1 |old(~p_dw_pc~0)|)) (.cse36 (= 1 ~p_dw_i~0)) (.cse34 (= 1 ~c_dr_i~0)) (.cse1 (<= 2 ~c_dr_st~0)) (.cse2 (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse17 (<= 2 ~q_read_ev~0)) (.cse25 (= ~c_last_read~0 ~p_last_write~0)) (.cse26 (= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= 1 ~c_dr_pc~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (= 1 ~q_free~0)) (.cse20 (<= 2 ~p_dw_st~0)) (.cse21 (<= 2 ~q_write_ev~0))) (let ((.cse0 (not (= ~c_num_read~0 |old(~p_num_write~0)|))) (.cse13 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse24 (= 1 ~p_num_write~0)) (.cse28 (not (= 1 |old(~q_free~0)|))) (.cse15 (and .cse1 .cse2 .cse17 .cse25 .cse26 .cse18 .cse19 .cse27 .cse20 .cse21)) (.cse31 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse8 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse9 (not (<= 2 |old(~c_dr_st~0)|))) (.cse4 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (= 0 |old(~q_free~0)|))) (.cse14 (and .cse35 .cse1 .cse17 .cse36 .cse25 .cse26 .cse18 .cse19 .cse27 .cse34 .cse20 .cse21)) (.cse10 (not (<= 2 |old(~q_write_ev~0)|))) (.cse23 (= 0 ~c_num_read~0)) (.cse33 (not (= 1 |old(~p_num_write~0)|))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse7 (not .cse36)) (.cse29 (not (= 0 |old(~c_num_read~0)|))) (.cse30 (not (<= |old(~c_dr_pc~0)| 0))) (.cse22 (and .cse35 .cse16 .cse3 .cse17 .cse36 .cse18 .cse19 .cse20 .cse21)) (.cse32 (= 1 ~c_num_read~0)) (.cse11 (not .cse34)) (.cse12 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 .cse6 .cse14 .cse10 .cse15 .cse5 (and .cse0 .cse16 .cse2 .cse3 .cse17 .cse18 .cse19 .cse20 .cse21) .cse7 .cse8 .cse22 .cse11 .cse12 .cse13) (or .cse4 (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse10 (not (<= |old(~p_dw_pc~0)| 0)) (and .cse16 .cse17 .cse23 .cse24 .cse19 .cse20 .cse21) (and .cse1 .cse17 .cse25 .cse26 .cse18 .cse27 .cse19 .cse20 .cse21) .cse28 (and .cse16 .cse3 .cse17 .cse18 .cse19 .cse20 .cse21) .cse7 .cse29 .cse30 .cse11 .cse12 .cse31) (or .cse4 .cse10 .cse32 .cse33 .cse28 .cse5 .cse7 .cse8 (not (= 1 |old(~c_num_read~0)|)) .cse9 .cse11 .cse12 .cse31) (or .cse4 .cse33 .cse6 .cse5 .cse7 .cse29 .cse14 .cse22 .cse24 .cse10 .cse11 .cse12) (or .cse4 .cse28 .cse5 .cse7 .cse8 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse9 .cse10 .cse15 .cse11 .cse12 .cse31) (or .cse4 .cse33 .cse5 .cse6 .cse7 .cse8 .cse29 .cse23 .cse9 .cse10 .cse11 .cse12) (or .cse4 .cse6 .cse14 .cse10 (and .cse16 .cse2 .cse17 .cse23 (<= ~c_dr_pc~0 0) .cse19 .cse20 .cse21) .cse33 .cse5 .cse7 .cse29 .cse30 .cse22 (and .cse32 .cse1 .cse2 .cse17 .cse25 .cse18 .cse19 .cse27 .cse20 .cse21) .cse11 .cse12)))) [2020-07-20 14:59:09,174 INFO L268 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2020-07-20 14:59:09,174 INFO L264 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse22 (= 0 ~q_free~0)) (.cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse35 (= 0 ~p_dw_st~0)) (.cse39 (<= 1 |old(~p_dw_pc~0)|)) (.cse38 (= 1 ~p_dw_i~0)) (.cse37 (= 1 ~c_dr_i~0)) (.cse1 (<= 2 ~c_dr_st~0)) (.cse2 (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse23 (<= 2 ~q_read_ev~0)) (.cse31 (= ~c_last_read~0 ~p_last_write~0)) (.cse34 (= ~c_num_read~0 ~p_num_write~0)) (.cse32 (<= 1 ~c_dr_pc~0)) (.cse26 (= ~p_last_write~0 ~q_buf_0~0)) (.cse33 (= 1 ~q_free~0)) (.cse27 (<= 2 ~p_dw_st~0)) (.cse28 (<= 2 ~q_write_ev~0))) (let ((.cse14 (= 1 ~c_num_read~0)) (.cse18 (and .cse1 .cse2 .cse23 .cse31 .cse34 .cse32 .cse26 .cse33 .cse27 .cse28)) (.cse0 (not (= ~c_num_read~0 |old(~p_num_write~0)|))) (.cse13 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse25 (<= ~c_dr_pc~0 0)) (.cse16 (not (= 1 |old(~q_free~0)|))) (.cse30 (not (<= |old(~c_dr_pc~0)| 0))) (.cse17 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse19 (and .cse39 .cse1 .cse23 .cse38 .cse31 .cse34 .cse32 .cse33 .cse26 .cse37 .cse27 .cse28)) (.cse20 (and .cse39 .cse1 .cse23 .cse38 .cse31 .cse35 .cse34 .cse32 .cse33 .cse26 .cse28)) (.cse21 (and .cse39 .cse22 .cse3 .cse23 .cse38 .cse32 .cse26 .cse37 .cse27 .cse28)) (.cse36 (= 1 ~p_num_write~0)) (.cse4 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse15 (not (= 1 |old(~p_num_write~0)|))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= 0 |old(~q_free~0)|))) (.cse7 (not .cse38)) (.cse8 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse29 (not (= 0 |old(~c_num_read~0)|))) (.cse24 (= 0 ~c_num_read~0)) (.cse9 (not (<= 2 |old(~c_dr_st~0)|))) (.cse10 (not (<= 2 |old(~q_write_ev~0)|))) (.cse11 (not .cse37)) (.cse12 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 .cse10 .cse14 .cse15 .cse16 .cse5 .cse7 .cse8 (not (= 1 |old(~c_num_read~0)|)) .cse9 .cse11 .cse12 .cse17) (or .cse4 .cse16 .cse5 .cse7 .cse8 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse9 .cse10 .cse18 .cse11 .cse12 .cse17) (or .cse19 .cse4 .cse6 .cse20 .cse21 .cse10 (and .cse22 .cse2 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse15 .cse5 .cse7 .cse29 .cse30 (and .cse14 .cse1 .cse2 .cse23 .cse31 .cse32 .cse26 .cse33 .cse27 .cse28) .cse11 .cse12) (or .cse19 .cse4 .cse6 .cse20 .cse21 .cse10 .cse18 .cse5 (and .cse0 .cse22 .cse2 .cse3 .cse23 .cse32 .cse26 .cse27 .cse28) .cse7 .cse8 .cse11 .cse12 .cse13) (or .cse4 (not (= 0 |old(~p_dw_st~0)|)) (and .cse1 .cse23 .cse31 .cse34 .cse35 .cse32 .cse33 .cse26 .cse28) (not (= 0 |old(~p_num_write~0)|)) .cse10 (not (<= |old(~p_dw_pc~0)| 0)) (and .cse1 .cse23 .cse31 .cse34 .cse32 .cse33 .cse26 .cse27 .cse28) (and .cse22 .cse23 .cse24 .cse36 .cse26 .cse27 .cse28) (and .cse2 .cse23 .cse31 .cse24 .cse35 .cse25 (= 0 ~p_num_write~0) .cse26 .cse33 .cse28) .cse16 (and .cse22 .cse3 .cse23 .cse32 .cse26 .cse27 .cse28) .cse7 .cse29 .cse30 .cse11 .cse12 .cse17) (or .cse19 .cse4 .cse6 .cse20 .cse21 .cse36 .cse10 .cse15 .cse5 .cse7 .cse29 .cse11 .cse12) (or .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse29 .cse24 .cse9 .cse10 .cse11 .cse12)))) [2020-07-20 14:59:09,174 INFO L268 CegarLoopResult]: For program point L290-1(line 290) no Hoare annotation was computed. [2020-07-20 14:59:09,174 INFO L271 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: true [2020-07-20 14:59:09,174 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2020-07-20 14:59:09,174 INFO L268 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2020-07-20 14:59:09,174 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2020-07-20 14:59:09,174 INFO L271 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: true [2020-07-20 14:59:09,175 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2020-07-20 14:59:09,175 INFO L264 CegarLoopResult]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse7 (not (= 1 ~p_num_write~0))) (.cse9 (not (= 1 ~c_num_read~0))) (.cse11 (not (<= 2 ~p_dw_st~0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse12 (not (<= 1 ~c_dr_pc~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 ~q_write_ev~0))) (.cse13 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse4 (not (<= 1 ~p_dw_pc~0))) (.cse6 (not (= 1 ~q_free~0))) (.cse5 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse8 (not (= 1 ~c_dr_i~0))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) (not (<= ~c_dr_pc~0 0)) .cse0 .cse2 .cse7 (not (= 0 ~q_free~0)) .cse5 .cse8 (not (<= 2 ~q_read_ev~0))) (or .cse0 .cse2 .cse3 .cse6 .cse7 .cse5 .cse11 .cse8 .cse9 .cse10) (or .cse0 .cse12 .cse2 .cse3 .cse13 .cse6 .cse5 .cse11 .cse8 .cse10) (or .cse0 .cse1 .cse12 .cse2 .cse3 .cse13 .cse4 .cse6 .cse5 .cse8 .cse10))) [2020-07-20 14:59:09,175 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2020-07-20 14:59:09,175 INFO L268 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2020-07-20 14:59:09,175 INFO L268 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2020-07-20 14:59:09,175 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2020-07-20 14:59:09,175 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2020-07-20 14:59:09,175 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2020-07-20 14:59:09,175 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (and (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (<= 2 ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~q_free~0) (<= 2 ~q_write_ev~0)) (not (= 0 |old(~p_num_write~0)|)) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 1 ~c_dr_i~0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 14:59:09,176 INFO L268 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2020-07-20 14:59:09,176 INFO L268 CegarLoopResult]: For program point L318(line 318) no Hoare annotation was computed. [2020-07-20 14:59:09,176 INFO L264 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse1 (= 0 ~c_num_read~0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= 1 ~q_free~0)) (.cse6 (= 0 ~q_free~0)) (.cse0 (<= 2 ~q_read_ev~0)) (.cse8 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~p_dw_st~0)) (.cse5 (<= 2 ~q_write_ev~0))) (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (and (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse0 .cse1 .cse2 (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) .cse3 .cse4 .cse5) (not (= 0 |old(~p_num_write~0)|)) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse6 .cse0 .cse1 (= 1 ~p_num_write~0) .cse3 .cse7 .cse5) (and (<= 2 ~c_dr_st~0) .cse0 .cse2 (= ~c_num_read~0 ~p_num_write~0) .cse8 .cse4 .cse3 .cse7 .cse5) (not (= 1 |old(~q_free~0)|)) (and .cse6 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse0 .cse8 .cse3 .cse7 .cse5) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 1 ~c_dr_i~0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-20 14:59:09,176 INFO L264 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~q_read_ev~0)) (.cse5 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~p_dw_st~0)) (.cse4 (<= 2 ~q_write_ev~0))) (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse0 .cse1 (= 0 ~c_num_read~0) (= 1 ~p_num_write~0) .cse2 .cse3 .cse4) (and (<= 2 ~c_dr_st~0) .cse1 (= ~c_last_read~0 ~p_last_write~0) (= ~c_num_read~0 ~p_num_write~0) .cse5 (= 1 ~q_free~0) .cse2 .cse3 .cse4) (not (= 1 |old(~q_free~0)|)) (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse5 .cse2 .cse3 .cse4) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 1 ~c_dr_i~0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-20 14:59:09,176 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2020-07-20 14:59:09,176 INFO L268 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2020-07-20 14:59:09,177 INFO L264 CegarLoopResult]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse1 (= 0 ~c_num_read~0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= 1 ~q_free~0)) (.cse6 (= 0 ~q_free~0)) (.cse0 (<= 2 ~q_read_ev~0)) (.cse8 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~p_dw_st~0)) (.cse5 (<= 2 ~q_write_ev~0))) (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (and (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse0 .cse1 .cse2 (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) .cse3 .cse4 .cse5) (not (= 0 |old(~p_num_write~0)|)) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse6 .cse0 .cse1 (= 1 ~p_num_write~0) .cse3 .cse7 .cse5) (and (<= 2 ~c_dr_st~0) .cse0 .cse2 (= ~c_num_read~0 ~p_num_write~0) .cse8 .cse4 .cse3 .cse7 .cse5) (not (= 1 |old(~q_free~0)|)) (and .cse6 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse0 .cse8 .cse3 .cse7 .cse5) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 1 ~c_dr_i~0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-20 14:59:09,177 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (and (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (<= 2 ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~q_free~0) (<= 2 ~q_write_ev~0)) (not (= 0 |old(~p_num_write~0)|)) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 1 ~c_dr_i~0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 14:59:09,177 INFO L271 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2020-07-20 14:59:09,177 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 14:59:09,177 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) [2020-07-20 14:59:09,177 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 14:59:09,177 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 14:59:09,177 INFO L268 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2020-07-20 14:59:09,178 INFO L268 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2020-07-20 14:59:09,178 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2020-07-20 14:59:09,178 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2020-07-20 14:59:09,178 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2020-07-20 14:59:09,178 INFO L264 CegarLoopResult]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse4 (not (= 0 ~q_free~0))) (.cse6 (not (<= 2 ~q_read_ev~0))) (.cse7 (not (<= 1 ~c_dr_pc~0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (<= 1 ~p_dw_pc~0)) (.cse1 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse9 (not (<= 2 ~q_write_ev~0))) (.cse10 (not (= 1 ~q_free~0))) (.cse3 (not (= 1 ~p_num_write~0))) (.cse11 (not (<= 2 ~p_dw_st~0))) (.cse5 (not (= 1 ~c_dr_i~0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) (not (<= ~c_dr_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse1 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse4 (not (<= 2 ~c_dr_st~0)) .cse5 .cse6) (or .cse0 .cse8 .cse7 .cse1 .cse2 .cse9 (not (= ~c_num_read~0 ~p_num_write~0)) .cse10 .cse11 .cse5 .cse12) (or .cse0 .cse8 .cse1 .cse2 .cse9 .cse10 .cse3 .cse11 .cse5 (not (= 1 ~c_num_read~0)) .cse12))) [2020-07-20 14:59:09,178 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2020-07-20 14:59:09,178 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2020-07-20 14:59:09,178 INFO L264 CegarLoopResult]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse15 (<= 1 ~p_dw_pc~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse7 (<= 2 ~c_dr_st~0)) (.cse8 (<= 2 ~q_read_ev~0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= 0 ~p_dw_st~0)) (.cse10 (<= 1 ~c_dr_pc~0)) (.cse11 (= 1 ~q_free~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse5 (not (= 0 |old(~c_num_read~0)|))) (.cse13 (not (= 1 ~c_dr_i~0))) (.cse14 (not (<= 2 |old(~q_read_ev~0)|)))) (and (let ((.cse6 (= 1 ~c_num_read~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (not (= 1 ~p_num_write~0)) .cse13 .cse14 (and .cse6 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11))) (let ((.cse17 (= ~c_num_read~0 ~p_num_write~0))) (or .cse0 .cse1 .cse2 (not (<= 1 |old(~c_dr_pc~0)|)) .cse3 .cse4 (and .cse7 .cse15 .cse8 .cse9 .cse17 .cse16 .cse10 .cse11) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) (and .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12) .cse13 .cse14)) (or (and .cse7 .cse8 (= 0 ~c_num_read~0) .cse9 .cse16 .cse10 .cse11) .cse0 (not (= 0 |old(~p_dw_st~0)|)) .cse4 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) (not (= 0 ~p_num_write~0)) (not (<= ~p_dw_pc~0 0)) (not (= 1 |old(~q_free~0)|)) .cse3 .cse5 (not (<= |old(~c_dr_pc~0)| 0)) .cse13 .cse14))) [2020-07-20 14:59:09,178 INFO L268 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2020-07-20 14:59:09,178 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (let ((.cse3 (not (= 0 |old(~c_num_read~0)|))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (<= 2 |old(~p_dw_st~0)|))) (.cse7 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (<= 2 ~q_write_ev~0))) (.cse4 (not (= 1 ~c_dr_i~0))) (.cse5 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_dw_st~0)|)) .cse1 .cse2 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse3 (not (<= |old(~c_dr_pc~0)| 0)) .cse4 .cse5 (not (= 0 ~p_num_write~0))) (or .cse0 .cse6 .cse7 .cse1 .cse2 .cse3 (not (= 1 ~p_num_write~0)) .cse4 .cse5) (or .cse0 .cse6 .cse7 (not (<= 1 |old(~c_dr_pc~0)|)) .cse1 .cse2 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) .cse4 .cse5))) [2020-07-20 14:59:09,179 INFO L264 CegarLoopResult]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse10 (not (= 0 |old(~c_num_read~0)|))) (.cse11 (not (<= |old(~c_dr_pc~0)| 0))) (.cse17 (= 0 ~c_num_read~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse16 (= 0 ~q_free~0)) (.cse8 (not (<= 2 |old(~p_dw_st~0)|))) (.cse1 (not (= 0 |old(~q_free~0)|))) (.cse12 (<= 1 ~p_dw_pc~0)) (.cse13 (= 0 ~p_dw_st~0)) (.cse9 (not (= 1 ~p_dw_i~0))) (.cse2 (not (<= 2 ~q_write_ev~0))) (.cse4 (<= 2 ~q_read_ev~0)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= 1 ~q_free~0)) (.cse7 (<= 2 ~p_dw_st~0)) (.cse14 (not (= 1 ~c_dr_i~0))) (.cse15 (not (<= 2 |old(~q_read_ev~0)|)))) (and (let ((.cse3 (= 1 ~c_num_read~0))) (or .cse0 .cse1 .cse2 (not (= 1 ~p_num_write~0)) (and .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 (and .cse3 .cse12 .cse4 .cse5 .cse13 .cse6) .cse14 .cse15 (and .cse16 .cse4 .cse17 (<= ~c_dr_pc~0 0) .cse7))) (or .cse0 (not (= 0 |old(~p_dw_st~0)|)) .cse2 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) (not (= 0 ~p_num_write~0)) (not (<= ~p_dw_pc~0 0)) (not (= 1 |old(~q_free~0)|)) .cse9 .cse10 .cse11 (and .cse4 .cse17 .cse5 .cse13 .cse6) .cse14 .cse15) (let ((.cse18 (= ~c_num_read~0 ~p_num_write~0))) (or .cse0 (and .cse16 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse4 (<= 1 ~c_dr_pc~0) .cse7) .cse8 .cse1 (and .cse12 .cse4 .cse5 .cse13 .cse18 .cse6) (not (<= 1 |old(~c_dr_pc~0)|)) .cse9 .cse2 (and .cse4 .cse5 .cse18 .cse6 .cse7) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) .cse14 .cse15)))) [2020-07-20 14:59:09,179 INFO L264 CegarLoopResult]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (<= 2 ~q_write_ev~0))) (.cse3 (not (= 0 |old(~c_num_read~0)|))) (.cse4 (not (<= |old(~c_dr_pc~0)| 0))) (.cse5 (not (= 1 ~c_dr_i~0))) (.cse6 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_dw_st~0)|)) .cse1 .cse2 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse3 .cse4 .cse5 .cse6 (not (= 0 ~p_num_write~0))) (or .cse0 (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 2 ~q_read_ev~0) (<= 1 ~c_dr_pc~0) (<= 2 ~p_dw_st~0)) .cse7 .cse8 (not (<= 1 |old(~c_dr_pc~0)|)) .cse1 .cse2 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0)) .cse5 .cse6))) [2020-07-20 14:59:09,179 INFO L268 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2020-07-20 14:59:09,179 INFO L268 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2020-07-20 14:59:09,179 INFO L264 CegarLoopResult]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse9 (= 0 ~q_free~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse10 (<= 2 ~q_read_ev~0)) (.cse11 (= 0 ~c_num_read~0)) (.cse12 (<= ~c_dr_pc~0 0)) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse5 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (not (<= |old(~c_dr_pc~0)| 0))) (.cse7 (not (= 1 ~c_dr_i~0))) (.cse8 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 1 ~p_num_write~0)) .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13)) (or .cse0 (and .cse9 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse10 (<= 1 ~c_dr_pc~0) .cse13) .cse1 .cse2 (not (<= 1 |old(~c_dr_pc~0)|)) .cse3 .cse4 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) .cse7 .cse8) (or .cse0 (not (= 0 |old(~p_dw_st~0)|)) .cse4 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) (not (= 0 ~p_num_write~0)) (not (<= ~p_dw_pc~0 0)) (not (= 1 |old(~q_free~0)|)) (and .cse10 .cse11 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse12 (= 1 ~q_free~0)) .cse3 .cse5 .cse6 .cse7 .cse8))) [2020-07-20 14:59:09,179 INFO L268 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2020-07-20 14:59:09,179 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (let ((.cse3 (not (= 0 |old(~c_num_read~0)|))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (<= 2 |old(~p_dw_st~0)|))) (.cse7 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (<= 2 ~q_write_ev~0))) (.cse4 (not (= 1 ~c_dr_i~0))) (.cse5 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_dw_st~0)|)) .cse1 .cse2 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse3 (not (<= |old(~c_dr_pc~0)| 0)) .cse4 .cse5 (not (= 0 ~p_num_write~0))) (or .cse0 .cse6 .cse7 .cse1 .cse2 .cse3 (not (= 1 ~p_num_write~0)) .cse4 .cse5) (or .cse0 .cse6 .cse7 (not (<= 1 |old(~c_dr_pc~0)|)) .cse1 .cse2 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) .cse4 .cse5))) [2020-07-20 14:59:09,179 INFO L268 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2020-07-20 14:59:09,180 INFO L268 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2020-07-20 14:59:09,180 INFO L264 CegarLoopResult]: At program point L169(line 169) the Hoare annotation is: (let ((.cse3 (not (= 0 |old(~c_num_read~0)|))) (.cse4 (not (<= |old(~c_dr_pc~0)| 0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (<= 2 ~q_write_ev~0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= 1 ~q_free~0)) (.cse11 (<= 2 ~p_dw_st~0)) (.cse5 (not (= 1 ~c_dr_i~0))) (.cse6 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_dw_st~0)|)) .cse1 .cse2 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse3 .cse4 .cse5 .cse6 (not (= 0 ~p_num_write~0))) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0)) (and (= 1 ~c_num_read~0) .cse9 (<= ~c_dr_pc~0 0) .cse10 .cse11) .cse5 .cse6) (or .cse0 .cse7 .cse8 (not (<= 1 |old(~c_dr_pc~0)|)) .cse1 .cse2 (and .cse9 (= ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse10 .cse11) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) .cse5 .cse6))) [2020-07-20 14:59:09,180 INFO L268 CegarLoopResult]: For program point L169-1(line 169) no Hoare annotation was computed. [2020-07-20 14:59:09,180 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2020-07-20 14:59:09,180 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2020-07-20 14:59:09,180 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 ~p_dw_st~0)) (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= 0 ~c_num_read~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-20 14:59:09,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 02:59:09 BoogieIcfgContainer [2020-07-20 14:59:09,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 14:59:09,247 INFO L168 Benchmark]: Toolchain (without parser) took 33747.16 ms. Allocated memory was 146.8 MB in the beginning and 728.8 MB in the end (delta: 582.0 MB). Free memory was 102.9 MB in the beginning and 366.0 MB in the end (delta: -263.2 MB). Peak memory consumption was 546.5 MB. Max. memory is 7.1 GB. [2020-07-20 14:59:09,247 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-20 14:59:09,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.01 ms. Allocated memory is still 146.8 MB. Free memory was 102.6 MB in the beginning and 90.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-07-20 14:59:09,248 INFO L168 Benchmark]: Boogie Preprocessor took 139.25 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 90.3 MB in the beginning and 182.1 MB in the end (delta: -91.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-20 14:59:09,249 INFO L168 Benchmark]: RCFGBuilder took 456.64 ms. Allocated memory is still 204.5 MB. Free memory was 182.1 MB in the beginning and 155.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2020-07-20 14:59:09,249 INFO L168 Benchmark]: TraceAbstraction took 32847.04 ms. Allocated memory was 204.5 MB in the beginning and 728.8 MB in the end (delta: 524.3 MB). Free memory was 154.7 MB in the beginning and 366.0 MB in the end (delta: -211.4 MB). Peak memory consumption was 540.7 MB. Max. memory is 7.1 GB. [2020-07-20 14:59:09,251 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 298.01 ms. Allocated memory is still 146.8 MB. Free memory was 102.6 MB in the beginning and 90.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.25 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 90.3 MB in the beginning and 182.1 MB in the end (delta: -91.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 456.64 ms. Allocated memory is still 204.5 MB. Free memory was 182.1 MB in the beginning and 155.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32847.04 ms. Allocated memory was 204.5 MB in the beginning and 728.8 MB in the end (delta: 524.3 MB). Free memory was 154.7 MB in the beginning and 366.0 MB in the end (delta: -211.4 MB). Peak memory consumption was 540.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: 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: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(c_num_read == \old(p_num_write)) && 2 <= c_dr_st) && p_dw_pc <= \old(p_dw_pc)) && c_num_read + 1 == p_num_write) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) || !(\old(c_num_read) + 1 == \old(p_num_write))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(q_free))) || (((((((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == p_dw_i) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 1 == q_free) && 1 == c_dr_i) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= \old(q_write_ev))) || (((((((((2 <= c_dr_st && p_dw_pc <= \old(p_dw_pc)) && 2 <= q_read_ev) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 1 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= \old(p_dw_st))) || ((((((((!(c_num_read == \old(p_num_write)) && 0 == q_free) && p_dw_pc <= \old(p_dw_pc)) && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || ((((((((1 <= \old(p_dw_pc) && 0 == q_free) && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && ((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || !(2 <= \old(q_write_ev))) || !(\old(p_dw_pc) <= 0)) || ((((((0 == q_free && 2 <= q_read_ev) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || ((((((((2 <= c_dr_st && 2 <= q_read_ev) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == \old(q_free))) || ((((((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(2 <= \old(q_write_ev))) || 1 == c_num_read) || !(1 == \old(p_num_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || (((((((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == p_dw_i) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 1 == q_free) && 1 == c_dr_i) && 2 <= p_dw_st) && 2 <= q_write_ev)) || ((((((((1 <= \old(p_dw_pc) && 0 == q_free) && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || 1 == p_num_write) || !(2 <= \old(q_write_ev))) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || (((((((((2 <= c_dr_st && p_dw_pc <= \old(p_dw_pc)) && 2 <= q_read_ev) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 1 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(0 == \old(c_num_read))) || 0 == c_num_read) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(q_free))) || (((((((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == p_dw_i) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 1 == q_free) && 1 == c_dr_i) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= \old(q_write_ev))) || (((((((0 == q_free && p_dw_pc <= \old(p_dw_pc)) && 2 <= q_read_ev) && 0 == c_num_read) && c_dr_pc <= 0) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || ((((((((1 <= \old(p_dw_pc) && 0 == q_free) && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || (((((((((1 == c_num_read && 2 <= c_dr_st) && p_dw_pc <= \old(p_dw_pc)) && 2 <= q_read_ev) && c_last_read == p_last_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 1 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((((!(p_dw_pc <= 0) || !(p_last_write == q_buf_0)) || !(1 == \old(q_free))) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) || !(0 == p_num_write)) && (((((((((!(p_last_write == q_buf_0) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 <= c_dr_pc) && 2 <= p_dw_st)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 <= \old(c_dr_pc))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(p_num_write == \old(c_num_read) + 1)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev)))) && (((((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(1 == p_num_write)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= c_dr_st && p_dw_pc <= \old(p_dw_pc)) && c_num_read == p_num_write) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= q_write_ev) || !(c_num_read == \old(p_num_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 <= c_dr_pc)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || ((((0 == q_free && p_dw_pc <= \old(p_dw_pc)) && c_num_read + 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= \old(q_write_ev))) || !(1 == c_dr_i)) || !(2 <= q_read_ev)) && ((((((((((((!(c_dr_pc <= 0) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_num_write))) || !(2 <= \old(q_write_ev))) || !(\old(p_dw_pc) <= 0)) || !(2 <= q_read_ev)) || !(0 == c_num_read)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || ((((0 == q_free && p_dw_pc <= \old(p_dw_pc)) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(c_last_read == \old(p_last_write))) || (((((p_dw_pc <= \old(p_dw_pc) && c_last_read == p_last_write) && 0 == p_num_write) && p_last_write == q_buf_0) && 1 == q_free) && 2 <= q_write_ev)) || !(1 == c_dr_i)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((((((!(p_last_write == q_buf_0) || !(0 == \old(q_free))) || !(2 <= q_write_ev)) || !(1 == p_num_write)) || ((((1 == c_num_read && 2 <= q_read_ev) && c_last_read == p_last_write) && 1 == q_free) && 2 <= p_dw_st)) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || (((((1 == c_num_read && 1 <= p_dw_pc) && 2 <= q_read_ev) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) || ((((0 == q_free && 2 <= q_read_ev) && 0 == c_num_read) && c_dr_pc <= 0) && 2 <= p_dw_st)) && ((((((((((((!(p_last_write == q_buf_0) || !(0 == \old(p_dw_st))) || !(2 <= q_write_ev)) || !(p_last_write == \old(c_last_read))) || !(0 == p_num_write)) || !(p_dw_pc <= 0)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || ((((2 <= q_read_ev && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev)))) && (((((((((((!(p_last_write == q_buf_0) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 <= c_dr_pc) && 2 <= p_dw_st)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || (((((1 <= p_dw_pc && 2 <= q_read_ev) && c_last_read == p_last_write) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 == q_free)) || !(1 <= \old(c_dr_pc))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || ((((2 <= q_read_ev && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 == q_free) && 2 <= p_dw_st)) || !(p_num_write == \old(c_num_read) + 1)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || 0 == __retres1) || !(1 == p_dw_i)) || !(1 == p_num_write)) || !(0 == q_free)) || !(1 == c_dr_i)) || !(2 <= q_read_ev)) && ((((((((!(p_last_write == q_buf_0) || !(1 <= c_dr_pc)) || 0 == __retres1) || !(1 == p_dw_i)) || !(c_num_read + 1 == p_num_write)) || !(0 == q_free)) || !(2 <= c_dr_st)) || !(1 == c_dr_i)) || !(2 <= q_read_ev))) && ((((((((((!(p_last_write == q_buf_0) || 1 <= p_dw_pc) || !(1 <= c_dr_pc)) || 0 == __retres1) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(c_num_read == p_num_write)) || !(1 == q_free)) || !(2 <= p_dw_st)) || !(1 == c_dr_i)) || !(c_last_read == p_last_write))) && ((((((((((!(p_last_write == q_buf_0) || 1 <= p_dw_pc) || 0 == __retres1) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(1 == q_free)) || !(1 == p_num_write)) || !(2 <= p_dw_st)) || !(1 == c_dr_i)) || !(1 == c_num_read)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || (((((((((p_dw_pc <= \old(p_dw_pc) && 2 <= q_read_ev) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc <= 0) && 0 == p_num_write) && p_last_write == q_buf_0) && 1 == q_free) && 2 <= q_write_ev)) || !(0 == \old(p_num_write))) || !(2 <= \old(q_write_ev))) || !(\old(p_dw_pc) <= 0)) || ((((((0 == q_free && 2 <= q_read_ev) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || ((((((((2 <= c_dr_st && 2 <= q_read_ev) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == \old(q_free))) || ((((((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(c_num_read == \old(p_num_write)) && 2 <= c_dr_st) && p_dw_pc <= \old(p_dw_pc)) && c_num_read + 1 == p_num_write) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) || !(\old(c_num_read) + 1 == \old(p_num_write))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(2 <= \old(q_write_ev))) || 1 == c_num_read) || !(1 == \old(p_num_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || (((((((((2 <= c_dr_st && p_dw_pc <= \old(p_dw_pc)) && 2 <= q_read_ev) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 1 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((((((((((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == p_dw_i) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 1 == c_dr_i) && 2 <= p_dw_st) && 2 <= q_write_ev) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(q_free))) || ((((((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == p_dw_i) && c_last_read == p_last_write) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || (((((((((1 <= \old(p_dw_pc) && 0 == q_free) && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= \old(q_write_ev))) || (((((((0 == q_free && p_dw_pc <= \old(p_dw_pc)) && 2 <= q_read_ev) && 0 == c_num_read) && c_dr_pc <= 0) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || (((((((((1 == c_num_read && 2 <= c_dr_st) && p_dw_pc <= \old(p_dw_pc)) && 2 <= q_read_ev) && c_last_read == p_last_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 1 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev)))) && ((((((((((((((((((((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == p_dw_i) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 1 == c_dr_i) && 2 <= p_dw_st) && 2 <= q_write_ev) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(q_free))) || ((((((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == p_dw_i) && c_last_read == p_last_write) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || (((((((((1 <= \old(p_dw_pc) && 0 == q_free) && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= \old(q_write_ev))) || (((((((((2 <= c_dr_st && p_dw_pc <= \old(p_dw_pc)) && 2 <= q_read_ev) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 1 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= \old(p_dw_st))) || ((((((((!(c_num_read == \old(p_num_write)) && 0 == q_free) && p_dw_pc <= \old(p_dw_pc)) && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && ((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || ((((((((2 <= c_dr_st && 2 <= q_read_ev) && c_last_read == p_last_write) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(0 == \old(p_num_write))) || !(2 <= \old(q_write_ev))) || !(\old(p_dw_pc) <= 0)) || ((((((((2 <= c_dr_st && 2 <= q_read_ev) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || ((((((0 == q_free && 2 <= q_read_ev) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || (((((((((p_dw_pc <= \old(p_dw_pc) && 2 <= q_read_ev) && c_last_read == p_last_write) && 0 == c_num_read) && 0 == p_dw_st) && c_dr_pc <= 0) && 0 == p_num_write) && p_last_write == q_buf_0) && 1 == q_free) && 2 <= q_write_ev)) || !(1 == \old(q_free))) || ((((((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((((((((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == p_dw_i) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 1 == c_dr_i) && 2 <= p_dw_st) && 2 <= q_write_ev) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(q_free))) || ((((((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == p_dw_i) && c_last_read == p_last_write) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || (((((((((1 <= \old(p_dw_pc) && 0 == q_free) && c_num_read + 1 == p_num_write) && 2 <= q_read_ev) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 2 <= p_dw_st) && 2 <= q_write_ev)) || 1 == p_num_write) || !(2 <= \old(q_write_ev))) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(0 == \old(c_num_read))) || 0 == c_num_read) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((((((((!(c_num_read == \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 <= c_dr_pc)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || !(2 <= \old(q_write_ev))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(1 == c_dr_i)) || !(2 <= q_read_ev)) && (((((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || ((((0 == q_free && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= \old(q_write_ev))) || !(\old(p_dw_pc) <= 0)) || !(1 == c_dr_i)) || !(2 <= q_read_ev)) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((((((((!(p_last_write == q_buf_0) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(1 <= p_dw_pc)) || 0 == __retres1) || !(1 == q_free)) || !(1 == p_num_write)) || !(1 == c_dr_i)) || !(1 == c_num_read)) || !(c_last_read == p_last_write)) && (((((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || !(1 == p_num_write)) || !(0 == q_free)) || 0 == __retres1) || !(1 == c_dr_i)) || !(2 <= q_read_ev))) && (((((((((!(p_last_write == q_buf_0) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(1 == q_free)) || !(1 == p_num_write)) || 0 == __retres1) || !(2 <= p_dw_st)) || !(1 == c_dr_i)) || !(1 == c_num_read)) || !(c_last_read == p_last_write))) && (((((((((!(p_last_write == q_buf_0) || !(1 <= c_dr_pc)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(c_num_read == p_num_write)) || !(1 == q_free)) || 0 == __retres1) || !(2 <= p_dw_st)) || !(1 == c_dr_i)) || !(c_last_read == p_last_write))) && ((((((((((!(p_last_write == q_buf_0) || !(0 == p_dw_st)) || !(1 <= c_dr_pc)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(c_num_read == p_num_write)) || !(1 <= p_dw_pc)) || !(1 == q_free)) || 0 == __retres1) || !(1 == c_dr_i)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(0 == \old(c_num_read))) || ((((((1 == c_num_read && 2 <= c_dr_st) && 2 <= q_read_ev) && c_last_read == p_last_write) && 1 <= c_dr_pc) && 1 == q_free) && 2 <= p_dw_st)) || !(1 == p_num_write)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) || (((((((1 == c_num_read && 2 <= c_dr_st) && 1 <= p_dw_pc) && 2 <= q_read_ev) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free)) && ((((((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 <= \old(c_dr_pc))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (((((((2 <= c_dr_st && 1 <= p_dw_pc) && 2 <= q_read_ev) && c_last_read == p_last_write) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free)) || !(p_num_write == \old(c_num_read) + 1)) || ((((((2 <= c_dr_st && 2 <= q_read_ev) && c_last_read == p_last_write) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && 2 <= p_dw_st)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev)))) && ((((((((((((((((((2 <= c_dr_st && 2 <= q_read_ev) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(2 <= q_write_ev)) || !(p_last_write == \old(c_last_read))) || !(0 == p_num_write)) || !(p_dw_pc <= 0)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(1 == c_dr_i)) || !(2 <= \old(q_read_ev))) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: ((((((((((((!(c_dr_pc <= 0) || !(p_last_write == q_buf_0)) || !(2 <= q_write_ev)) || !(0 == p_num_write)) || !(2 <= q_read_ev)) || !(p_dw_pc <= 0)) || !(0 == c_num_read)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || 1 <= __retres1) || !(1 == q_free)) || !(1 == c_dr_i)) || !(c_last_read == p_last_write)) && (((((((((((!(p_last_write == q_buf_0) || !(0 == p_dw_st)) || !(1 <= c_dr_pc)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(c_num_read == p_num_write)) || 1 <= __retres1) || !(1 == q_free)) || !(2 <= c_dr_st)) || !(1 == c_dr_i)) || !(2 <= q_read_ev)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((!(c_num_read == \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 <= c_dr_pc)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || ((((2 <= c_dr_st && p_dw_pc <= \old(p_dw_pc)) && c_num_read == p_num_write) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= \old(q_write_ev))) || !(1 == c_dr_i)) || !(2 <= q_read_ev)) && (((((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || (((p_dw_pc <= \old(p_dw_pc) && 0 == p_num_write) && p_last_write == q_buf_0) && 2 <= q_write_ev)) || !(2 <= \old(q_write_ev))) || !(\old(p_dw_pc) <= 0)) || !(1 == c_dr_i)) || !(2 <= q_read_ev)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.7s, OverallIterations: 18, TraceHistogramMax: 4, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2928 SDtfs, 2588 SDslu, 3184 SDs, 0 SdLazy, 2090 SolverSat, 528 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1959 GetRequests, 1899 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4912occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 1368 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 7328 PreInvPairs, 7688 NumberOfFragments, 7656 HoareAnnotationTreeSize, 7328 FomulaSimplifications, 20266 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 45 FomulaSimplificationsInter, 16756 FormulaSimplificationTreeSizeReductionInter, 15.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1758 NumberOfCodeBlocks, 998 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1934 ConstructedInterpolants, 0 QuantifiedInterpolants, 339168 SizeOfPredicates, 35 NumberOfNonLiveVariables, 7253 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 499/543 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...