/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 BIGGEST_EQUIVALENCE_CLASS --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-21 23:45:16,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 23:45:16,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 23:45:16,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 23:45:16,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 23:45:16,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 23:45:16,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 23:45:16,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 23:45:16,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 23:45:16,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 23:45:16,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 23:45:16,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 23:45:16,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 23:45:16,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 23:45:16,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 23:45:16,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 23:45:16,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 23:45:16,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 23:45:16,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 23:45:16,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 23:45:16,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 23:45:16,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 23:45:16,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 23:45:16,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 23:45:16,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 23:45:16,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 23:45:16,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 23:45:16,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 23:45:16,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 23:45:16,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 23:45:16,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 23:45:16,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 23:45:16,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 23:45:16,963 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 23:45:16,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 23:45:16,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 23:45:16,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 23:45:16,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 23:45:16,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 23:45:16,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 23:45:16,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 23:45:16,969 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-21 23:45:16,996 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 23:45:16,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 23:45:17,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 23:45:17,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 23:45:17,002 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 23:45:17,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 23:45:17,002 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 23:45:17,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 23:45:17,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 23:45:17,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 23:45:17,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 23:45:17,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 23:45:17,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 23:45:17,003 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 23:45:17,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 23:45:17,004 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 23:45:17,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 23:45:17,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 23:45:17,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 23:45:17,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 23:45:17,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 23:45:17,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 23:45:17,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 23:45:17,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 23:45:17,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 23:45:17,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 23:45:17,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:17,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 23:45:17,006 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 23:45:17,007 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 -> BIGGEST_EQUIVALENCE_CLASS 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-21 23:45:17,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 23:45:17,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 23:45:17,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 23:45:17,368 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 23:45:17,368 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 23:45:17,369 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-21 23:45:17,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c6f7dda8/b7a986c18fef452e99172307c1c32f38/FLAGf4237e79c [2020-07-21 23:45:17,911 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 23:45:17,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-21 23:45:17,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c6f7dda8/b7a986c18fef452e99172307c1c32f38/FLAGf4237e79c [2020-07-21 23:45:18,225 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c6f7dda8/b7a986c18fef452e99172307c1c32f38 [2020-07-21 23:45:18,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 23:45:18,240 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 23:45:18,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 23:45:18,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 23:45:18,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 23:45:18,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:45:18" (1/1) ... [2020-07-21 23:45:18,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408b2e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:18, skipping insertion in model container [2020-07-21 23:45:18,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:45:18" (1/1) ... [2020-07-21 23:45:18,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 23:45:18,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 23:45:18,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 23:45:18,488 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 23:45:18,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 23:45:18,542 INFO L208 MainTranslator]: Completed translation [2020-07-21 23:45:18,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:18 WrapperNode [2020-07-21 23:45:18,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 23:45:18,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 23:45:18,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 23:45:18,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 23:45:18,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:18" (1/1) ... [2020-07-21 23:45:18,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:18" (1/1) ... [2020-07-21 23:45:18,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:18" (1/1) ... [2020-07-21 23:45:18,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:18" (1/1) ... [2020-07-21 23:45:18,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:18" (1/1) ... [2020-07-21 23:45:18,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:18" (1/1) ... [2020-07-21 23:45:18,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:18" (1/1) ... [2020-07-21 23:45:18,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 23:45:18,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 23:45:18,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 23:45:18,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 23:45:18,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:18" (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-21 23:45:18,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 23:45:18,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 23:45:18,761 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-21 23:45:18,761 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-07-21 23:45:18,761 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-07-21 23:45:18,761 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-07-21 23:45:18,762 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-07-21 23:45:18,762 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-07-21 23:45:18,762 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-21 23:45:18,762 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-21 23:45:18,762 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-21 23:45:18,762 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-21 23:45:18,763 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-21 23:45:18,763 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-21 23:45:18,763 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 23:45:18,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 23:45:18,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 23:45:18,763 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-21 23:45:18,764 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-07-21 23:45:18,764 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-07-21 23:45:18,764 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-07-21 23:45:18,764 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-07-21 23:45:18,764 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-07-21 23:45:18,764 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-21 23:45:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-21 23:45:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-21 23:45:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-21 23:45:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-21 23:45:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-21 23:45:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 23:45:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 23:45:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 23:45:19,187 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 23:45:19,187 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-21 23:45:19,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:45:19 BoogieIcfgContainer [2020-07-21 23:45:19,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 23:45:19,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 23:45:19,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 23:45:19,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 23:45:19,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:45:18" (1/3) ... [2020-07-21 23:45:19,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28830ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:45:19, skipping insertion in model container [2020-07-21 23:45:19,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:18" (2/3) ... [2020-07-21 23:45:19,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28830ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:45:19, skipping insertion in model container [2020-07-21 23:45:19,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:45:19" (3/3) ... [2020-07-21 23:45:19,202 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-07-21 23:45:19,214 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 23:45:19,222 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 23:45:19,247 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 23:45:19,277 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 23:45:19,277 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 23:45:19,277 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 23:45:19,278 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 23:45:19,278 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 23:45:19,278 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 23:45:19,278 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 23:45:19,278 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 23:45:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2020-07-21 23:45:19,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 23:45:19,314 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:19,316 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-21 23:45:19,316 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:19,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:19,323 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2020-07-21 23:45:19,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:19,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [240271695] [2020-07-21 23:45:19,335 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-21 23:45:19,622 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:45:19,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:19,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 23:45:19,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:19,700 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-21 23:45:19,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:19,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [240271695] [2020-07-21 23:45:19,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:19,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:19,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829620482] [2020-07-21 23:45:19,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:19,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:19,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:19,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:19,732 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2020-07-21 23:45:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:19,848 INFO L93 Difference]: Finished difference Result 279 states and 395 transitions. [2020-07-21 23:45:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:19,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-21 23:45:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:19,868 INFO L225 Difference]: With dead ends: 279 [2020-07-21 23:45:19,869 INFO L226 Difference]: Without dead ends: 175 [2020-07-21 23:45:19,874 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-21 23:45:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-07-21 23:45:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2020-07-21 23:45:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-07-21 23:45:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2020-07-21 23:45:19,956 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 65 [2020-07-21 23:45:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:19,957 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2020-07-21 23:45:19,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2020-07-21 23:45:19,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 23:45:19,963 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:19,964 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-21 23:45:20,169 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:20,170 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:20,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:20,171 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2020-07-21 23:45:20,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:20,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2116709519] [2020-07-21 23:45:20,172 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-21 23:45:20,340 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:45:20,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:20,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 23:45:20,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:20,401 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-21 23:45:20,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:20,402 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2116709519] [2020-07-21 23:45:20,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:20,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:20,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338853479] [2020-07-21 23:45:20,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:20,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:20,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:20,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:20,406 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 3 states. [2020-07-21 23:45:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:20,470 INFO L93 Difference]: Finished difference Result 469 states and 642 transitions. [2020-07-21 23:45:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:20,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-21 23:45:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:20,478 INFO L225 Difference]: With dead ends: 469 [2020-07-21 23:45:20,478 INFO L226 Difference]: Without dead ends: 318 [2020-07-21 23:45:20,487 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-21 23:45:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-07-21 23:45:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2020-07-21 23:45:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-07-21 23:45:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 415 transitions. [2020-07-21 23:45:20,582 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 415 transitions. Word has length 66 [2020-07-21 23:45:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:20,583 INFO L479 AbstractCegarLoop]: Abstraction has 314 states and 415 transitions. [2020-07-21 23:45:20,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 415 transitions. [2020-07-21 23:45:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 23:45:20,590 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:20,590 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-21 23:45:20,798 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:20,799 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:20,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:20,800 INFO L82 PathProgramCache]: Analyzing trace with hash -822318239, now seen corresponding path program 1 times [2020-07-21 23:45:20,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:20,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [80054189] [2020-07-21 23:45:20,802 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-21 23:45:20,939 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:45:20,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:20,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-21 23:45:20,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:20,968 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-21 23:45:20,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:20,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [80054189] [2020-07-21 23:45:20,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:20,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:20,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495319362] [2020-07-21 23:45:20,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:20,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:20,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:20,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:20,971 INFO L87 Difference]: Start difference. First operand 314 states and 415 transitions. Second operand 3 states. [2020-07-21 23:45:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:21,027 INFO L93 Difference]: Finished difference Result 781 states and 1067 transitions. [2020-07-21 23:45:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:21,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-21 23:45:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:21,042 INFO L225 Difference]: With dead ends: 781 [2020-07-21 23:45:21,042 INFO L226 Difference]: Without dead ends: 487 [2020-07-21 23:45:21,049 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-21 23:45:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2020-07-21 23:45:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 426. [2020-07-21 23:45:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-07-21 23:45:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 568 transitions. [2020-07-21 23:45:21,137 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 568 transitions. Word has length 66 [2020-07-21 23:45:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:21,138 INFO L479 AbstractCegarLoop]: Abstraction has 426 states and 568 transitions. [2020-07-21 23:45:21,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 568 transitions. [2020-07-21 23:45:21,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 23:45:21,144 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:21,144 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-21 23:45:21,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:21,358 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:21,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:21,359 INFO L82 PathProgramCache]: Analyzing trace with hash 675603030, now seen corresponding path program 1 times [2020-07-21 23:45:21,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:21,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [44006972] [2020-07-21 23:45:21,361 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-21 23:45:21,470 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:45:21,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:21,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 23:45:21,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:21,508 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-21 23:45:21,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:21,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [44006972] [2020-07-21 23:45:21,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:21,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:21,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929796268] [2020-07-21 23:45:21,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:21,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:21,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:21,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:21,511 INFO L87 Difference]: Start difference. First operand 426 states and 568 transitions. Second operand 3 states. [2020-07-21 23:45:21,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:21,594 INFO L93 Difference]: Finished difference Result 1097 states and 1544 transitions. [2020-07-21 23:45:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:21,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-21 23:45:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:21,603 INFO L225 Difference]: With dead ends: 1097 [2020-07-21 23:45:21,603 INFO L226 Difference]: Without dead ends: 691 [2020-07-21 23:45:21,606 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-21 23:45:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2020-07-21 23:45:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 673. [2020-07-21 23:45:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2020-07-21 23:45:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 907 transitions. [2020-07-21 23:45:21,656 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 907 transitions. Word has length 66 [2020-07-21 23:45:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:21,656 INFO L479 AbstractCegarLoop]: Abstraction has 673 states and 907 transitions. [2020-07-21 23:45:21,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 907 transitions. [2020-07-21 23:45:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-21 23:45:21,660 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:21,660 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:45:21,873 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:21,874 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:21,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:21,874 INFO L82 PathProgramCache]: Analyzing trace with hash 373415101, now seen corresponding path program 1 times [2020-07-21 23:45:21,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:21,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [471806040] [2020-07-21 23:45:21,875 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-21 23:45:21,963 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 23:45:21,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:21,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 23:45:21,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-21 23:45:21,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:21,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [471806040] [2020-07-21 23:45:21,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:21,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:21,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361470329] [2020-07-21 23:45:21,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:21,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:22,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:22,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:22,003 INFO L87 Difference]: Start difference. First operand 673 states and 907 transitions. Second operand 3 states. [2020-07-21 23:45:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:22,055 INFO L93 Difference]: Finished difference Result 1228 states and 1645 transitions. [2020-07-21 23:45:22,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:22,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-07-21 23:45:22,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:22,064 INFO L225 Difference]: With dead ends: 1228 [2020-07-21 23:45:22,064 INFO L226 Difference]: Without dead ends: 572 [2020-07-21 23:45:22,069 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-07-21 23:45:22,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2020-07-21 23:45:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2020-07-21 23:45:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 756 transitions. [2020-07-21 23:45:22,127 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 756 transitions. Word has length 86 [2020-07-21 23:45:22,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:22,128 INFO L479 AbstractCegarLoop]: Abstraction has 572 states and 756 transitions. [2020-07-21 23:45:22,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 756 transitions. [2020-07-21 23:45:22,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-21 23:45:22,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:22,134 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:45:22,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:22,348 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:22,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:22,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1515944043, now seen corresponding path program 1 times [2020-07-21 23:45:22,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:22,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [4738227] [2020-07-21 23:45:22,349 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-21 23:45:22,457 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:45:22,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:22,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 23:45:22,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:22,478 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-21 23:45:22,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:22,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [4738227] [2020-07-21 23:45:22,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:22,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:22,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702269563] [2020-07-21 23:45:22,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:22,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:22,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:22,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:22,481 INFO L87 Difference]: Start difference. First operand 572 states and 756 transitions. Second operand 3 states. [2020-07-21 23:45:22,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:22,553 INFO L93 Difference]: Finished difference Result 1349 states and 1892 transitions. [2020-07-21 23:45:22,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:22,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-07-21 23:45:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:22,561 INFO L225 Difference]: With dead ends: 1349 [2020-07-21 23:45:22,561 INFO L226 Difference]: Without dead ends: 794 [2020-07-21 23:45:22,565 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:22,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2020-07-21 23:45:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2020-07-21 23:45:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-07-21 23:45:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1072 transitions. [2020-07-21 23:45:22,636 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1072 transitions. Word has length 86 [2020-07-21 23:45:22,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:22,637 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 1072 transitions. [2020-07-21 23:45:22,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1072 transitions. [2020-07-21 23:45:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-21 23:45:22,641 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:22,641 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:45:22,843 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:22,844 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:22,844 INFO L82 PathProgramCache]: Analyzing trace with hash -226598129, now seen corresponding path program 1 times [2020-07-21 23:45:22,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:22,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [505880628] [2020-07-21 23:45:22,845 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-21 23:45:22,937 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:45:22,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:22,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 23:45:22,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-21 23:45:22,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:22,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [505880628] [2020-07-21 23:45:22,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:22,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 23:45:22,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545129441] [2020-07-21 23:45:22,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 23:45:22,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:22,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 23:45:22,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 23:45:22,986 INFO L87 Difference]: Start difference. First operand 794 states and 1072 transitions. Second operand 6 states. [2020-07-21 23:45:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:23,059 INFO L93 Difference]: Finished difference Result 1533 states and 2191 transitions. [2020-07-21 23:45:23,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 23:45:23,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2020-07-21 23:45:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:23,066 INFO L225 Difference]: With dead ends: 1533 [2020-07-21 23:45:23,066 INFO L226 Difference]: Without dead ends: 864 [2020-07-21 23:45:23,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 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-21 23:45:23,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2020-07-21 23:45:23,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 844. [2020-07-21 23:45:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2020-07-21 23:45:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1122 transitions. [2020-07-21 23:45:23,126 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1122 transitions. Word has length 98 [2020-07-21 23:45:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:23,127 INFO L479 AbstractCegarLoop]: Abstraction has 844 states and 1122 transitions. [2020-07-21 23:45:23,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 23:45:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1122 transitions. [2020-07-21 23:45:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-21 23:45:23,130 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:23,130 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:45:23,346 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:23,346 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:23,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:23,347 INFO L82 PathProgramCache]: Analyzing trace with hash 2039783057, now seen corresponding path program 1 times [2020-07-21 23:45:23,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:23,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1075984334] [2020-07-21 23:45:23,348 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-21 23:45:23,450 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:45:23,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:23,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 23:45:23,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 23:45:23,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:23,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1075984334] [2020-07-21 23:45:23,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:23,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 23:45:23,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252234320] [2020-07-21 23:45:23,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 23:45:23,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:23,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 23:45:23,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 23:45:23,504 INFO L87 Difference]: Start difference. First operand 844 states and 1122 transitions. Second operand 6 states. [2020-07-21 23:45:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:23,580 INFO L93 Difference]: Finished difference Result 1486 states and 2052 transitions. [2020-07-21 23:45:23,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 23:45:23,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2020-07-21 23:45:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:23,586 INFO L225 Difference]: With dead ends: 1486 [2020-07-21 23:45:23,586 INFO L226 Difference]: Without dead ends: 732 [2020-07-21 23:45:23,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 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-21 23:45:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-07-21 23:45:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 726. [2020-07-21 23:45:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2020-07-21 23:45:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 940 transitions. [2020-07-21 23:45:23,632 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 940 transitions. Word has length 98 [2020-07-21 23:45:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:23,633 INFO L479 AbstractCegarLoop]: Abstraction has 726 states and 940 transitions. [2020-07-21 23:45:23,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 23:45:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 940 transitions. [2020-07-21 23:45:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-07-21 23:45:23,636 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:23,636 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] [2020-07-21 23:45:23,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:23,851 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:23,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:23,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1720352151, now seen corresponding path program 1 times [2020-07-21 23:45:23,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:23,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1195079400] [2020-07-21 23:45:23,853 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-21 23:45:23,952 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:45:23,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:23,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 23:45:23,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:24,004 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-21 23:45:24,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:24,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1195079400] [2020-07-21 23:45:24,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:24,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 23:45:24,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817992090] [2020-07-21 23:45:24,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 23:45:24,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:24,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 23:45:24,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 23:45:24,007 INFO L87 Difference]: Start difference. First operand 726 states and 940 transitions. Second operand 6 states. [2020-07-21 23:45:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:24,079 INFO L93 Difference]: Finished difference Result 1451 states and 1923 transitions. [2020-07-21 23:45:24,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 23:45:24,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2020-07-21 23:45:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:24,085 INFO L225 Difference]: With dead ends: 1451 [2020-07-21 23:45:24,085 INFO L226 Difference]: Without dead ends: 742 [2020-07-21 23:45:24,088 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-21 23:45:24,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2020-07-21 23:45:24,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 688. [2020-07-21 23:45:24,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2020-07-21 23:45:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 853 transitions. [2020-07-21 23:45:24,130 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 853 transitions. Word has length 148 [2020-07-21 23:45:24,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:24,130 INFO L479 AbstractCegarLoop]: Abstraction has 688 states and 853 transitions. [2020-07-21 23:45:24,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 23:45:24,130 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 853 transitions. [2020-07-21 23:45:24,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-07-21 23:45:24,133 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:24,133 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-21 23:45:24,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:24,348 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:24,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:24,348 INFO L82 PathProgramCache]: Analyzing trace with hash -744707149, now seen corresponding path program 1 times [2020-07-21 23:45:24,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:24,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1341190258] [2020-07-21 23:45:24,349 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-21 23:45:24,480 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:45:24,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:24,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 23:45:24,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:24,506 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-21 23:45:24,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:24,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1341190258] [2020-07-21 23:45:24,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:24,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:24,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601437360] [2020-07-21 23:45:24,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:24,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:24,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:24,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:24,509 INFO L87 Difference]: Start difference. First operand 688 states and 853 transitions. Second operand 3 states. [2020-07-21 23:45:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:24,555 INFO L93 Difference]: Finished difference Result 1199 states and 1514 transitions. [2020-07-21 23:45:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:24,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-07-21 23:45:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:24,560 INFO L225 Difference]: With dead ends: 1199 [2020-07-21 23:45:24,561 INFO L226 Difference]: Without dead ends: 702 [2020-07-21 23:45:24,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 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-21 23:45:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2020-07-21 23:45:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 688. [2020-07-21 23:45:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2020-07-21 23:45:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 851 transitions. [2020-07-21 23:45:24,605 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 851 transitions. Word has length 118 [2020-07-21 23:45:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:24,606 INFO L479 AbstractCegarLoop]: Abstraction has 688 states and 851 transitions. [2020-07-21 23:45:24,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:24,606 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 851 transitions. [2020-07-21 23:45:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-21 23:45:24,609 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:24,610 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:45:24,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:24,823 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:24,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:24,824 INFO L82 PathProgramCache]: Analyzing trace with hash -232030383, now seen corresponding path program 1 times [2020-07-21 23:45:24,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:24,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1365424848] [2020-07-21 23:45:24,824 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-21 23:45:24,928 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:45:24,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:24,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 23:45:24,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:45:24,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:45:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-21 23:45:25,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1365424848] [2020-07-21 23:45:25,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-21 23:45:25,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2020-07-21 23:45:25,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076258947] [2020-07-21 23:45:25,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-21 23:45:25,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:25,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-21 23:45:25,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-21 23:45:25,052 INFO L87 Difference]: Start difference. First operand 688 states and 851 transitions. Second operand 4 states. [2020-07-21 23:45:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:25,195 INFO L93 Difference]: Finished difference Result 755 states and 948 transitions. [2020-07-21 23:45:25,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-21 23:45:25,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-07-21 23:45:25,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:25,200 INFO L225 Difference]: With dead ends: 755 [2020-07-21 23:45:25,200 INFO L226 Difference]: Without dead ends: 752 [2020-07-21 23:45:25,201 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 194 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-21 23:45:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2020-07-21 23:45:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 689. [2020-07-21 23:45:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2020-07-21 23:45:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 851 transitions. [2020-07-21 23:45:25,270 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 851 transitions. Word has length 98 [2020-07-21 23:45:25,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:25,271 INFO L479 AbstractCegarLoop]: Abstraction has 689 states and 851 transitions. [2020-07-21 23:45:25,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-21 23:45:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 851 transitions. [2020-07-21 23:45:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-21 23:45:25,273 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:25,273 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-21 23:45:25,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:25,489 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:25,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2020-07-21 23:45:25,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:25,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1117449051] [2020-07-21 23:45:25,490 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-21 23:45:25,594 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:45:25,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:25,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-21 23:45:25,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:25,681 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-21 23:45:25,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:45:25,822 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-21 23:45:25,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1117449051] [2020-07-21 23:45:25,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:45:25,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2020-07-21 23:45:25,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685486006] [2020-07-21 23:45:25,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 23:45:25,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:25,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 23:45:25,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-21 23:45:25,824 INFO L87 Difference]: Start difference. First operand 689 states and 851 transitions. Second operand 12 states. [2020-07-21 23:45:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:27,556 INFO L93 Difference]: Finished difference Result 2894 states and 4434 transitions. [2020-07-21 23:45:27,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-21 23:45:27,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2020-07-21 23:45:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:27,583 INFO L225 Difference]: With dead ends: 2894 [2020-07-21 23:45:27,584 INFO L226 Difference]: Without dead ends: 2891 [2020-07-21 23:45:27,586 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-21 23:45:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2020-07-21 23:45:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2718. [2020-07-21 23:45:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2020-07-21 23:45:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 4052 transitions. [2020-07-21 23:45:27,813 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 4052 transitions. Word has length 99 [2020-07-21 23:45:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:27,813 INFO L479 AbstractCegarLoop]: Abstraction has 2718 states and 4052 transitions. [2020-07-21 23:45:27,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 23:45:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 4052 transitions. [2020-07-21 23:45:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-21 23:45:27,820 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:27,820 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-21 23:45:28,035 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:28,036 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:28,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:28,037 INFO L82 PathProgramCache]: Analyzing trace with hash 83738947, now seen corresponding path program 2 times [2020-07-21 23:45:28,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:28,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [866251053] [2020-07-21 23:45:28,038 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-21 23:45:28,176 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:45:28,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:28,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 23:45:28,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:28,208 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-21 23:45:28,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:28,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [866251053] [2020-07-21 23:45:28,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:28,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:28,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992115786] [2020-07-21 23:45:28,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:28,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:28,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:28,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:28,212 INFO L87 Difference]: Start difference. First operand 2718 states and 4052 transitions. Second operand 3 states. [2020-07-21 23:45:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:28,368 INFO L93 Difference]: Finished difference Result 4196 states and 6546 transitions. [2020-07-21 23:45:28,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:28,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-07-21 23:45:28,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:28,386 INFO L225 Difference]: With dead ends: 4196 [2020-07-21 23:45:28,386 INFO L226 Difference]: Without dead ends: 2111 [2020-07-21 23:45:28,414 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-21 23:45:28,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2020-07-21 23:45:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2055. [2020-07-21 23:45:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2020-07-21 23:45:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2857 transitions. [2020-07-21 23:45:28,611 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2857 transitions. Word has length 125 [2020-07-21 23:45:28,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:28,612 INFO L479 AbstractCegarLoop]: Abstraction has 2055 states and 2857 transitions. [2020-07-21 23:45:28,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2857 transitions. [2020-07-21 23:45:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-07-21 23:45:28,617 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:28,618 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:45:28,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:28,833 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:28,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:28,833 INFO L82 PathProgramCache]: Analyzing trace with hash 284247049, now seen corresponding path program 1 times [2020-07-21 23:45:28,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:28,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [737862790] [2020-07-21 23:45:28,834 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-21 23:45:28,929 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:45:28,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:28,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 23:45:28,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-21 23:45:28,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:28,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [737862790] [2020-07-21 23:45:28,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:28,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:28,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651690513] [2020-07-21 23:45:28,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:28,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:28,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:28,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:28,972 INFO L87 Difference]: Start difference. First operand 2055 states and 2857 transitions. Second operand 3 states. [2020-07-21 23:45:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:29,039 INFO L93 Difference]: Finished difference Result 2637 states and 3665 transitions. [2020-07-21 23:45:29,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:29,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2020-07-21 23:45:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:29,041 INFO L225 Difference]: With dead ends: 2637 [2020-07-21 23:45:29,041 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 23:45:29,056 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 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-21 23:45:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 23:45:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 23:45:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 23:45:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 23:45:29,057 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2020-07-21 23:45:29,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:29,057 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 23:45:29,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 23:45:29,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 23:45:29,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:29,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 23:45:31,295 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2020-07-21 23:45:31,579 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2020-07-21 23:45:31,728 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-07-21 23:45:32,136 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2020-07-21 23:45:32,605 WARN L193 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2020-07-21 23:45:32,853 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2020-07-21 23:45:33,187 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2020-07-21 23:45:33,423 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2020-07-21 23:45:33,587 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2020-07-21 23:45:34,681 WARN L193 SmtUtils]: Spent 961.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2020-07-21 23:45:34,788 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-07-21 23:45:35,025 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2020-07-21 23:45:35,475 WARN L193 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-07-21 23:45:35,653 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 44 [2020-07-21 23:45:36,512 WARN L193 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2020-07-21 23:45:37,123 WARN L193 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2020-07-21 23:45:37,503 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2020-07-21 23:45:37,965 WARN L193 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2020-07-21 23:45:38,070 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-07-21 23:45:38,518 WARN L193 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2020-07-21 23:45:39,481 WARN L193 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2020-07-21 23:45:39,692 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-07-21 23:45:40,003 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2020-07-21 23:45:40,357 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2020-07-21 23:45:40,862 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2020-07-21 23:45:41,116 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2020-07-21 23:45:41,344 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2020-07-21 23:45:41,348 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2020-07-21 23:45:41,348 INFO L268 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2020-07-21 23:45:41,349 INFO L268 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2020-07-21 23:45:41,349 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2020-07-21 23:45:41,349 INFO L264 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse4 (not (= 1 ~q_free~0)))) (and (or .cse0 .cse1 (not (<= 1 ~c_dr_pc~0)) .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) .cse3 .cse4 (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 .cse1 .cse2 .cse3 .cse4 (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))))) [2020-07-21 23:45:41,349 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2020-07-21 23:45:41,349 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2020-07-21 23:45:41,349 INFO L268 CegarLoopResult]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2020-07-21 23:45:41,349 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 (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 |old(~p_dw_st~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-21 23:45:41,350 INFO L268 CegarLoopResult]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2020-07-21 23:45:41,350 INFO L264 CegarLoopResult]: At program point L354-1(line 354) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 1 ~p_dw_i~0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-21 23:45:41,350 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-21 23:45:41,350 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2020-07-21 23:45:41,350 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2020-07-21 23:45:41,350 INFO L268 CegarLoopResult]: For program point L355(line 355) no Hoare annotation was computed. [2020-07-21 23:45:41,351 INFO L264 CegarLoopResult]: At program point L354(line 354) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-21 23:45:41,351 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 (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (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)|)) .cse6 .cse7 (not (<= 1 ~c_dr_pc~0)) .cse1 .cse2) (or (not (= 0 ~c_num_read~0)) .cse0 .cse6 .cse7 (not (= 0 |old(~p_num_write~0)|)) .cse1 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (and .cse3 (= 1 ~p_num_write~0) .cse4 .cse5) (not (<= |old(~p_dw_pc~0)| 0))))) [2020-07-21 23:45:41,351 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_dr_st~0)) (.cse8 (not (= 0 ~c_num_read~0))) (.cse4 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse12 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse5 (not (= 1 |old(~q_free~0)|))) (.cse9 (<= ~p_dw_pc~0 0)) (.cse6 (= 1 ~q_free~0)) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 |old(~c_dr_st~0)|))) (.cse13 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse4 .cse5 (not (<= 1 ~c_dr_pc~0)) .cse2 .cse3 (and .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse6 .cse7)) (or .cse8 .cse4 (and .cse9 .cse10) .cse5 .cse11 .cse2 .cse12 .cse3 .cse13) (or .cse8 .cse0 .cse4 .cse5 .cse11 .cse2 .cse12 (and .cse9 .cse10 (= 0 ~p_num_write~0) .cse6 .cse7) .cse13) (or .cse0 .cse5 (and .cse9 .cse6) .cse2 .cse3 .cse13))) [2020-07-21 23:45:41,351 INFO L264 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse1 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (= 0 ~c_num_read~0))) (.cse5 (<= ~p_dw_pc~0 0)) (.cse7 (not (= 0 |old(~p_num_write~0)|))) (.cse9 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse10 (not (<= |old(~p_dw_pc~0)| 0))) (.cse12 (<= 2 ~c_dr_st~0)) (.cse4 (= 0 ~q_free~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (= 1 |old(~q_free~0)|))) (.cse8 (not (= 1 ~p_dw_i~0))) (.cse11 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 (= 1 ~p_num_write~0) .cse6) .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse5 .cse3 .cse8 .cse11 .cse10) (or .cse1 .cse12 .cse8 .cse11) (or .cse0 .cse2 .cse5 .cse3 .cse7 .cse8 .cse9 .cse11 .cse10) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (and .cse12 .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6) .cse2 .cse3 (not (<= 1 ~c_dr_pc~0)) .cse8 .cse11))) [2020-07-21 23:45:41,352 INFO L268 CegarLoopResult]: For program point L124-1(line 124) no Hoare annotation was computed. [2020-07-21 23:45:41,352 INFO L268 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2020-07-21 23:45:41,352 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2020-07-21 23:45:41,352 INFO L264 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse6 (<= 2 ~c_dr_st~0)) (.cse4 (not (<= 2 |old(~c_dr_st~0)|))) (.cse9 (not (= 0 ~c_num_read~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse7 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse10 (not (= 0 |old(~p_num_write~0)|))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse11 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse1 (<= ~p_dw_pc~0 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse3 .cse4) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse7 .cse2 (not (<= 1 ~c_dr_pc~0)) .cse3 .cse4 (and .cse6 (= ~c_num_read~0 ~p_num_write~0) .cse8)) (or .cse9 .cse7 .cse1 .cse2 .cse10 .cse3 .cse11 .cse4 .cse5) (or .cse9 .cse0 .cse7 .cse2 .cse10 .cse3 .cse11 (and .cse1 (= 0 ~p_num_write~0) .cse8) .cse5))) [2020-07-21 23:45:41,352 INFO L264 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse7 (not (= 0 ~c_num_read~0))) (.cse1 (<= ~p_dw_pc~0 0)) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse12 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse5 (not (<= |old(~p_dw_pc~0)| 0))) (.cse8 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse9 (= 0 ~q_free~0)) (.cse4 (not (<= 2 |old(~c_dr_st~0)|))) (.cse6 (<= 2 ~c_dr_st~0)) (.cse13 (= 1 ~q_free~0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse3 .cse4) (or .cse7 .cse0 .cse8 .cse2 (and .cse9 .cse1 (= 1 ~p_num_write~0) .cse10) .cse11 .cse3 .cse12 (and .cse1 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0) .cse13 .cse10) .cse5) (or .cse7 .cse8 .cse1 .cse2 .cse11 .cse3 .cse12 .cse4 .cse5) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse8 .cse2 (not (<= 1 ~c_dr_pc~0)) .cse3 (and .cse9 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse10) .cse4 (and .cse6 (= ~c_num_read~0 ~p_num_write~0) .cse13 .cse10)))) [2020-07-21 23:45:41,352 INFO L268 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2020-07-21 23:45:41,352 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-07-21 23:45:41,353 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-21 23:45:41,353 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-07-21 23:45:41,353 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-07-21 23:45:41,353 INFO L264 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_dr_st~0)) (.cse2 (not (<= 2 |old(~c_dr_st~0)|))) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse5 (not (= 1 ~q_free~0))) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (not (<= ~c_dr_pc~0 0)) .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse1 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse2 (not (= 0 ~q_free~0))) (or .cse3 (not (<= 1 ~c_dr_pc~0)) .cse4 .cse1 (not (= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse7) (or .cse3 .cse4 .cse1 .cse5 (not (= 1 ~p_num_write~0)) .cse6 (not (= 1 ~c_num_read~0)) .cse7))) [2020-07-21 23:45:41,353 INFO L268 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2020-07-21 23:45:41,353 INFO L268 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-07-21 23:45:41,353 INFO L268 CegarLoopResult]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2020-07-21 23:45:41,354 INFO L268 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2020-07-21 23:45:41,354 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2020-07-21 23:45:41,354 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_dr_st~0)) (.cse2 (not (<= 2 |old(~c_dr_st~0)|))) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse5 (not (= 1 ~q_free~0))) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (not (<= ~c_dr_pc~0 0)) .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse1 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse2 (not (= 0 ~q_free~0))) (or .cse3 (not (<= 1 ~c_dr_pc~0)) .cse4 .cse1 (not (= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse7) (or .cse3 .cse4 .cse1 .cse5 (not (= 1 ~p_num_write~0)) .cse6 (not (= 1 ~c_num_read~0)) .cse7))) [2020-07-21 23:45:41,354 INFO L264 CegarLoopResult]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse11 (= 0 immediate_notify_threads_~tmp~0))) (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (= 0 ~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))) (.cse12 (<= 2 ~c_dr_st~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))) (.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 .cse12 .cse2 .cse13) (or .cse12 .cse0 .cse2 .cse14 .cse13 .cse10) (or .cse8 .cse9 .cse2 .cse13 .cse11) (or .cse8 .cse0 .cse2 .cse14 .cse13 .cse10 .cse11)))) [2020-07-21 23:45:41,354 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-07-21 23:45:41,355 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-21 23:45:41,355 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-21 23:45:41,355 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 23:45:41,355 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse2 (<= ~p_dw_pc~0 0)) (.cse7 (not (<= |old(~p_dw_pc~0)| 0))) (.cse8 (= 0 ~c_num_read~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse3 (= 1 ~q_free~0)) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse14 (<= 2 ~c_dr_st~0)) (.cse0 (not (= 0 |old(~p_dw_st~0)|))) (.cse5 (not (<= |old(~c_dr_pc~0)| 0))) (.cse9 (= 0 ~p_dw_st~0)) (.cse6 (not (<= 2 |old(~c_dr_st~0)|))) (.cse15 (not (= 1 |old(~p_num_write~0)|))) (.cse13 (not (= 0 |old(~c_num_read~0)|))) (.cse18 (= 1 ~p_num_write~0)) (.cse12 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse16 (not (<= 2 |old(~p_dw_st~0)|))) (.cse19 (not (= 0 |old(~q_free~0)|))) (.cse20 (= 0 ~q_free~0)) (.cse22 (<= 1 ~c_dr_pc~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (<= 2 ~p_dw_st~0)) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse17 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse23 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4 .cse5 .cse6 .cse7) (or (and .cse2 .cse8 (= ~c_last_read~0 ~p_last_write~0) .cse9 .cse10 (= 0 ~p_num_write~0) .cse3 .cse11) .cse12 .cse0 .cse1 (not (= 0 |old(~p_num_write~0)|)) .cse4 .cse13 .cse5 .cse7 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse4 (and .cse14 .cse10) .cse5 .cse6) (or .cse12 .cse15 .cse1 .cse16 .cse4 .cse17 (not (= 1 |old(~c_num_read~0)|)) .cse6 .cse18) (or .cse12 .cse15 .cse16 .cse19 .cse4 .cse13 .cse5 (and .cse20 .cse8 .cse10 .cse11 .cse21)) (or (and .cse14 (= ~c_num_read~0 ~p_num_write~0) .cse22 .cse3 .cse11 .cse21) .cse12 .cse1 .cse16 .cse4 .cse17 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse6) (or .cse14 .cse12 .cse16 .cse19 .cse4 .cse6 .cse23) (or .cse0 .cse4 .cse5 .cse9 .cse6) (or .cse12 .cse15 .cse16 .cse19 .cse4 .cse13 .cse18) (or .cse12 .cse16 .cse19 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse20 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse22 .cse11 .cse21) .cse4 .cse17 .cse23))) [2020-07-21 23:45:41,355 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)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse13 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse0 (and .cse14 .cse15 (= ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse3 .cse4)) (.cse10 (not (= 0 |old(~q_free~0)|))) (.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse2 (<= ~c_dr_pc~0 0)) (.cse8 (not (<= |old(~c_dr_pc~0)| 0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse5 (not (= 1 |old(~q_free~0)|))) (.cse9 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not .cse15)) (.cse11 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse12 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (<= 1 eval_~tmp___1~0) .cse2 (= 0 ~p_num_write~0) .cse3 .cse4) (not (= 0 |old(~p_dw_st~0)|)) .cse5 (not (= 0 |old(~p_num_write~0)|)) .cse6 .cse7 .cse8 (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse1 .cse9 .cse10 .cse6 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse9 .cse10 .cse6 .cse11 .cse13) (or .cse0 .cse1 (not (= 1 |old(~p_num_write~0)|)) .cse9 .cse10 .cse6 .cse7) (or .cse6 (and .cse14 .cse2) .cse8 .cse12) (or .cse1 .cse5 .cse9 .cse6 .cse11 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse12)))) [2020-07-21 23:45:41,355 INFO L268 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-07-21 23:45:41,356 INFO L268 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2020-07-21 23:45:41,356 INFO L268 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-07-21 23:45:41,356 INFO L264 CegarLoopResult]: At program point L238(line 238) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse23 (= 1 ~p_dw_i~0)) (.cse16 (= 0 ~p_dw_st~0)) (.cse24 (= ~c_num_read~0 ~p_num_write~0)) (.cse18 (= 1 ~q_free~0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse25 (<= 1 ~c_dr_pc~0)) (.cse27 (= 0 ~q_free~0)) (.cse15 (= 0 ~c_num_read~0)) (.cse22 (= 1 ~p_num_write~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse26 (<= 2 ~p_dw_st~0))) (let ((.cse11 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse7 (and .cse27 .cse15 .cse22 .cse19 .cse26)) (.cse9 (and .cse27 .cse13 .cse25 .cse19 .cse26)) (.cse4 (and .cse12 .cse23 .cse16 .cse24 .cse25 .cse18 .cse19)) (.cse0 (and .cse12 .cse23 .cse24 .cse25 .cse18 .cse19 .cse26)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse21 (not (<= |old(~c_dr_pc~0)| 0))) (.cse20 (not (= 1 |old(~q_free~0)|))) (.cse10 (not (<= 1 |old(~c_dr_pc~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 .cse0 .cse1 (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse7 (not (<= |old(~p_dw_pc~0)| 0)) .cse9 (and (<= ~p_dw_pc~0 0) .cse15 (= ~c_last_read~0 ~p_last_write~0) .cse16 .cse17 (= 0 ~p_num_write~0) .cse18 .cse19) .cse20 .cse4 .cse6 .cse8 .cse21 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse0 .cse1 .cse20 .cse5 .cse6 .cse10 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse14) (or .cse6 (and .cse12 .cse17) .cse21 .cse14) (or .cse1 .cse2 .cse20 .cse5 .cse6 .cse10 (not (= 1 |old(~c_num_read~0)|)) .cse14 .cse22) (or .cse1 .cse2 .cse5 .cse3 .cse6 .cse8 .cse14 .cse22)))) [2020-07-21 23:45:41,356 INFO L264 CegarLoopResult]: At program point L269(line 269) the Hoare annotation is: (let ((.cse13 (= 0 ~q_free~0)) (.cse3 (= 0 ~c_num_read~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (<= 2 ~p_dw_st~0))) (let ((.cse5 (and .cse13 .cse3 (= 1 ~p_num_write~0) .cse4 .cse14)) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse7 (not (<= |old(~c_dr_pc~0)| 0))) (.cse8 (and .cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse4 .cse14)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse9 (not (<= 2 |old(~p_dw_st~0)|))) (.cse10 (not (= 0 |old(~q_free~0)|))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse11 (not (<= 2 |old(~c_dr_st~0)|))) (.cse12 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 (not (= 0 |old(~p_dw_st~0)|)) .cse1 (not (= 0 |old(~p_num_write~0)|)) .cse2 (and (<= ~p_dw_pc~0 0) .cse3 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= 1 eval_~tmp___1~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= 1 ~q_free~0) .cse4) .cse5 .cse6 .cse7 (not (<= |old(~p_dw_pc~0)| 0)) .cse8 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse0 (not (= 1 |old(~p_num_write~0)|)) .cse9 .cse10 .cse2 .cse5 .cse6 .cse8) (or .cse0 .cse1 .cse9 .cse2 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse11) (or .cse2 .cse7 .cse11) (or .cse0 .cse9 .cse10 .cse2 (not (<= 1 |old(~c_dr_pc~0)|)) .cse8 .cse12) (or .cse0 .cse9 .cse10 .cse2 .cse11 .cse12)))) [2020-07-21 23:45:41,356 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2020-07-21 23:45:41,356 INFO L268 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2020-07-21 23:45:41,357 INFO L268 CegarLoopResult]: For program point L247(lines 237 277) no Hoare annotation was computed. [2020-07-21 23:45:41,357 INFO L264 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse12 (<= 2 ~c_dr_st~0)) (.cse21 (= 1 ~p_dw_i~0)) (.cse18 (<= 1 ~c_dr_pc~0)) (.cse17 (= 0 ~q_free~0)) (.cse16 (= 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) .cse16 .cse19 .cse20)) (.cse10 (not (<= |old(~c_dr_pc~0)| 0))) (.cse9 (not (= 1 |old(~q_free~0)|))) (.cse2 (not (= 1 |old(~p_num_write~0)|))) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (and .cse12 .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)) (.cse11 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse8 (and .cse17 .cse13 .cse18 .cse19 .cse20)) (.cse15 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 (not (= 0 |old(~p_dw_st~0)|)) .cse9 (not (= 0 |old(~p_num_write~0)|)) .cse5 .cse6 .cse7 .cse10 (not (<= |old(~p_dw_pc~0)| 0)) .cse8 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse1 .cse3 .cse4 .cse5 .cse11 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse12 .cse13) .cse14 .cse15) (or .cse0 .cse1 .cse9 .cse3 .cse5 .cse11 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse14) (or .cse5 (and .cse12 (<= ~c_dr_pc~0 0)) .cse10 .cse14) (or .cse1 .cse2 .cse9 .cse3 .cse5 .cse11 (not (= 1 |old(~c_num_read~0)|)) .cse14 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse16) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse8 .cse15)))) [2020-07-21 23:45:41,357 INFO L268 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2020-07-21 23:45:41,357 INFO L264 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse23 (= 1 ~p_dw_i~0)) (.cse16 (= 0 ~p_dw_st~0)) (.cse24 (= ~c_num_read~0 ~p_num_write~0)) (.cse18 (= 1 ~q_free~0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse25 (<= 1 ~c_dr_pc~0)) (.cse27 (= 0 ~q_free~0)) (.cse15 (= 0 ~c_num_read~0)) (.cse22 (= 1 ~p_num_write~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse26 (<= 2 ~p_dw_st~0))) (let ((.cse11 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse7 (and .cse27 .cse15 .cse22 .cse19 .cse26)) (.cse9 (and .cse27 .cse13 .cse25 .cse19 .cse26)) (.cse4 (and .cse12 .cse23 .cse16 .cse24 .cse25 .cse18 .cse19)) (.cse0 (and .cse12 .cse23 .cse24 .cse25 .cse18 .cse19 .cse26)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse21 (not (<= |old(~c_dr_pc~0)| 0))) (.cse20 (not (= 1 |old(~q_free~0)|))) (.cse10 (not (<= 1 |old(~c_dr_pc~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 .cse0 .cse1 (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse7 (not (<= |old(~p_dw_pc~0)| 0)) .cse9 (and (<= ~p_dw_pc~0 0) .cse15 (= ~c_last_read~0 ~p_last_write~0) .cse16 .cse17 (= 0 ~p_num_write~0) .cse18 .cse19) .cse20 .cse4 .cse6 .cse8 .cse21 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse0 .cse1 .cse20 .cse5 .cse6 .cse10 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse14) (or .cse6 (and .cse12 .cse17) .cse21 .cse14) (or .cse1 .cse2 .cse20 .cse5 .cse6 .cse10 (not (= 1 |old(~c_num_read~0)|)) .cse14 .cse22) (or .cse1 .cse2 .cse5 .cse3 .cse6 .cse8 .cse14 .cse22)))) [2020-07-21 23:45:41,357 INFO L268 CegarLoopResult]: For program point L290-1(line 290) no Hoare annotation was computed. [2020-07-21 23:45:41,357 INFO L271 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: true [2020-07-21 23:45:41,357 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2020-07-21 23:45:41,357 INFO L268 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2020-07-21 23:45:41,358 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2020-07-21 23:45:41,358 INFO L271 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: true [2020-07-21 23:45:41,358 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2020-07-21 23:45:41,358 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-21 23:45:41,358 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2020-07-21 23:45:41,358 INFO L268 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2020-07-21 23:45:41,358 INFO L268 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2020-07-21 23:45:41,358 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2020-07-21 23:45:41,358 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2020-07-21 23:45:41,358 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2020-07-21 23:45:41,359 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (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 (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-21 23:45:41,359 INFO L268 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2020-07-21 23:45:41,359 INFO L268 CegarLoopResult]: For program point L318(line 318) no Hoare annotation was computed. [2020-07-21 23:45:41,359 INFO L264 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse0 (= 0 ~q_free~0)) (.cse1 (= 0 ~c_num_read~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 (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (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 (<= |old(~p_dw_pc~0)| 0)) (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse2 .cse3) (and (<= ~p_dw_pc~0 0) .cse1 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse4 (= 0 ~p_num_write~0) .cse5 .cse2) (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 (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 23:45:41,359 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 (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (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 (<= |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 (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 23:45:41,360 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2020-07-21 23:45:41,360 INFO L268 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2020-07-21 23:45:41,360 INFO L264 CegarLoopResult]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse0 (= 0 ~q_free~0)) (.cse1 (= 0 ~c_num_read~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 (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (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 (<= |old(~p_dw_pc~0)| 0)) (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse2 .cse3) (and (<= ~p_dw_pc~0 0) .cse1 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse4 (= 0 ~p_num_write~0) .cse5 .cse2) (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 (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 23:45:41,360 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (or (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (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 (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-21 23:45:41,360 INFO L271 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2020-07-21 23:45:41,360 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 23:45:41,360 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) [2020-07-21 23:45:41,361 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 23:45:41,361 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 23:45:41,361 INFO L268 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2020-07-21 23:45:41,361 INFO L268 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2020-07-21 23:45:41,361 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2020-07-21 23:45:41,361 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2020-07-21 23:45:41,361 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2020-07-21 23:45:41,361 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-21 23:45:41,361 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2020-07-21 23:45:41,361 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2020-07-21 23:45:41,361 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))) (.cse8 (not (<= 2 |old(~p_dw_st~0)|))) (.cse9 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (= 0 |old(~c_num_read~0)|))) (.cse11 (<= 2 ~p_dw_st~0)) (.cse3 (<= 2 ~c_dr_st~0)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= 0 ~p_dw_st~0)) (.cse6 (<= 1 ~c_dr_pc~0)) (.cse7 (= 1 ~q_free~0))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse1 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse2 (not (<= |old(~c_dr_pc~0)| 0)) (and .cse3 (= 0 ~c_num_read~0) .cse4 .cse5 .cse6 .cse7) (not (= 0 ~p_num_write~0))) (let ((.cse10 (= ~c_num_read~0 ~p_num_write~0))) (or .cse0 .cse8 .cse9 .cse1 (not (<= 1 |old(~c_dr_pc~0)|)) (and .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse3 .cse10 .cse6 .cse7 .cse11) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))))) (let ((.cse12 (= 1 ~c_num_read~0))) (or .cse0 .cse8 .cse9 .cse1 .cse2 (and .cse12 .cse3 .cse6 .cse7 .cse11) (not (= 1 ~p_num_write~0)) (and .cse12 .cse3 .cse4 .cse5 .cse6 .cse7))))) [2020-07-21 23:45:41,362 INFO L268 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2020-07-21 23:45:41,362 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))))) [2020-07-21 23:45:41,362 INFO L264 CegarLoopResult]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse13 (= 1 ~p_dw_i~0))) (let ((.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse1 (= 0 ~c_num_read~0)) (.cse7 (not (<= |old(~c_dr_pc~0)| 0))) (.cse12 (= 0 ~q_free~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not (= 0 |old(~q_free~0)|))) (.cse5 (not .cse13)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse4 (= 1 ~q_free~0))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (and .cse1 .cse2 .cse3 .cse4) .cse5 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse6 .cse7 (not (= 0 ~p_num_write~0))) (let ((.cse8 (= 1 ~c_num_read~0))) (or (and .cse8 .cse2 .cse4 .cse9) .cse0 .cse10 .cse11 .cse5 .cse6 (and .cse12 .cse1 (<= ~c_dr_pc~0 0) .cse9) (and .cse8 .cse13 .cse2 .cse3 .cse4) .cse7 (not (= 1 ~p_num_write~0)))) (let ((.cse14 (= ~c_num_read~0 ~p_num_write~0))) (or (and .cse12 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse9) .cse0 .cse10 .cse11 .cse5 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) (and .cse2 .cse14 .cse4 .cse9) (and .cse13 .cse2 .cse3 .cse14 .cse4)))))) [2020-07-21 23:45:41,362 INFO L264 CegarLoopResult]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (not (<= |old(~c_dr_pc~0)| 0)))) (and (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)) .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~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 .cse4 .cse5 (not (= 1 ~p_num_write~0))))) [2020-07-21 23:45:41,362 INFO L268 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2020-07-21 23:45:41,362 INFO L268 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2020-07-21 23:45:41,362 INFO L264 CegarLoopResult]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (<= 2 |old(~p_dw_st~0)|))) (.cse9 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (= 0 ~q_free~0)) (.cse4 (= 0 ~c_num_read~0)) (.cse5 (<= ~c_dr_pc~0 0)) (.cse7 (<= 2 ~p_dw_st~0)) (.cse3 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse1 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse2 .cse3 (and .cse4 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse5 (= 1 ~q_free~0)) (not (= 0 ~p_num_write~0))) (or (and .cse6 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse7) .cse0 .cse8 .cse9 .cse1 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or .cse0 .cse8 .cse9 .cse1 .cse2 (and .cse6 .cse4 .cse5 .cse7) .cse3 (not (= 1 ~p_num_write~0))))) [2020-07-21 23:45:41,362 INFO L268 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2020-07-21 23:45:41,363 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))))) [2020-07-21 23:45:41,363 INFO L268 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2020-07-21 23:45:41,363 INFO L268 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2020-07-21 23:45:41,363 INFO L264 CegarLoopResult]: At program point L169(line 169) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 1 ~q_free~0)) (.cse8 (<= 2 ~p_dw_st~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (not (<= |old(~c_dr_pc~0)| 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 .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)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 .cse5 (not (= 0 ~p_num_write~0))))) [2020-07-21 23:45:41,363 INFO L268 CegarLoopResult]: For program point L169-1(line 169) no Hoare annotation was computed. [2020-07-21 23:45:41,363 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2020-07-21 23:45:41,363 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2020-07-21 23:45:41,364 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 ~p_dw_st~0)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_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-21 23:45:41,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 11:45:41 BoogieIcfgContainer [2020-07-21 23:45:41,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 23:45:41,431 INFO L168 Benchmark]: Toolchain (without parser) took 23193.52 ms. Allocated memory was 146.3 MB in the beginning and 514.9 MB in the end (delta: 368.6 MB). Free memory was 104.5 MB in the beginning and 261.7 MB in the end (delta: -157.2 MB). Peak memory consumption was 387.4 MB. Max. memory is 7.1 GB. [2020-07-21 23:45:41,432 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 146.3 MB. Free memory is still 122.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-21 23:45:41,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.39 ms. Allocated memory is still 146.3 MB. Free memory was 104.0 MB in the beginning and 91.6 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-07-21 23:45:41,433 INFO L168 Benchmark]: Boogie Preprocessor took 140.87 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 91.6 MB in the beginning and 181.3 MB in the end (delta: -89.7 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-21 23:45:41,434 INFO L168 Benchmark]: RCFGBuilder took 500.84 ms. Allocated memory is still 204.5 MB. Free memory was 181.3 MB in the beginning and 154.8 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2020-07-21 23:45:41,434 INFO L168 Benchmark]: TraceAbstraction took 22234.87 ms. Allocated memory was 204.5 MB in the beginning and 514.9 MB in the end (delta: 310.4 MB). Free memory was 153.8 MB in the beginning and 261.7 MB in the end (delta: -107.9 MB). Peak memory consumption was 378.6 MB. Max. memory is 7.1 GB. [2020-07-21 23:45:41,437 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.62 ms. Allocated memory is still 146.3 MB. Free memory is still 122.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 310.39 ms. Allocated memory is still 146.3 MB. Free memory was 104.0 MB in the beginning and 91.6 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.87 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 91.6 MB in the beginning and 181.3 MB in the end (delta: -89.7 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 500.84 ms. Allocated memory is still 204.5 MB. Free memory was 181.3 MB in the beginning and 154.8 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22234.87 ms. Allocated memory was 204.5 MB in the beginning and 514.9 MB in the end (delta: 310.4 MB). Free memory was 153.8 MB in the beginning and 261.7 MB in the end (delta: -107.9 MB). Peak memory consumption was 378.6 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)) && (((((((((((((((((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))) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(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)) || !(\old(c_dr_pc) <= 0)) || !(\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)) || !(\old(c_last_read) == \old(p_last_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)))) && (((((((((((((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 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st)))) && (((!(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))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(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: ((((((((((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_dw_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(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))) && ((((((!(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)) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0)) && (((!(c_dr_pc <= 0) || 2 <= c_dr_st) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st)))) && (((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(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)) || !(\old(p_dw_pc) <= 0))) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || p_dw_pc <= 0) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && (((((((!(c_num_read == \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(1 <= c_dr_pc)) || !(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)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((!(p_dw_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || (((0 == c_num_read && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(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))) || (((0 == q_free && 0 == c_num_read) && c_dr_pc <= 0) && 2 <= p_dw_st)) || ((((1 == c_num_read && 1 == p_dw_i) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(\old(c_dr_pc) <= 0)) || !(1 == 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)) || (((c_last_read == p_last_write && c_num_read == p_num_write) && 1 == q_free) && 2 <= p_dw_st)) || ((((1 == p_dw_i && c_last_read == p_last_write) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 == q_free)) - 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: ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(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)) || !(\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)) || (((((((p_dw_pc <= 0 && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc <= 0) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || !(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)) || !(\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)))) && (((((((((((((((((((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))) || !(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)) || !(\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)) || (((((((p_dw_pc <= 0 && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc <= 0) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || !(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)) || !(\old(c_last_read) == \old(p_last_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 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st)))) && (((!(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))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(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 == \old(q_free))) || !(1 <= c_dr_pc)) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st)))) && ((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || (((0 == q_free && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\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_dw_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(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)) || !(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_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)) || !(c_num_read == p_num_write)) || 1 <= __retres1) || !(1 == q_free)) || !(2 <= c_dr_st)) && (((((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(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)) || !(2 <= \old(c_dr_st))) || !(\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 == \old(q_free))) || !(1 <= c_dr_pc)) || !(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) || !(\old(q_buf_0) == \old(p_last_write))) || p_dw_pc <= 0) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || ((p_dw_pc <= 0 && 0 == p_num_write) && p_last_write == q_buf_0)) || !(\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.9s, OverallIterations: 14, TraceHistogramMax: 4, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2301 SDtfs, 2299 SDslu, 2725 SDs, 0 SdLazy, 1065 SolverSat, 500 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1593 GetRequests, 1544 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2718occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 473 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3892 PreInvPairs, 4228 NumberOfFragments, 5514 HoareAnnotationTreeSize, 3892 FomulaSimplifications, 7504 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 45 FomulaSimplificationsInter, 10996 FormulaSimplificationTreeSizeReductionInter, 10.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1392 NumberOfCodeBlocks, 913 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1573 ConstructedInterpolants, 0 QuantifiedInterpolants, 288533 SizeOfPredicates, 25 NumberOfNonLiveVariables, 7051 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 428/472 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...