/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 DAGSIZE --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 22:57:38,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 22:57:38,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 22:57:38,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 22:57:38,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 22:57:38,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 22:57:38,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 22:57:38,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 22:57:38,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 22:57:38,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 22:57:38,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 22:57:38,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 22:57:38,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 22:57:38,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 22:57:38,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 22:57:38,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 22:57:38,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 22:57:38,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 22:57:38,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 22:57:38,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 22:57:38,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 22:57:38,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 22:57:38,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 22:57:38,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 22:57:38,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 22:57:38,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 22:57:38,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 22:57:38,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 22:57:38,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 22:57:38,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 22:57:38,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 22:57:38,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 22:57:38,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 22:57:38,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 22:57:38,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 22:57:38,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 22:57:38,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 22:57:38,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 22:57:38,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 22:57:38,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 22:57:38,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 22:57:38,121 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 22:57:38,147 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 22:57:38,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 22:57:38,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 22:57:38,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 22:57:38,149 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 22:57:38,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 22:57:38,151 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 22:57:38,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 22:57:38,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 22:57:38,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 22:57:38,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 22:57:38,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 22:57:38,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 22:57:38,152 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 22:57:38,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 22:57:38,153 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 22:57:38,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 22:57:38,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 22:57:38,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 22:57:38,154 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 22:57:38,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 22:57:38,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 22:57:38,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 22:57:38,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 22:57:38,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 22:57:38,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 22:57:38,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:38,155 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 22:57:38,155 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 22:57:38,155 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 -> DAGSIZE 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 22:57:38,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 22:57:38,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 22:57:38,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 22:57:38,452 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 22:57:38,453 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 22:57:38,453 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 22:57:38,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777969c8b/adc227d07a9d4a5b8d63fcd681410615/FLAGb2c5594fe [2020-07-20 22:57:38,967 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 22:57:38,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-20 22:57:38,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777969c8b/adc227d07a9d4a5b8d63fcd681410615/FLAGb2c5594fe [2020-07-20 22:57:39,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777969c8b/adc227d07a9d4a5b8d63fcd681410615 [2020-07-20 22:57:39,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 22:57:39,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 22:57:39,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 22:57:39,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 22:57:39,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 22:57:39,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:57:39" (1/1) ... [2020-07-20 22:57:39,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd8fd09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:57:39, skipping insertion in model container [2020-07-20 22:57:39,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:57:39" (1/1) ... [2020-07-20 22:57:39,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 22:57:39,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 22:57:39,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 22:57:39,555 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 22:57:39,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 22:57:39,714 INFO L208 MainTranslator]: Completed translation [2020-07-20 22:57:39,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:57:39 WrapperNode [2020-07-20 22:57:39,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 22:57:39,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 22:57:39,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 22:57:39,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 22:57:39,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:57:39" (1/1) ... [2020-07-20 22:57:39,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:57:39" (1/1) ... [2020-07-20 22:57:39,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:57:39" (1/1) ... [2020-07-20 22:57:39,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:57:39" (1/1) ... [2020-07-20 22:57:39,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:57:39" (1/1) ... [2020-07-20 22:57:39,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:57:39" (1/1) ... [2020-07-20 22:57:39,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:57:39" (1/1) ... [2020-07-20 22:57:39,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 22:57:39,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 22:57:39,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 22:57:39,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 22:57:39,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:57:39" (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 22:57:39,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 22:57:39,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 22:57:39,823 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 22:57:39,823 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-07-20 22:57:39,823 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-07-20 22:57:39,823 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-07-20 22:57:39,823 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-07-20 22:57:39,823 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-07-20 22:57:39,824 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 22:57:39,824 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 22:57:39,824 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 22:57:39,824 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 22:57:39,824 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 22:57:39,824 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 22:57:39,825 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 22:57:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 22:57:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 22:57:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 22:57:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-07-20 22:57:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-07-20 22:57:39,826 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-07-20 22:57:39,826 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-07-20 22:57:39,826 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-07-20 22:57:39,826 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 22:57:39,826 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 22:57:39,826 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 22:57:39,826 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 22:57:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 22:57:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 22:57:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 22:57:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 22:57:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 22:57:40,216 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 22:57:40,217 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 22:57:40,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:57:40 BoogieIcfgContainer [2020-07-20 22:57:40,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 22:57:40,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 22:57:40,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 22:57:40,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 22:57:40,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:57:39" (1/3) ... [2020-07-20 22:57:40,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3033b115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:57:40, skipping insertion in model container [2020-07-20 22:57:40,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:57:39" (2/3) ... [2020-07-20 22:57:40,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3033b115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:57:40, skipping insertion in model container [2020-07-20 22:57:40,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:57:40" (3/3) ... [2020-07-20 22:57:40,232 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-07-20 22:57:40,247 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 22:57:40,261 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 22:57:40,275 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 22:57:40,302 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 22:57:40,302 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 22:57:40,302 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 22:57:40,302 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 22:57:40,302 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 22:57:40,302 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 22:57:40,302 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 22:57:40,303 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 22:57:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2020-07-20 22:57:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 22:57:40,336 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:40,337 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 22:57:40,338 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:40,343 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2020-07-20 22:57:40,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:40,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1874960312] [2020-07-20 22:57:40,351 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 22:57:40,560 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 22:57:40,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:40,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 22:57:40,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:40,637 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 22:57:40,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:57:40,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1874960312] [2020-07-20 22:57:40,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:57:40,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:57:40,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857613416] [2020-07-20 22:57:40,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:57:40,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:40,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:57:40,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:57:40,665 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2020-07-20 22:57:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:40,764 INFO L93 Difference]: Finished difference Result 279 states and 395 transitions. [2020-07-20 22:57:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:57:40,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-20 22:57:40,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:40,783 INFO L225 Difference]: With dead ends: 279 [2020-07-20 22:57:40,784 INFO L226 Difference]: Without dead ends: 175 [2020-07-20 22:57:40,789 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 22:57:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-07-20 22:57:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2020-07-20 22:57:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-07-20 22:57:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2020-07-20 22:57:40,863 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 65 [2020-07-20 22:57:40,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:40,864 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2020-07-20 22:57:40,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:57:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2020-07-20 22:57:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 22:57:40,870 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:40,870 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 22:57:41,084 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:41,084 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:41,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:41,086 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2020-07-20 22:57:41,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:41,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1031244340] [2020-07-20 22:57:41,088 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 22:57:41,183 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:57:41,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:41,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 22:57:41,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:41,232 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 22:57:41,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:57:41,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1031244340] [2020-07-20 22:57:41,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:57:41,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:57:41,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616589951] [2020-07-20 22:57:41,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:57:41,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:41,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:57:41,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:57:41,237 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 3 states. [2020-07-20 22:57:41,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:41,310 INFO L93 Difference]: Finished difference Result 465 states and 642 transitions. [2020-07-20 22:57:41,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:57:41,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-20 22:57:41,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:41,318 INFO L225 Difference]: With dead ends: 465 [2020-07-20 22:57:41,318 INFO L226 Difference]: Without dead ends: 314 [2020-07-20 22:57:41,322 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 22:57:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-07-20 22:57:41,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2020-07-20 22:57:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-07-20 22:57:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 412 transitions. [2020-07-20 22:57:41,368 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 412 transitions. Word has length 66 [2020-07-20 22:57:41,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:41,369 INFO L479 AbstractCegarLoop]: Abstraction has 310 states and 412 transitions. [2020-07-20 22:57:41,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:57:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 412 transitions. [2020-07-20 22:57:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 22:57:41,374 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:41,374 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 22:57:41,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:41,591 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:41,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:41,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1988256317, now seen corresponding path program 1 times [2020-07-20 22:57:41,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:41,593 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1823084237] [2020-07-20 22:57:41,594 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 22:57:41,672 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:57:41,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:41,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 22:57:41,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:41,732 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 22:57:41,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:57:41,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1823084237] [2020-07-20 22:57:41,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:57:41,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 22:57:41,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263079506] [2020-07-20 22:57:41,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 22:57:41,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:41,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 22:57:41,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 22:57:41,737 INFO L87 Difference]: Start difference. First operand 310 states and 412 transitions. Second operand 6 states. [2020-07-20 22:57:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:41,818 INFO L93 Difference]: Finished difference Result 614 states and 853 transitions. [2020-07-20 22:57:41,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 22:57:41,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-07-20 22:57:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:41,824 INFO L225 Difference]: With dead ends: 614 [2020-07-20 22:57:41,824 INFO L226 Difference]: Without dead ends: 324 [2020-07-20 22:57:41,827 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 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 22:57:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-07-20 22:57:41,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 320. [2020-07-20 22:57:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-07-20 22:57:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 420 transitions. [2020-07-20 22:57:41,869 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 420 transitions. Word has length 66 [2020-07-20 22:57:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:41,870 INFO L479 AbstractCegarLoop]: Abstraction has 320 states and 420 transitions. [2020-07-20 22:57:41,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 22:57:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 420 transitions. [2020-07-20 22:57:41,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 22:57:41,874 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:41,875 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 22:57:42,085 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:42,086 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:42,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:42,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2033659546, now seen corresponding path program 1 times [2020-07-20 22:57:42,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:42,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1147391927] [2020-07-20 22:57:42,088 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 22:57:42,182 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 22:57:42,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:42,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 22:57:42,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:42,218 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 22:57:42,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:57:42,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1147391927] [2020-07-20 22:57:42,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:57:42,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:57:42,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557402820] [2020-07-20 22:57:42,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:57:42,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:42,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:57:42,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:57:42,221 INFO L87 Difference]: Start difference. First operand 320 states and 420 transitions. Second operand 3 states. [2020-07-20 22:57:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:42,249 INFO L93 Difference]: Finished difference Result 620 states and 817 transitions. [2020-07-20 22:57:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:57:42,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-20 22:57:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:42,253 INFO L225 Difference]: With dead ends: 620 [2020-07-20 22:57:42,253 INFO L226 Difference]: Without dead ends: 317 [2020-07-20 22:57:42,255 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 22:57:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-07-20 22:57:42,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2020-07-20 22:57:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-07-20 22:57:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 415 transitions. [2020-07-20 22:57:42,288 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 415 transitions. Word has length 66 [2020-07-20 22:57:42,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:42,289 INFO L479 AbstractCegarLoop]: Abstraction has 317 states and 415 transitions. [2020-07-20 22:57:42,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:57:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 415 transitions. [2020-07-20 22:57:42,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 22:57:42,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:42,293 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 22:57:42,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:42,507 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:42,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash -213248955, now seen corresponding path program 1 times [2020-07-20 22:57:42,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:42,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1288410372] [2020-07-20 22:57:42,508 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 22:57:42,609 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:57:42,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:42,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 22:57:42,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:42,665 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 22:57:42,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:57:42,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1288410372] [2020-07-20 22:57:42,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:57:42,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:57:42,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247644751] [2020-07-20 22:57:42,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:57:42,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:42,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:57:42,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:57:42,674 INFO L87 Difference]: Start difference. First operand 317 states and 415 transitions. Second operand 3 states. [2020-07-20 22:57:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:42,737 INFO L93 Difference]: Finished difference Result 826 states and 1113 transitions. [2020-07-20 22:57:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:57:42,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-20 22:57:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:42,742 INFO L225 Difference]: With dead ends: 826 [2020-07-20 22:57:42,742 INFO L226 Difference]: Without dead ends: 526 [2020-07-20 22:57:42,744 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 22:57:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-07-20 22:57:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 522. [2020-07-20 22:57:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2020-07-20 22:57:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 671 transitions. [2020-07-20 22:57:42,781 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 671 transitions. Word has length 66 [2020-07-20 22:57:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:42,782 INFO L479 AbstractCegarLoop]: Abstraction has 522 states and 671 transitions. [2020-07-20 22:57:42,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:57:42,782 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 671 transitions. [2020-07-20 22:57:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 22:57:42,784 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:42,785 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 22:57:42,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:42,998 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:42,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:42,999 INFO L82 PathProgramCache]: Analyzing trace with hash -326635612, now seen corresponding path program 1 times [2020-07-20 22:57:43,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:43,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [299870604] [2020-07-20 22:57:43,001 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 22:57:43,068 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:57:43,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:43,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 22:57:43,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:43,110 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 22:57:43,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:57:43,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [299870604] [2020-07-20 22:57:43,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:57:43,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 22:57:43,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072646830] [2020-07-20 22:57:43,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 22:57:43,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:43,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 22:57:43,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 22:57:43,112 INFO L87 Difference]: Start difference. First operand 522 states and 671 transitions. Second operand 6 states. [2020-07-20 22:57:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:43,171 INFO L93 Difference]: Finished difference Result 1013 states and 1341 transitions. [2020-07-20 22:57:43,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 22:57:43,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-07-20 22:57:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:43,175 INFO L225 Difference]: With dead ends: 1013 [2020-07-20 22:57:43,176 INFO L226 Difference]: Without dead ends: 544 [2020-07-20 22:57:43,178 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 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 22:57:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-07-20 22:57:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2020-07-20 22:57:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-07-20 22:57:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 689 transitions. [2020-07-20 22:57:43,211 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 689 transitions. Word has length 66 [2020-07-20 22:57:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:43,212 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 689 transitions. [2020-07-20 22:57:43,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 22:57:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 689 transitions. [2020-07-20 22:57:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 22:57:43,214 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:43,214 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 22:57:43,428 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:43,429 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:43,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:43,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1347703966, now seen corresponding path program 1 times [2020-07-20 22:57:43,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:43,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1189153581] [2020-07-20 22:57:43,430 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 22:57:43,523 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:57:43,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:43,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-20 22:57:43,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:43,565 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 22:57:43,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:57:43,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1189153581] [2020-07-20 22:57:43,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:57:43,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-20 22:57:43,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991635495] [2020-07-20 22:57:43,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 22:57:43,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:43,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 22:57:43,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 22:57:43,568 INFO L87 Difference]: Start difference. First operand 544 states and 689 transitions. Second operand 4 states. [2020-07-20 22:57:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:43,688 INFO L93 Difference]: Finished difference Result 870 states and 1131 transitions. [2020-07-20 22:57:43,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:57:43,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-07-20 22:57:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:43,694 INFO L225 Difference]: With dead ends: 870 [2020-07-20 22:57:43,695 INFO L226 Difference]: Without dead ends: 867 [2020-07-20 22:57:43,696 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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 22:57:43,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2020-07-20 22:57:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 860. [2020-07-20 22:57:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2020-07-20 22:57:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1117 transitions. [2020-07-20 22:57:43,767 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1117 transitions. Word has length 66 [2020-07-20 22:57:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:43,767 INFO L479 AbstractCegarLoop]: Abstraction has 860 states and 1117 transitions. [2020-07-20 22:57:43,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 22:57:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1117 transitions. [2020-07-20 22:57:43,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-20 22:57:43,770 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:43,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 22:57:43,984 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:43,985 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:43,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:43,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1170545691, now seen corresponding path program 1 times [2020-07-20 22:57:43,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:43,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2030422854] [2020-07-20 22:57:43,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 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 22:57:44,076 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 22:57:44,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:44,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-20 22:57:44,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:44,104 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 22:57:44,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:57:44,105 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2030422854] [2020-07-20 22:57:44,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:57:44,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:57:44,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50701575] [2020-07-20 22:57:44,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:57:44,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:44,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:57:44,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:57:44,107 INFO L87 Difference]: Start difference. First operand 860 states and 1117 transitions. Second operand 3 states. [2020-07-20 22:57:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:44,166 INFO L93 Difference]: Finished difference Result 1549 states and 2036 transitions. [2020-07-20 22:57:44,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:57:44,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-20 22:57:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:44,171 INFO L225 Difference]: With dead ends: 1549 [2020-07-20 22:57:44,172 INFO L226 Difference]: Without dead ends: 742 [2020-07-20 22:57:44,176 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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 22:57:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2020-07-20 22:57:44,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 639. [2020-07-20 22:57:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2020-07-20 22:57:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 819 transitions. [2020-07-20 22:57:44,213 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 819 transitions. Word has length 67 [2020-07-20 22:57:44,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:44,214 INFO L479 AbstractCegarLoop]: Abstraction has 639 states and 819 transitions. [2020-07-20 22:57:44,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:57:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 819 transitions. [2020-07-20 22:57:44,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-20 22:57:44,216 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:44,216 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 22:57:44,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:44,430 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:44,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:44,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1338277302, now seen corresponding path program 1 times [2020-07-20 22:57:44,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:44,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [531012770] [2020-07-20 22:57:44,431 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 22:57:44,496 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 22:57:44,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:44,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 22:57:44,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:44,520 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 22:57:44,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:57:44,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [531012770] [2020-07-20 22:57:44,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:57:44,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:57:44,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891091342] [2020-07-20 22:57:44,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:57:44,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:44,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:57:44,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:57:44,523 INFO L87 Difference]: Start difference. First operand 639 states and 819 transitions. Second operand 3 states. [2020-07-20 22:57:44,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:44,586 INFO L93 Difference]: Finished difference Result 1498 states and 2003 transitions. [2020-07-20 22:57:44,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:57:44,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-07-20 22:57:44,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:44,594 INFO L225 Difference]: With dead ends: 1498 [2020-07-20 22:57:44,594 INFO L226 Difference]: Without dead ends: 722 [2020-07-20 22:57:44,598 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 85 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 22:57:44,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2020-07-20 22:57:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2020-07-20 22:57:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2020-07-20 22:57:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 936 transitions. [2020-07-20 22:57:44,667 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 936 transitions. Word has length 87 [2020-07-20 22:57:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:44,669 INFO L479 AbstractCegarLoop]: Abstraction has 722 states and 936 transitions. [2020-07-20 22:57:44,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:57:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 936 transitions. [2020-07-20 22:57:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-07-20 22:57:44,676 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:44,676 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] [2020-07-20 22:57:44,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:44,892 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:44,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:44,893 INFO L82 PathProgramCache]: Analyzing trace with hash -744707149, now seen corresponding path program 1 times [2020-07-20 22:57:44,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:44,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [194866404] [2020-07-20 22:57:44,894 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 22:57:44,961 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:57:44,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:44,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-20 22:57:44,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-20 22:57:44,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 22:57:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-20 22:57:45,080 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [194866404] [2020-07-20 22:57:45,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 22:57:45,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2020-07-20 22:57:45,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569381420] [2020-07-20 22:57:45,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 22:57:45,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:45,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 22:57:45,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 22:57:45,082 INFO L87 Difference]: Start difference. First operand 722 states and 936 transitions. Second operand 4 states. [2020-07-20 22:57:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:45,213 INFO L93 Difference]: Finished difference Result 794 states and 1059 transitions. [2020-07-20 22:57:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-20 22:57:45,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2020-07-20 22:57:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:45,219 INFO L225 Difference]: With dead ends: 794 [2020-07-20 22:57:45,219 INFO L226 Difference]: Without dead ends: 791 [2020-07-20 22:57:45,220 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 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 22:57:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2020-07-20 22:57:45,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 723. [2020-07-20 22:57:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2020-07-20 22:57:45,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 936 transitions. [2020-07-20 22:57:45,263 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 936 transitions. Word has length 118 [2020-07-20 22:57:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:45,264 INFO L479 AbstractCegarLoop]: Abstraction has 723 states and 936 transitions. [2020-07-20 22:57:45,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 22:57:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 936 transitions. [2020-07-20 22:57:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-07-20 22:57:45,267 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:45,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:57:45,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:45,482 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:45,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:45,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1791004806, now seen corresponding path program 1 times [2020-07-20 22:57:45,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:45,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [173670026] [2020-07-20 22:57:45,483 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 22:57:45,574 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:57:45,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:45,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 22:57:45,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-20 22:57:45,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:57:45,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [173670026] [2020-07-20 22:57:45,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:57:45,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 22:57:45,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397023581] [2020-07-20 22:57:45,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 22:57:45,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:45,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 22:57:45,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 22:57:45,653 INFO L87 Difference]: Start difference. First operand 723 states and 936 transitions. Second operand 6 states. [2020-07-20 22:57:45,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:45,725 INFO L93 Difference]: Finished difference Result 1445 states and 1917 transitions. [2020-07-20 22:57:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 22:57:45,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2020-07-20 22:57:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:45,730 INFO L225 Difference]: With dead ends: 1445 [2020-07-20 22:57:45,731 INFO L226 Difference]: Without dead ends: 739 [2020-07-20 22:57:45,735 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 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 22:57:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2020-07-20 22:57:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 685. [2020-07-20 22:57:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2020-07-20 22:57:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 849 transitions. [2020-07-20 22:57:45,780 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 849 transitions. Word has length 149 [2020-07-20 22:57:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:45,781 INFO L479 AbstractCegarLoop]: Abstraction has 685 states and 849 transitions. [2020-07-20 22:57:45,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 22:57:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 849 transitions. [2020-07-20 22:57:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-07-20 22:57:45,784 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:45,784 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 22:57:45,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:45,999 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:45,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:45,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1611389462, now seen corresponding path program 1 times [2020-07-20 22:57:45,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:46,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1400147998] [2020-07-20 22:57:46,000 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 22:57:46,111 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 22:57:46,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:46,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 22:57:46,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:46,141 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 22:57:46,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:57:46,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1400147998] [2020-07-20 22:57:46,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:57:46,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:57:46,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324116667] [2020-07-20 22:57:46,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:57:46,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:46,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:57:46,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:57:46,144 INFO L87 Difference]: Start difference. First operand 685 states and 849 transitions. Second operand 3 states. [2020-07-20 22:57:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:46,187 INFO L93 Difference]: Finished difference Result 1192 states and 1503 transitions. [2020-07-20 22:57:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:57:46,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2020-07-20 22:57:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:46,192 INFO L225 Difference]: With dead ends: 1192 [2020-07-20 22:57:46,192 INFO L226 Difference]: Without dead ends: 698 [2020-07-20 22:57:46,195 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 22:57:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2020-07-20 22:57:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 685. [2020-07-20 22:57:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2020-07-20 22:57:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 847 transitions. [2020-07-20 22:57:46,233 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 847 transitions. Word has length 119 [2020-07-20 22:57:46,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:46,234 INFO L479 AbstractCegarLoop]: Abstraction has 685 states and 847 transitions. [2020-07-20 22:57:46,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:57:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 847 transitions. [2020-07-20 22:57:46,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-20 22:57:46,237 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:46,237 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 22:57:46,450 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:46,451 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:46,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:46,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2020-07-20 22:57:46,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:46,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [554984011] [2020-07-20 22:57:46,452 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 22:57:46,580 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 22:57:46,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:46,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-20 22:57:46,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:46,667 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 22:57:46,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 22:57:46,840 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 22:57:46,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [554984011] [2020-07-20 22:57:46,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 22:57:46,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2020-07-20 22:57:46,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214537965] [2020-07-20 22:57:46,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 22:57:46,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:46,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 22:57:46,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-20 22:57:46,843 INFO L87 Difference]: Start difference. First operand 685 states and 847 transitions. Second operand 12 states. [2020-07-20 22:57:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:48,700 INFO L93 Difference]: Finished difference Result 2886 states and 4416 transitions. [2020-07-20 22:57:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-20 22:57:48,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2020-07-20 22:57:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:48,723 INFO L225 Difference]: With dead ends: 2886 [2020-07-20 22:57:48,723 INFO L226 Difference]: Without dead ends: 2883 [2020-07-20 22:57:48,725 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 22:57:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-07-20 22:57:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2710. [2020-07-20 22:57:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2020-07-20 22:57:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 4034 transitions. [2020-07-20 22:57:48,939 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 4034 transitions. Word has length 99 [2020-07-20 22:57:48,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:48,940 INFO L479 AbstractCegarLoop]: Abstraction has 2710 states and 4034 transitions. [2020-07-20 22:57:48,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 22:57:48,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 4034 transitions. [2020-07-20 22:57:48,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-20 22:57:48,949 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:48,950 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 22:57:49,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:49,164 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:49,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:49,164 INFO L82 PathProgramCache]: Analyzing trace with hash 83738947, now seen corresponding path program 2 times [2020-07-20 22:57:49,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:49,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [504000684] [2020-07-20 22:57:49,165 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 22:57:49,230 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 22:57:49,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:49,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 22:57:49,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:49,253 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 22:57:49,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:57:49,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [504000684] [2020-07-20 22:57:49,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:57:49,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:57:49,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290999681] [2020-07-20 22:57:49,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:57:49,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:49,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:57:49,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:57:49,256 INFO L87 Difference]: Start difference. First operand 2710 states and 4034 transitions. Second operand 3 states. [2020-07-20 22:57:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:49,368 INFO L93 Difference]: Finished difference Result 4184 states and 6522 transitions. [2020-07-20 22:57:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:57:49,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-07-20 22:57:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:49,384 INFO L225 Difference]: With dead ends: 4184 [2020-07-20 22:57:49,384 INFO L226 Difference]: Without dead ends: 2107 [2020-07-20 22:57:49,409 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 22:57:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2020-07-20 22:57:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 2051. [2020-07-20 22:57:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2020-07-20 22:57:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2851 transitions. [2020-07-20 22:57:49,577 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2851 transitions. Word has length 125 [2020-07-20 22:57:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:49,578 INFO L479 AbstractCegarLoop]: Abstraction has 2051 states and 2851 transitions. [2020-07-20 22:57:49,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:57:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2851 transitions. [2020-07-20 22:57:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-20 22:57:49,583 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:57:49,583 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 22:57:49,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:49,798 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:57:49,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:57:49,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1218823465, now seen corresponding path program 1 times [2020-07-20 22:57:49,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:57:49,800 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [407150930] [2020-07-20 22:57:49,800 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 22:57:49,860 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 22:57:49,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:57:49,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 22:57:49,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:57:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-20 22:57:49,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:57:49,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [407150930] [2020-07-20 22:57:49,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:57:49,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:57:49,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298003784] [2020-07-20 22:57:49,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:57:49,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:57:49,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:57:49,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:57:49,899 INFO L87 Difference]: Start difference. First operand 2051 states and 2851 transitions. Second operand 3 states. [2020-07-20 22:57:49,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:57:49,961 INFO L93 Difference]: Finished difference Result 2633 states and 3659 transitions. [2020-07-20 22:57:49,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:57:49,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-07-20 22:57:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:57:49,965 INFO L225 Difference]: With dead ends: 2633 [2020-07-20 22:57:49,965 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 22:57:49,979 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 22:57:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 22:57:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 22:57:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 22:57:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 22:57:49,980 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2020-07-20 22:57:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:57:49,981 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 22:57:49,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:57:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 22:57:49,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 22:57:50,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:57:50,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 22:57:52,093 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2020-07-20 22:57:52,219 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2020-07-20 22:57:52,423 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2020-07-20 22:57:52,588 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-20 22:57:53,000 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2020-07-20 22:57:53,554 WARN L193 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2020-07-20 22:57:53,819 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2020-07-20 22:57:54,120 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2020-07-20 22:57:54,320 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 37 [2020-07-20 22:57:54,522 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2020-07-20 22:57:55,738 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 124 DAG size of output: 99 [2020-07-20 22:57:55,855 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-07-20 22:57:56,135 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-07-20 22:57:56,538 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2020-07-20 22:57:56,736 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-07-20 22:57:57,612 WARN L193 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2020-07-20 22:57:58,293 WARN L193 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 104 [2020-07-20 22:57:58,722 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2020-07-20 22:57:59,191 WARN L193 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2020-07-20 22:57:59,304 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-07-20 22:57:59,752 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2020-07-20 22:58:00,813 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 124 DAG size of output: 99 [2020-07-20 22:58:01,042 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2020-07-20 22:58:01,396 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2020-07-20 22:58:01,718 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2020-07-20 22:58:02,278 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2020-07-20 22:58:02,531 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2020-07-20 22:58:02,812 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2020-07-20 22:58:02,817 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2020-07-20 22:58:02,817 INFO L268 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2020-07-20 22:58:02,817 INFO L268 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2020-07-20 22:58:02,817 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2020-07-20 22:58:02,818 INFO L264 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse0 (not (= 0 ~p_dw_st~0))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse3 (not (= 1 ~q_free~0)))) (and (or (not (= ~p_last_write~0 ~q_buf_0~0)) .cse0 (not (<= 1 ~c_dr_pc~0)) .cse1 .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) .cse3 (not (<= 2 ~c_dr_st~0))) (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) (not (<= ~c_dr_pc~0 0)) .cse0 (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_last_write~0)) .cse1 .cse2 .cse3 (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))))) [2020-07-20 22:58:02,818 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2020-07-20 22:58:02,818 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2020-07-20 22:58:02,818 INFO L268 CegarLoopResult]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2020-07-20 22:58:02,818 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) (not (<= ~c_dr_pc~0 0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_last_write~0)) (not (= 1 ~p_dw_i~0)) (= 0 ~p_dw_st~0) (not (= 1 ~q_free~0)) (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-20 22:58:02,818 INFO L268 CegarLoopResult]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2020-07-20 22:58:02,818 INFO L264 CegarLoopResult]: At program point L354-1(line 354) the Hoare annotation is: (or (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and (<= ~p_dw_pc~0 0) (= 1 ~p_dw_i~0) (= 0 ~p_last_write~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)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_last_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 22:58:02,819 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~p_last_write~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 (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_last_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 22:58:02,819 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2020-07-20 22:58:02,819 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2020-07-20 22:58:02,819 INFO L268 CegarLoopResult]: For program point L355(line 355) no Hoare annotation was computed. [2020-07-20 22:58:02,819 INFO L264 CegarLoopResult]: At program point L354(line 354) the Hoare annotation is: (or (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~p_last_write~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 (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_last_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 22:58:02,819 INFO L264 CegarLoopResult]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse2 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse6 (not (= 1 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse3 (= 0 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~p_dw_st~0))) (and (or .cse0 (<= 2 ~c_dr_st~0) .cse1 .cse2) (or (and .cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse4 .cse5) (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (<= 1 ~c_dr_pc~0)) .cse6 .cse1 .cse2) (or (not (= 0 ~c_num_read~0)) .cse0 .cse6 (not (= 0 |old(~p_num_write~0)|)) .cse1 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_last_write~0)|)) (and .cse3 (= 1 ~p_num_write~0) .cse4 .cse5) (not (<= |old(~p_dw_pc~0)| 0))))) [2020-07-20 22:58:02,820 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse8 (<= ~p_dw_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse12 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse5 (not (= 0 |old(~q_buf_0~0)|))) (.cse6 (not (= 0 |old(~p_last_write~0)|))) (.cse7 (not (<= |old(~p_dw_pc~0)| 0))) (.cse4 (not (= 1 |old(~q_free~0)|))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 |old(~c_dr_st~0)|))) (.cse1 (<= 2 ~c_dr_st~0)) (.cse9 (= 1 ~q_free~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse2 (not (= 0 ~c_last_read~0)) .cse5 .cse3 .cse6 .cse7 (and .cse8 (= 0 ~q_buf_0~0) (= 0 ~p_last_write~0) .cse9)) (or .cse10 .cse0 .cse4 .cse11 .cse2 .cse12 (and .cse8 .cse13 (= 0 ~p_num_write~0) .cse9 .cse14) .cse5 .cse6 .cse7) (or .cse10 (and .cse8 .cse13) .cse4 .cse11 .cse2 .cse12 .cse5 .cse6 .cse3 .cse7) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (<= 1 ~c_dr_pc~0)) .cse4 .cse2 .cse3 (and .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse9 .cse14)))) [2020-07-20 22:58:02,820 INFO L264 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse9 (not (= 0 ~c_num_read~0))) (.cse1 (<= ~p_dw_pc~0 0)) (.cse12 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse4 (not (= 0 |old(~q_buf_0~0)|))) (.cse6 (not (= 0 |old(~p_last_write~0)|))) (.cse7 (not (<= |old(~p_dw_pc~0)| 0))) (.cse8 (<= 2 ~c_dr_st~0)) (.cse10 (= 0 ~q_free~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse5 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= 0 ~c_last_read~0)) .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse3 .cse5) (or .cse9 .cse0 .cse2 (and .cse10 .cse1 (= 1 ~p_num_write~0) .cse11) .cse12 .cse3 .cse13 .cse4 .cse6 .cse7) (or .cse9 .cse1 .cse2 .cse12 .cse3 .cse13 .cse4 .cse6 .cse5 .cse7) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (and .cse8 .cse10 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse11) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (<= 1 ~c_dr_pc~0)) .cse2 .cse3 .cse5))) [2020-07-20 22:58:02,820 INFO L268 CegarLoopResult]: For program point L124-1(line 124) no Hoare annotation was computed. [2020-07-20 22:58:02,820 INFO L268 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2020-07-20 22:58:02,820 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2020-07-20 22:58:02,820 INFO L264 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse8 (<= 2 ~c_dr_st~0)) (.cse5 (not (<= 2 |old(~c_dr_st~0)|))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse12 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse4 (not (= 0 |old(~q_buf_0~0)|))) (.cse1 (<= ~p_dw_pc~0 0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not (= 0 |old(~p_last_write~0)|))) (.cse7 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= 0 ~c_last_read~0)) .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse3 .cse5) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (<= 1 ~c_dr_pc~0)) .cse2 .cse3 .cse5 (and .cse8 (= ~c_num_read~0 ~p_num_write~0) .cse9)) (or .cse10 .cse1 .cse2 .cse11 .cse3 .cse12 .cse4 .cse6 .cse5 .cse7) (or .cse10 .cse0 .cse2 .cse11 .cse3 .cse12 .cse4 (and .cse1 (= 0 ~p_num_write~0) .cse9) .cse6 .cse7))) [2020-07-20 22:58:02,821 INFO L264 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse8 (<= 2 ~c_dr_st~0)) (.cse5 (not (<= 2 |old(~c_dr_st~0)|))) (.cse12 (not (= 0 ~c_num_read~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse9 (= 0 ~q_free~0)) (.cse13 (not (= 0 |old(~p_num_write~0)|))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse14 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse1 (<= ~p_dw_pc~0 0)) (.cse11 (= 1 ~q_free~0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (not (= 0 |old(~q_buf_0~0)|))) (.cse6 (not (= 0 |old(~p_last_write~0)|))) (.cse7 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= 0 ~c_last_read~0)) .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse3 .cse5) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (<= 1 ~c_dr_pc~0)) .cse2 .cse3 (and .cse9 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse10) .cse5 (and .cse8 (= ~c_num_read~0 ~p_num_write~0) .cse11 .cse10)) (or .cse12 .cse1 .cse2 .cse13 .cse3 .cse14 .cse4 .cse6 .cse5 .cse7) (or .cse12 .cse0 .cse2 (and .cse9 .cse1 (= 1 ~p_num_write~0) .cse10) .cse13 .cse3 .cse14 (and .cse1 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0) .cse11 .cse10) .cse4 .cse6 .cse7))) [2020-07-20 22:58:02,821 INFO L268 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2020-07-20 22:58:02,821 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-07-20 22:58:02,821 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-20 22:58:02,821 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-07-20 22:58:02,821 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-07-20 22:58:02,821 INFO L264 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 1 ~q_free~0))) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (<= 2 ~c_dr_st~0)) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse3 (not (= 0 ~q_free~0))) (or .cse1 (not (<= 1 ~c_dr_pc~0)) .cse4 .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse7) (or .cse1 .cse4 .cse2 .cse5 (not (= 1 ~p_num_write~0)) .cse6 (not (= 1 ~c_num_read~0)) .cse7) (or .cse0 (not (<= ~c_dr_pc~0 0)) .cse2 .cse3))) [2020-07-20 22:58:02,822 INFO L268 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2020-07-20 22:58:02,822 INFO L268 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-07-20 22:58:02,822 INFO L268 CegarLoopResult]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2020-07-20 22:58:02,822 INFO L268 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2020-07-20 22:58:02,822 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2020-07-20 22:58:02,822 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 1 ~q_free~0))) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (<= 2 ~c_dr_st~0)) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse3 (not (= 0 ~q_free~0))) (or .cse1 (not (<= 1 ~c_dr_pc~0)) .cse4 .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse7) (or .cse1 .cse4 .cse2 .cse5 (not (= 1 ~p_num_write~0)) .cse6 (not (= 1 ~c_num_read~0)) .cse7) (or .cse0 (not (<= ~c_dr_pc~0 0)) .cse2 .cse3))) [2020-07-20 22:58:02,823 INFO L264 CegarLoopResult]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse3 (= 0 ~p_dw_st~0)) (.cse11 (= 0 immediate_notify_threads_~tmp~0))) (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (and (<= 2 ~p_dw_st~0) .cse11)) (.cse5 (not (= 1 ~q_free~0))) (.cse6 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse7 (not (= 1 ~p_num_write~0))) (.cse9 (not (<= ~c_dr_pc~0 0))) (.cse8 (not (<= ~p_dw_pc~0 0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse12 (and (<= 2 ~c_dr_st~0) (or .cse3 .cse11))) (.cse14 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse13 (not (<= 2 |old(~c_dr_st~0)|))) (.cse10 (not (= 0 ~q_free~0)))) (and (or .cse0 (not (<= 1 ~c_dr_pc~0)) .cse1 .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (not (= 1 ~c_num_read~0)) .cse6) (or .cse8 (not (= 0 ~c_num_read~0)) .cse9 .cse0 .cse2 .cse7 .cse10 .cse11) (or .cse9 .cse2 .cse12 .cse13) (or .cse8 .cse9 .cse2 .cse13 .cse11) (or .cse8 .cse0 .cse2 .cse14 .cse13 .cse10 .cse11) (or .cse0 .cse2 .cse12 .cse14 .cse13 .cse10)))) [2020-07-20 22:58:02,823 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-07-20 22:58:02,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 22:58:02,823 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (= ~c_num_read~0 ~p_num_write~0)) [2020-07-20 22:58:02,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 22:58:02,823 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse7 (not (= 0 |old(~q_buf_0~0)|))) (.cse9 (not (= 0 |old(~p_last_write~0)|))) (.cse2 (<= ~p_dw_pc~0 0)) (.cse3 (= 0 ~p_last_write~0)) (.cse10 (not (<= |old(~p_dw_pc~0)| 0))) (.cse4 (= 1 ~q_free~0)) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse12 (= 0 ~c_num_read~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse21 (<= 2 ~c_dr_st~0)) (.cse0 (not (= 0 |old(~p_dw_st~0)|))) (.cse6 (not (<= |old(~c_dr_pc~0)| 0))) (.cse13 (= 0 ~p_dw_st~0)) (.cse8 (not (<= 2 |old(~c_dr_st~0)|))) (.cse17 (not (= 1 |old(~p_num_write~0)|))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse20 (= 1 ~p_num_write~0)) (.cse16 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse18 (not (<= 2 |old(~p_dw_st~0)|))) (.cse24 (not (= 0 |old(~q_free~0)|))) (.cse25 (= 0 ~q_free~0)) (.cse22 (<= 1 ~c_dr_pc~0)) (.cse15 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (<= 2 ~p_dw_st~0)) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse19 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse26 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 (and .cse2 (= 0 ~c_last_read~0) (= 0 ~q_buf_0~0) .cse3 .cse4) .cse5 (not (= 0 |old(~c_last_read~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 (not (= 0 |old(~p_num_write~0)|)) .cse5 .cse11 .cse6 .cse7 .cse9 (and .cse2 .cse3 .cse12 (= ~c_last_read~0 ~p_last_write~0) .cse13 .cse14 (= 0 ~p_num_write~0) .cse15 .cse4) .cse10 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse16 .cse17 .cse1 .cse18 .cse19 .cse5 (not (= 1 |old(~c_num_read~0)|)) .cse8 .cse20) (or (and .cse21 (= ~c_num_read~0 ~p_num_write~0) .cse22 .cse4 .cse15 .cse23) .cse16 .cse1 .cse18 .cse19 .cse5 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse8) (or .cse5 (and .cse21 .cse14) .cse6 .cse8) (or .cse16 .cse17 .cse18 .cse24 .cse5 .cse11 .cse6 (and .cse25 .cse12 .cse14 .cse15 .cse23)) (or .cse21 .cse16 .cse18 .cse24 .cse5 .cse8 .cse26) (or .cse0 .cse5 .cse6 .cse13 .cse8) (or .cse16 .cse17 .cse18 .cse24 .cse5 .cse11 .cse20) (or .cse16 .cse18 .cse24 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse25 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse22 .cse15 .cse23) .cse5 .cse19 .cse26))) [2020-07-20 22:58:02,824 INFO L264 CegarLoopResult]: At program point L254(line 254) the Hoare annotation is: (let ((.cse14 (<= 2 ~c_dr_st~0)) (.cse15 (= 1 ~p_dw_i~0)) (.cse13 (= 1 ~q_free~0)) (.cse12 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse6 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse8 (not (= 1 |old(~q_free~0)|))) (.cse4 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse7 (and .cse14 .cse15 (= ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse13 .cse12)) (.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)|))) (.cse9 (not (= 0 |old(~c_num_read~0)|))) (.cse3 (not .cse15)) (.cse11 (<= ~c_dr_pc~0 0)) (.cse10 (not (<= |old(~c_dr_pc~0)| 0))) (.cse5 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 (not (= 0 |old(~p_dw_st~0)|)) .cse8 (not (= 0 |old(~p_num_write~0)|)) .cse3 .cse9 .cse10 (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_last_write~0)|)) (and (<= ~p_dw_pc~0 0) (= 0 ~p_last_write~0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse11 (<= 1 eval_~tmp___1~0) (= 0 ~p_num_write~0) .cse12 .cse13) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (or .cse0 .cse8 .cse1 .cse4 .cse3 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse5) (or .cse7 .cse0 (not (= 1 |old(~p_num_write~0)|)) .cse1 .cse2 .cse3 .cse9) (or .cse3 (and .cse14 .cse11) .cse10 .cse5)))) [2020-07-20 22:58:02,824 INFO L268 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-07-20 22:58:02,824 INFO L268 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2020-07-20 22:58:02,824 INFO L268 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-07-20 22:58:02,824 INFO L264 CegarLoopResult]: At program point L238(line 238) the Hoare annotation is: (let ((.cse18 (= 0 ~p_dw_st~0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse26 (= 0 ~q_free~0)) (.cse17 (= 0 ~c_num_read~0)) (.cse16 (= 1 ~p_num_write~0)) (.cse12 (<= 2 ~c_dr_st~0)) (.cse23 (= 1 ~p_dw_i~0)) (.cse24 (= ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= 1 ~c_dr_pc~0)) (.cse21 (= 1 ~q_free~0)) (.cse20 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (<= 2 ~p_dw_st~0))) (let ((.cse11 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse10 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse0 (and .cse12 .cse23 .cse24 .cse25 .cse21 .cse20 .cse27)) (.cse7 (and .cse26 .cse17 .cse16 .cse20 .cse27)) (.cse9 (and .cse26 .cse13 .cse25 .cse20 .cse27)) (.cse15 (not (= 1 |old(~q_free~0)|))) (.cse4 (and .cse12 .cse23 .cse18 .cse24 .cse25 .cse21 .cse20)) (.cse19 (<= ~c_dr_pc~0 0)) (.cse22 (not (<= |old(~c_dr_pc~0)| 0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~p_num_write~0)|))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse6 (not .cse23)) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse4 .cse5 .cse3 .cse6 .cse10 .cse9 .cse11) (or .cse1 .cse5 .cse3 .cse6 .cse10 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse12 .cse13) .cse14 .cse11) (or .cse1 .cse2 .cse15 .cse5 .cse10 .cse6 (not (= 1 |old(~c_num_read~0)|)) .cse14 .cse16) (or .cse0 .cse1 .cse15 .cse5 .cse10 .cse6 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse14) (or .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse7 (and (<= ~p_dw_pc~0 0) (= 0 ~p_last_write~0) (= ~c_last_read~0 ~p_last_write~0) .cse17 .cse18 .cse19 (= 0 ~p_num_write~0) .cse20 .cse21) (not (= 0 |old(~p_last_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) .cse9 .cse15 .cse4 .cse6 .cse8 .cse22 (not (= 0 |old(~q_buf_0~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse6 (and .cse12 .cse19) .cse22 .cse14) (or .cse1 .cse2 .cse5 .cse3 .cse6 .cse8 .cse14 .cse16)))) [2020-07-20 22:58:02,825 INFO L264 CegarLoopResult]: At program point L269(line 269) the Hoare annotation is: (let ((.cse11 (= 0 ~c_num_read~0)) (.cse14 (= 0 ~q_free~0)) (.cse13 (= 1 ~p_dw_i~0)) (.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (<= 2 ~p_dw_st~0))) (let ((.cse0 (and .cse14 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse13 (<= 1 ~c_dr_pc~0) .cse12 .cse15)) (.cse5 (and .cse14 .cse11 (= 1 ~p_num_write~0) .cse12 .cse15)) (.cse8 (not (= 1 |old(~q_free~0)|))) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (not (<= |old(~c_dr_pc~0)| 0))) (.cse1 (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 .cse13)) (.cse9 (not (<= 2 |old(~c_dr_st~0)|))) (.cse7 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 (not (= 1 |old(~p_num_write~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 1 |old(~c_dr_pc~0)|)) .cse7) (or .cse1 .cse8 .cse2 .cse4 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse9) (or .cse4 .cse10 .cse9) (or .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse5 (not (= 0 |old(~p_last_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) .cse8 .cse4 .cse6 (and (<= ~p_dw_pc~0 0) (= 0 ~p_last_write~0) .cse11 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (<= 1 eval_~tmp___1~0) (= 0 ~p_num_write~0) .cse12 (= 1 ~q_free~0)) .cse10 (not (= 0 |old(~q_buf_0~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse1 .cse2 .cse3 .cse4 .cse9 .cse7)))) [2020-07-20 22:58:02,825 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2020-07-20 22:58:02,825 INFO L268 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2020-07-20 22:58:02,825 INFO L268 CegarLoopResult]: For program point L247(lines 237 277) no Hoare annotation was computed. [2020-07-20 22:58:02,825 INFO L264 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse11 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse10 (<= 2 ~c_dr_st~0)) (.cse21 (= 1 ~p_dw_i~0)) (.cse18 (<= 1 ~c_dr_pc~0)) (.cse17 (= 0 ~q_free~0)) (.cse15 (= 1 ~p_num_write~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (<= 2 ~p_dw_st~0))) (let ((.cse7 (and .cse17 (= 0 ~c_num_read~0) .cse15 .cse19 .cse20)) (.cse14 (not (= 1 |old(~q_free~0)|))) (.cse16 (not (<= |old(~c_dr_pc~0)| 0))) (.cse2 (not (= 1 |old(~p_num_write~0)|))) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse12 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (and .cse10 .cse21 (= ~c_num_read~0 ~p_num_write~0) .cse18 (= 1 ~q_free~0) .cse19 .cse20)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= 0 |old(~q_free~0)|))) (.cse5 (not .cse21)) (.cse9 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse8 (and .cse17 .cse11 .cse18 .cse19 .cse20)) (.cse13 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse3 .cse4 .cse5 .cse9 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse10 .cse11) .cse12 .cse13) (or .cse1 .cse2 .cse14 .cse3 .cse9 .cse5 (not (= 1 |old(~c_num_read~0)|)) .cse12 .cse15) (or .cse0 .cse1 .cse14 .cse3 .cse9 .cse5 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse12) (or .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse7 (not (= 0 |old(~p_last_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) .cse8 .cse14 .cse5 .cse6 .cse16 (not (= 0 |old(~q_buf_0~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse5 (and .cse10 (<= ~c_dr_pc~0 0)) .cse16 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse15) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse8 .cse13)))) [2020-07-20 22:58:02,825 INFO L268 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2020-07-20 22:58:02,825 INFO L264 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse18 (= 0 ~p_dw_st~0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse26 (= 0 ~q_free~0)) (.cse17 (= 0 ~c_num_read~0)) (.cse16 (= 1 ~p_num_write~0)) (.cse12 (<= 2 ~c_dr_st~0)) (.cse23 (= 1 ~p_dw_i~0)) (.cse24 (= ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= 1 ~c_dr_pc~0)) (.cse21 (= 1 ~q_free~0)) (.cse20 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (<= 2 ~p_dw_st~0))) (let ((.cse11 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse10 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse0 (and .cse12 .cse23 .cse24 .cse25 .cse21 .cse20 .cse27)) (.cse7 (and .cse26 .cse17 .cse16 .cse20 .cse27)) (.cse9 (and .cse26 .cse13 .cse25 .cse20 .cse27)) (.cse15 (not (= 1 |old(~q_free~0)|))) (.cse4 (and .cse12 .cse23 .cse18 .cse24 .cse25 .cse21 .cse20)) (.cse19 (<= ~c_dr_pc~0 0)) (.cse22 (not (<= |old(~c_dr_pc~0)| 0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~p_num_write~0)|))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse6 (not .cse23)) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse4 .cse5 .cse3 .cse6 .cse10 .cse9 .cse11) (or .cse1 .cse5 .cse3 .cse6 .cse10 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse12 .cse13) .cse14 .cse11) (or .cse1 .cse2 .cse15 .cse5 .cse10 .cse6 (not (= 1 |old(~c_num_read~0)|)) .cse14 .cse16) (or .cse0 .cse1 .cse15 .cse5 .cse10 .cse6 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse14) (or .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse7 (and (<= ~p_dw_pc~0 0) (= 0 ~p_last_write~0) (= ~c_last_read~0 ~p_last_write~0) .cse17 .cse18 .cse19 (= 0 ~p_num_write~0) .cse20 .cse21) (not (= 0 |old(~p_last_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) .cse9 .cse15 .cse4 .cse6 .cse8 .cse22 (not (= 0 |old(~q_buf_0~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse6 (and .cse12 .cse19) .cse22 .cse14) (or .cse1 .cse2 .cse5 .cse3 .cse6 .cse8 .cse14 .cse16)))) [2020-07-20 22:58:02,825 INFO L268 CegarLoopResult]: For program point L290-1(line 290) no Hoare annotation was computed. [2020-07-20 22:58:02,826 INFO L271 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: true [2020-07-20 22:58:02,826 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2020-07-20 22:58:02,826 INFO L268 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2020-07-20 22:58:02,826 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2020-07-20 22:58:02,826 INFO L271 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: true [2020-07-20 22:58:02,826 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2020-07-20 22:58:02,826 INFO L264 CegarLoopResult]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse3 (not (= 1 ~q_free~0))) (.cse6 (not (= 1 ~c_num_read~0))) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (= 1 ~p_num_write~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse5 (= 0 is_do_read_c_triggered_~__retres1~1))) (and (or .cse0 .cse1 (not (= 0 ~p_dw_st~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~p_dw_st~0)) .cse6 .cse7) (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) .cse0 .cse1 .cse2 .cse4 .cse5 (not (= 0 ~q_free~0))) (or .cse0 .cse2 .cse5 (not (<= 2 ~c_dr_st~0))))) [2020-07-20 22:58:02,826 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2020-07-20 22:58:02,826 INFO L268 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2020-07-20 22:58:02,826 INFO L268 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2020-07-20 22:58:02,827 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2020-07-20 22:58:02,827 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2020-07-20 22:58:02,827 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2020-07-20 22:58:02,827 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_last_write~0)|)) (and (<= ~p_dw_pc~0 0) (= 0 ~p_last_write~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)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 22:58:02,827 INFO L268 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2020-07-20 22:58:02,827 INFO L268 CegarLoopResult]: For program point L318(line 318) no Hoare annotation was computed. [2020-07-20 22:58:02,827 INFO L264 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse1 (= 0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse6 (<= 2 ~c_dr_st~0)) (.cse5 (= 1 ~q_free~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~p_dw_st~0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 (= 1 ~p_num_write~0) .cse2 .cse3) (not (= 0 |old(~p_last_write~0)|)) (and (<= ~p_dw_pc~0 0) (= 0 ~p_last_write~0) .cse1 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse4 (= 0 ~p_num_write~0) .cse2 .cse5) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse2 .cse3) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and .cse6 .cse4) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse6 (= ~c_num_read~0 ~p_num_write~0) .cse5 .cse2 .cse3) (not (= 0 |old(~q_buf_0~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-20 22:58:02,828 INFO L264 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse0 (= 0 ~q_free~0)) (.cse3 (<= 2 ~c_dr_st~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 (= 0 ~c_num_read~0) (= 1 ~p_num_write~0) .cse1 .cse2) (not (= 0 |old(~p_last_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse1 .cse2) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and .cse3 (<= ~c_dr_pc~0 0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse3 (= ~c_num_read~0 ~p_num_write~0) (= 1 ~q_free~0) .cse1 .cse2) (not (= 0 |old(~q_buf_0~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-20 22:58:02,828 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2020-07-20 22:58:02,828 INFO L268 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2020-07-20 22:58:02,828 INFO L264 CegarLoopResult]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse1 (= 0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse6 (<= 2 ~c_dr_st~0)) (.cse5 (= 1 ~q_free~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~p_dw_st~0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 (= 1 ~p_num_write~0) .cse2 .cse3) (not (= 0 |old(~p_last_write~0)|)) (and (<= ~p_dw_pc~0 0) (= 0 ~p_last_write~0) .cse1 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse4 (= 0 ~p_num_write~0) .cse2 .cse5) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse2 .cse3) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and .cse6 .cse4) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse6 (= ~c_num_read~0 ~p_num_write~0) .cse5 .cse2 .cse3) (not (= 0 |old(~q_buf_0~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-20 22:58:02,828 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (or (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_last_write~0)|)) (and (<= ~p_dw_pc~0 0) (= 0 ~p_last_write~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)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 22:58:02,828 INFO L271 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2020-07-20 22:58:02,829 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 22:58:02,829 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 ~p_last_write~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 22:58:02,829 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 22:58:02,829 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 22:58:02,829 INFO L268 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2020-07-20 22:58:02,829 INFO L268 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2020-07-20 22:58:02,829 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2020-07-20 22:58:02,829 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2020-07-20 22:58:02,829 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2020-07-20 22:58:02,829 INFO L264 CegarLoopResult]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse1 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (<= ~p_dw_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse6 (not (= 0 ~q_free~0))) (.cse4 (not (<= 2 ~c_dr_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= 0 ~c_num_read~0)) .cse1 .cse5 .cse2 .cse3 (not (= 1 ~p_num_write~0)) .cse6) (or .cse0 .cse5 .cse2 .cse3 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse6 .cse4))) [2020-07-20 22:58:02,829 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2020-07-20 22:58:02,829 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2020-07-20 22:58:02,830 INFO L264 CegarLoopResult]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (<= 2 ~p_dw_st~0)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 0 ~p_dw_st~0)) (.cse8 (<= 1 ~c_dr_pc~0)) (.cse9 (= 1 ~q_free~0))) (and (let ((.cse6 (= ~c_num_read~0 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse4 .cse6 .cse8 .cse9 .cse10) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))))) (or (not (<= ~p_dw_pc~0 0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_last_write~0)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse11 (not (<= |old(~c_dr_pc~0)| 0)) (and .cse4 (= 0 ~c_num_read~0) .cse5 .cse7 .cse8 .cse9) (not (= 0 ~p_num_write~0))) (let ((.cse12 (= 1 ~c_num_read~0))) (or .cse0 .cse1 .cse2 .cse3 .cse11 (and .cse12 .cse4 .cse8 .cse9 .cse10) (not (= 1 ~p_num_write~0)) (and .cse12 .cse4 .cse5 .cse7 .cse8 .cse9))))) [2020-07-20 22:58:02,830 INFO L268 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2020-07-20 22:58:02,830 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (let ((.cse1 (not (= 0 |old(~c_num_read~0)|))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= 0 |old(~q_free~0)|))) (.cse0 (not (= 1 ~p_dw_i~0)))) (and (or (not (<= ~p_dw_pc~0 0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_last_write~0)) .cse0 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse1 (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))) (or .cse2 .cse3 .cse4 .cse0 .cse1 (not (= 1 ~p_num_write~0))) (or .cse2 .cse3 .cse4 .cse0 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))))) [2020-07-20 22:58:02,830 INFO L264 CegarLoopResult]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= 0 |old(~q_free~0)|))) (.cse9 (not (= 1 ~p_dw_i~0))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= 0 ~p_dw_st~0)) (.cse8 (= 1 ~q_free~0)) (.cse0 (= 0 ~q_free~0)) (.cse10 (= 0 ~c_num_read~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse12 (not (<= |old(~c_dr_pc~0)| 0)))) (and (let ((.cse7 (= ~c_num_read~0 ~p_num_write~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse1) .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8) .cse9 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) (and .cse5 .cse7 .cse8 .cse1))) (or (not (<= ~p_dw_pc~0 0)) (not (= 0 |old(~p_dw_st~0)|)) (and .cse10 .cse5 .cse6 .cse8) (not (= 1 |old(~q_free~0)|)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_last_write~0)) .cse9 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse11 .cse12 (not (= 0 ~p_num_write~0))) (let ((.cse13 (= 1 ~c_num_read~0))) (or (and .cse13 .cse5 .cse8 .cse1) .cse2 .cse3 .cse4 .cse9 .cse11 (and .cse13 .cse5 .cse6 .cse8) (and .cse0 .cse10 (<= ~c_dr_pc~0 0) .cse1) .cse12 (not (= 1 ~p_num_write~0)))))) [2020-07-20 22:58:02,830 INFO L264 CegarLoopResult]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse0 (not (= 1 ~p_dw_i~0))) (.cse1 (not (= 0 |old(~c_num_read~0)|))) (.cse2 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or (not (<= ~p_dw_pc~0 0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_last_write~0)) .cse0 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse1 .cse2 (not (= 0 ~p_num_write~0))) (or (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) (<= 2 ~p_dw_st~0)) .cse3 .cse4 .cse5 .cse0 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or .cse3 .cse4 .cse5 .cse0 .cse1 .cse2 (not (= 1 ~p_num_write~0))))) [2020-07-20 22:58:02,830 INFO L268 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2020-07-20 22:58:02,830 INFO L268 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2020-07-20 22:58:02,831 INFO L264 CegarLoopResult]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= 0 |old(~q_free~0)|))) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse9 (not (<= |old(~c_dr_pc~0)| 0))) (.cse7 (= 0 ~c_num_read~0)) (.cse8 (<= ~c_dr_pc~0 0))) (and (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse1) .cse2 .cse3 .cse4 .cse5 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse0 .cse7 .cse8 .cse1) .cse9 (not (= 1 ~p_num_write~0))) (or (not (<= ~p_dw_pc~0 0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_last_write~0)) .cse5 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse6 .cse9 (and .cse7 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse8 (= 1 ~q_free~0)) (not (= 0 ~p_num_write~0))))) [2020-07-20 22:58:02,831 INFO L268 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2020-07-20 22:58:02,831 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (let ((.cse1 (not (= 0 |old(~c_num_read~0)|))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= 0 |old(~q_free~0)|))) (.cse0 (not (= 1 ~p_dw_i~0)))) (and (or (not (<= ~p_dw_pc~0 0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_last_write~0)) .cse0 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse1 (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))) (or .cse2 .cse3 .cse4 .cse0 .cse1 (not (= 1 ~p_num_write~0))) (or .cse2 .cse3 .cse4 .cse0 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))))) [2020-07-20 22:58:02,831 INFO L268 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2020-07-20 22:58:02,831 INFO L268 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2020-07-20 22:58:02,831 INFO L264 CegarLoopResult]: At program point L169(line 169) the Hoare annotation is: (let ((.cse4 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (not (<= |old(~c_dr_pc~0)| 0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 1 ~q_free~0)) (.cse8 (<= 2 ~p_dw_st~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 1 ~p_num_write~0)) (and (= 1 ~c_num_read~0) .cse6 (<= ~c_dr_pc~0 0) .cse7 .cse8)) (or (not (<= ~p_dw_pc~0 0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_last_write~0)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 .cse5 (not (= 0 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (and .cse6 (= ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse7 .cse8) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))))) [2020-07-20 22:58:02,831 INFO L268 CegarLoopResult]: For program point L169-1(line 169) no Hoare annotation was computed. [2020-07-20 22:58:02,831 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2020-07-20 22:58:02,831 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2020-07-20 22:58:02,831 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (not (= 0 ~p_dw_st~0)) (not (= 0 ~q_buf_0~0)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 ~p_last_write~0)) (not (= 0 |old(~c_num_read~0)|)) (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~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 22:58:02,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 10:58:02 BoogieIcfgContainer [2020-07-20 22:58:02,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 22:58:02,902 INFO L168 Benchmark]: Toolchain (without parser) took 23592.84 ms. Allocated memory was 138.4 MB in the beginning and 540.0 MB in the end (delta: 401.6 MB). Free memory was 102.5 MB in the beginning and 461.7 MB in the end (delta: -359.2 MB). Peak memory consumption was 382.9 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:02,902 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-20 22:58:02,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.20 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 102.1 MB in the beginning and 181.9 MB in the end (delta: -79.8 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:02,903 INFO L168 Benchmark]: Boogie Preprocessor took 45.85 ms. Allocated memory is still 202.9 MB. Free memory was 181.9 MB in the beginning and 179.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:02,906 INFO L168 Benchmark]: RCFGBuilder took 455.54 ms. Allocated memory is still 202.9 MB. Free memory was 179.5 MB in the beginning and 152.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:02,907 INFO L168 Benchmark]: TraceAbstraction took 22677.08 ms. Allocated memory was 202.9 MB in the beginning and 540.0 MB in the end (delta: 337.1 MB). Free memory was 152.0 MB in the beginning and 461.7 MB in the end (delta: -309.7 MB). Peak memory consumption was 368.0 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:02,912 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 404.20 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 102.1 MB in the beginning and 181.9 MB in the end (delta: -79.8 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.85 ms. Allocated memory is still 202.9 MB. Free memory was 181.9 MB in the beginning and 179.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 455.54 ms. Allocated memory is still 202.9 MB. Free memory was 179.5 MB in the beginning and 152.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22677.08 ms. Allocated memory was 202.9 MB in the beginning and 540.0 MB in the end (delta: 337.1 MB). Free memory was 152.0 MB in the beginning and 461.7 MB in the end (delta: -309.7 MB). Peak memory consumption was 368.0 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: ((((((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\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)) || !(0 == \old(c_num_read))) || ((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) && (((((((!(\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))) || ((!(c_num_read == \old(p_num_write)) && 2 <= c_dr_st) && c_num_read + 1 == p_num_write)) || !(2 <= \old(c_dr_st))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(c_dr_pc))) || !(1 == p_dw_i)) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && (((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(c_dr_pc))) || !(1 == p_dw_i)) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st)))) && ((((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || ((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(p_last_write))) || !(\old(p_dw_pc) <= 0)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(0 == \old(q_buf_0))) || !(\old(c_last_read) == \old(p_last_write)))) && (((!(1 == p_dw_i) || (2 <= c_dr_st && c_dr_pc <= 0)) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st)))) && (((((((!(\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)) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && (((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\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))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_num_read) + 1 == \old(p_num_write))) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((!(p_dw_pc <= 0) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(0 == q_buf_0)) || !(0 == p_last_write)) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(0 == p_num_write)) && (((((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && 2 <= p_dw_st) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(p_num_write == \old(c_num_read) + 1))) && ((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(1 == p_num_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((!(c_dr_pc <= 0) || p_dw_pc <= 0) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == c_last_read)) || !(0 == \old(q_buf_0))) || !(2 <= \old(c_dr_st))) || !(0 == \old(p_last_write))) || !(\old(p_dw_pc) <= 0)) && (((!(c_dr_pc <= 0) || 2 <= c_dr_st) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st)))) && (((((((!(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)) || ((0 == q_free && c_num_read + 1 == p_num_write) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || (((2 <= c_dr_st && c_num_read == p_num_write) && 1 == q_free) && p_last_write == q_buf_0))) && (((((((((!(0 == c_num_read) || p_dw_pc <= 0) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(q_buf_0))) || !(0 == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(1 == \old(q_free))) || (((0 == q_free && p_dw_pc <= 0) && 1 == p_num_write) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || ((((p_dw_pc <= 0 && c_last_read == p_last_write) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_last_write))) || !(\old(p_dw_pc) <= 0)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && 2 <= p_dw_st) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || (((c_last_read == p_last_write && 0 == p_dw_st) && c_num_read == p_num_write) && 1 == q_free)) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(p_num_write == \old(c_num_read) + 1)) || (((c_last_read == p_last_write && c_num_read == p_num_write) && 1 == q_free) && 2 <= p_dw_st)) && ((((((((((!(p_dw_pc <= 0) || !(0 == \old(p_dw_st))) || (((0 == c_num_read && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(1 == \old(q_free))) || !(0 == q_buf_0)) || !(0 == p_last_write)) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(0 == p_num_write))) && ((((((((((((1 == c_num_read && c_last_read == p_last_write) && 1 == q_free) && 2 <= p_dw_st) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || (((1 == c_num_read && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || (((0 == q_free && 0 == c_num_read) && c_dr_pc <= 0) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0)) || !(1 == p_num_write)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((!(p_dw_pc <= 0) || !(c_dr_pc <= 0)) || 0 == __retres1) || !(1 == p_dw_i)) || !(2 <= c_dr_st)) && (((((((!(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))) && ((((((!(p_dw_pc <= 0) || !(p_last_write == q_buf_0)) || 0 == __retres1) || !(1 == p_dw_i)) || !(c_num_read + 1 == p_num_write)) || !(0 == q_free)) || !(2 <= c_dr_st)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((((!(0 == \old(p_dw_st)) || !(0 == \old(p_num_write))) || ((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(p_last_write))) || ((((((((p_dw_pc <= 0 && 0 == p_last_write) && 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)) || !(\old(p_dw_pc) <= 0)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || (2 <= c_dr_st && c_dr_pc <= 0)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || ((((2 <= c_dr_st && c_num_read == p_num_write) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(q_buf_0))) || !(\old(c_last_read) == \old(p_last_write)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_num_write))) || !(0 == \old(q_free))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || ((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) && ((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_num_read) + 1 == \old(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))) || ((!(c_num_read == \old(p_num_write)) && 2 <= c_dr_st) && c_num_read + 1 == p_num_write)) || !(2 <= \old(c_dr_st))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(c_dr_pc))) || !(1 == p_dw_i)) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && (((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(c_dr_pc))) || !(1 == p_dw_i)) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st)))) && ((((((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || ((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((((((p_dw_pc <= 0 && 0 == p_last_write) && 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)) || !(0 == \old(p_last_write))) || !(\old(p_dw_pc) <= 0)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == \old(q_free))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(0 == \old(q_buf_0))) || !(\old(c_last_read) == \old(p_last_write)))) && (((!(1 == p_dw_i) || (2 <= c_dr_st && c_dr_pc <= 0)) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st)))) && (((((((!(\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)) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((!(c_dr_pc <= 0) || 2 <= c_dr_st) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) && (((((((((0 == q_free && c_num_read + 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(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 == c_num_read) || !(c_dr_pc <= 0)) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(q_buf_0))) || !(0 == \old(p_last_write))) || (((0 == q_free && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((((((((!(c_dr_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(1 == q_free)) || !(1 == p_num_write)) || 0 == __retres1) || !(1 == c_num_read)) || !(c_last_read == p_last_write)) && ((((((((!(c_dr_pc <= 0) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || !(1 == q_free)) || !(1 == p_num_write)) || 0 == __retres1) || !(2 <= p_dw_st)) || !(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 == __retres1) || !(0 == q_free))) && (((!(c_dr_pc <= 0) || !(1 == p_dw_i)) || 0 == __retres1) || !(2 <= c_dr_st)) - 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)) || !(1 <= \old(c_dr_pc))) || (((((2 <= c_dr_st && c_last_read == p_last_write) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free)) || ((((2 <= c_dr_st && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && 2 <= p_dw_st)) || !(p_num_write == \old(c_num_read) + 1)) && ((((((((((!(p_dw_pc <= 0) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(0 == q_buf_0)) || !(0 == p_last_write)) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || (((((2 <= c_dr_st && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free)) || !(0 == p_num_write))) && (((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || ((((1 == c_num_read && 2 <= c_dr_st) && 1 <= c_dr_pc) && 1 == q_free) && 2 <= p_dw_st)) || !(1 == p_num_write)) || (((((1 == c_num_read && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: (((((((!(p_last_write == q_buf_0) || !(0 == p_dw_st)) || !(1 <= c_dr_pc)) || !(1 == p_dw_i)) || 1 <= __retres1) || !(c_num_read == p_num_write)) || !(1 == q_free)) || !(2 <= c_dr_st)) && ((((((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(c_dr_pc <= 0)) || !(0 == p_dw_st)) || !(0 == q_buf_0)) || !(0 == p_last_write)) || !(1 == p_dw_i)) || 1 <= __retres1) || !(1 == q_free)) || !(0 == p_num_write)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((!(c_dr_pc <= 0) || p_dw_pc <= 0) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == c_last_read)) || !(0 == \old(q_buf_0))) || !(2 <= \old(c_dr_st))) || !(0 == \old(p_last_write))) || !(\old(p_dw_pc) <= 0)) && (((!(c_dr_pc <= 0) || 2 <= c_dr_st) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st)))) && ((((((!(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 && c_num_read == p_num_write) && p_last_write == q_buf_0))) && (((((((((!(0 == c_num_read) || p_dw_pc <= 0) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(q_buf_0))) || !(0 == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && (((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(q_buf_0))) || ((p_dw_pc <= 0 && 0 == p_num_write) && p_last_write == q_buf_0)) || !(0 == \old(p_last_write))) || !(\old(p_dw_pc) <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.8s, OverallIterations: 15, TraceHistogramMax: 4, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2428 SDtfs, 2032 SDslu, 3172 SDs, 0 SdLazy, 1765 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1588 GetRequests, 1536 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2710occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 490 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3688 PreInvPairs, 4024 NumberOfFragments, 5779 HoareAnnotationTreeSize, 3688 FomulaSimplifications, 8621 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 45 FomulaSimplificationsInter, 11586 FormulaSimplificationTreeSizeReductionInter, 10.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1367 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1567 ConstructedInterpolants, 0 QuantifiedInterpolants, 300715 SizeOfPredicates, 32 NumberOfNonLiveVariables, 4439 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 366/409 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...