/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic DAGSIZE --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 2 -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 20:56:41,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 20:56:41,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 20:56:41,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 20:56:41,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 20:56:41,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 20:56:41,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 20:56:41,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 20:56:41,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 20:56:41,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 20:56:41,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 20:56:41,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 20:56:41,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 20:56:41,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 20:56:41,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 20:56:41,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 20:56:41,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 20:56:41,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 20:56:41,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 20:56:41,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 20:56:41,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 20:56:41,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 20:56:41,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 20:56:41,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 20:56:41,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 20:56:41,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 20:56:41,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 20:56:41,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 20:56:41,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 20:56:41,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 20:56:41,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 20:56:41,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 20:56:41,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 20:56:41,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 20:56:41,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 20:56:41,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 20:56:41,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 20:56:41,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 20:56:41,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 20:56:41,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 20:56:41,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 20:56:41,473 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 20:56:41,488 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 20:56:41,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 20:56:41,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 20:56:41,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 20:56:41,490 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 20:56:41,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 20:56:41,490 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 20:56:41,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 20:56:41,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 20:56:41,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 20:56:41,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 20:56:41,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 20:56:41,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 20:56:41,492 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 20:56:41,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 20:56:41,492 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 20:56:41,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 20:56:41,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 20:56:41,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 20:56:41,493 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 20:56:41,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 20:56:41,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 20:56:41,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 20:56:41,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 20:56:41,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 20:56:41,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 20:56:41,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:56:41,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 20:56:41,494 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 20:56:41,495 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> DAGSIZE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 2 [2020-07-21 20:56:41,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 20:56:41,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 20:56:41,821 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 20:56:41,823 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 20:56:41,823 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 20:56:41,825 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 20:56:41,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114910cfc/3fa574879c104be19e6664bb62185e95/FLAG490c9d009 [2020-07-21 20:56:42,431 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 20:56:42,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-21 20:56:42,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114910cfc/3fa574879c104be19e6664bb62185e95/FLAG490c9d009 [2020-07-21 20:56:42,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114910cfc/3fa574879c104be19e6664bb62185e95 [2020-07-21 20:56:42,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 20:56:42,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 20:56:42,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 20:56:42,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 20:56:42,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 20:56:42,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:56:42" (1/1) ... [2020-07-21 20:56:42,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2faaa317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:56:42, skipping insertion in model container [2020-07-21 20:56:42,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:56:42" (1/1) ... [2020-07-21 20:56:42,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 20:56:42,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 20:56:43,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 20:56:43,047 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 20:56:43,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 20:56:43,225 INFO L208 MainTranslator]: Completed translation [2020-07-21 20:56:43,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:56:43 WrapperNode [2020-07-21 20:56:43,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 20:56:43,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 20:56:43,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 20:56:43,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 20:56:43,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:56:43" (1/1) ... [2020-07-21 20:56:43,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:56:43" (1/1) ... [2020-07-21 20:56:43,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:56:43" (1/1) ... [2020-07-21 20:56:43,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:56:43" (1/1) ... [2020-07-21 20:56:43,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:56:43" (1/1) ... [2020-07-21 20:56:43,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:56:43" (1/1) ... [2020-07-21 20:56:43,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:56:43" (1/1) ... [2020-07-21 20:56:43,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 20:56:43,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 20:56:43,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 20:56:43,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 20:56:43,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:56:43" (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 20:56:43,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 20:56:43,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 20:56:43,333 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-21 20:56:43,333 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-07-21 20:56:43,334 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-07-21 20:56:43,334 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-07-21 20:56:43,334 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-07-21 20:56:43,334 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-07-21 20:56:43,334 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-21 20:56:43,334 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-21 20:56:43,335 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-21 20:56:43,335 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-21 20:56:43,335 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-21 20:56:43,335 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-21 20:56:43,336 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 20:56:43,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 20:56:43,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 20:56:43,336 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-21 20:56:43,337 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-07-21 20:56:43,337 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-07-21 20:56:43,337 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-07-21 20:56:43,338 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-07-21 20:56:43,338 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-07-21 20:56:43,338 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-21 20:56:43,339 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-21 20:56:43,341 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-21 20:56:43,341 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-21 20:56:43,341 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-21 20:56:43,342 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-21 20:56:43,342 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 20:56:43,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 20:56:43,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 20:56:43,788 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 20:56:43,789 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-21 20:56:43,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:56:43 BoogieIcfgContainer [2020-07-21 20:56:43,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 20:56:43,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 20:56:43,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 20:56:43,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 20:56:43,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:56:42" (1/3) ... [2020-07-21 20:56:43,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7385d41f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:56:43, skipping insertion in model container [2020-07-21 20:56:43,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:56:43" (2/3) ... [2020-07-21 20:56:43,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7385d41f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:56:43, skipping insertion in model container [2020-07-21 20:56:43,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:56:43" (3/3) ... [2020-07-21 20:56:43,809 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-07-21 20:56:43,820 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 20:56:43,835 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 20:56:43,846 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 20:56:43,871 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 20:56:43,871 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 20:56:43,871 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 20:56:43,871 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 20:56:43,872 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 20:56:43,872 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 20:56:43,872 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 20:56:43,872 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 20:56:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2020-07-21 20:56:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 20:56:43,904 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:56:43,905 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 20:56:43,905 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:56:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:56:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2020-07-21 20:56:43,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:56:43,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [663642339] [2020-07-21 20:56:43,923 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:56:44,094 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:56:44,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:56:44,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 20:56:44,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:56:44,180 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 20:56:44,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:56:44,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [663642339] [2020-07-21 20:56:44,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:56:44,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 20:56:44,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697238941] [2020-07-21 20:56:44,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 20:56:44,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:56:44,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 20:56:44,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:56:44,210 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2020-07-21 20:56:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:56:44,299 INFO L93 Difference]: Finished difference Result 279 states and 392 transitions. [2020-07-21 20:56:44,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 20:56:44,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-21 20:56:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:56:44,330 INFO L225 Difference]: With dead ends: 279 [2020-07-21 20:56:44,330 INFO L226 Difference]: Without dead ends: 175 [2020-07-21 20:56:44,340 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 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 20:56:44,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-07-21 20:56:44,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2020-07-21 20:56:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-07-21 20:56:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 219 transitions. [2020-07-21 20:56:44,476 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 219 transitions. Word has length 65 [2020-07-21 20:56:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:56:44,477 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 219 transitions. [2020-07-21 20:56:44,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 20:56:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 219 transitions. [2020-07-21 20:56:44,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 20:56:44,488 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:56:44,489 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 20:56:44,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:56:44,704 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:56:44,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:56:44,705 INFO L82 PathProgramCache]: Analyzing trace with hash -478691660, now seen corresponding path program 1 times [2020-07-21 20:56:44,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:56:44,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2036392280] [2020-07-21 20:56:44,708 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:56:44,797 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:56:44,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:56:44,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 20:56:44,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:56:44,850 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 20:56:44,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:56:44,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2036392280] [2020-07-21 20:56:44,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:56:44,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 20:56:44,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100051127] [2020-07-21 20:56:44,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 20:56:44,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:56:44,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 20:56:44,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:56:44,856 INFO L87 Difference]: Start difference. First operand 171 states and 219 transitions. Second operand 3 states. [2020-07-21 20:56:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:56:44,923 INFO L93 Difference]: Finished difference Result 468 states and 631 transitions. [2020-07-21 20:56:44,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 20:56:44,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-21 20:56:44,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:56:44,929 INFO L225 Difference]: With dead ends: 468 [2020-07-21 20:56:44,929 INFO L226 Difference]: Without dead ends: 314 [2020-07-21 20:56:44,932 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 20:56:44,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-07-21 20:56:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2020-07-21 20:56:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-07-21 20:56:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 412 transitions. [2020-07-21 20:56:44,976 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 412 transitions. Word has length 65 [2020-07-21 20:56:44,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:56:44,976 INFO L479 AbstractCegarLoop]: Abstraction has 310 states and 412 transitions. [2020-07-21 20:56:44,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 20:56:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 412 transitions. [2020-07-21 20:56:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 20:56:44,983 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:56:44,984 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 20:56:45,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:56:45,201 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:56:45,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:56:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1988256317, now seen corresponding path program 1 times [2020-07-21 20:56:45,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:56:45,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [592912812] [2020-07-21 20:56:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:56:45,286 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:56:45,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:56:45,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 20:56:45,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:56:45,354 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 20:56:45,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:56:45,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [592912812] [2020-07-21 20:56:45,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:56:45,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 20:56:45,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27881124] [2020-07-21 20:56:45,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 20:56:45,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:56:45,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 20:56:45,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 20:56:45,359 INFO L87 Difference]: Start difference. First operand 310 states and 412 transitions. Second operand 6 states. [2020-07-21 20:56:45,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:56:45,469 INFO L93 Difference]: Finished difference Result 614 states and 853 transitions. [2020-07-21 20:56:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 20:56:45,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-07-21 20:56:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:56:45,477 INFO L225 Difference]: With dead ends: 614 [2020-07-21 20:56:45,477 INFO L226 Difference]: Without dead ends: 324 [2020-07-21 20:56:45,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 20:56:45,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-07-21 20:56:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 320. [2020-07-21 20:56:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-07-21 20:56:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 420 transitions. [2020-07-21 20:56:45,520 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 420 transitions. Word has length 66 [2020-07-21 20:56:45,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:56:45,520 INFO L479 AbstractCegarLoop]: Abstraction has 320 states and 420 transitions. [2020-07-21 20:56:45,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 20:56:45,521 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 420 transitions. [2020-07-21 20:56:45,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 20:56:45,523 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:56:45,524 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 20:56:45,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:56:45,733 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:56:45,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:56:45,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2033659546, now seen corresponding path program 1 times [2020-07-21 20:56:45,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:56:45,735 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [53184794] [2020-07-21 20:56:45,736 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:56:45,801 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:56:45,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:56:45,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 20:56:45,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:56:45,841 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 20:56:45,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:56:45,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [53184794] [2020-07-21 20:56:45,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:56:45,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 20:56:45,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559496547] [2020-07-21 20:56:45,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 20:56:45,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:56:45,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 20:56:45,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:56:45,849 INFO L87 Difference]: Start difference. First operand 320 states and 420 transitions. Second operand 3 states. [2020-07-21 20:56:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:56:45,901 INFO L93 Difference]: Finished difference Result 620 states and 817 transitions. [2020-07-21 20:56:45,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 20:56:45,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-21 20:56:45,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:56:45,910 INFO L225 Difference]: With dead ends: 620 [2020-07-21 20:56:45,910 INFO L226 Difference]: Without dead ends: 317 [2020-07-21 20:56:45,912 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 20:56:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-07-21 20:56:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2020-07-21 20:56:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-07-21 20:56:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 415 transitions. [2020-07-21 20:56:45,943 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 415 transitions. Word has length 66 [2020-07-21 20:56:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:56:45,944 INFO L479 AbstractCegarLoop]: Abstraction has 317 states and 415 transitions. [2020-07-21 20:56:45,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 20:56:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 415 transitions. [2020-07-21 20:56:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 20:56:45,946 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:56:45,946 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 20:56:46,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:56:46,161 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:56:46,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:56:46,162 INFO L82 PathProgramCache]: Analyzing trace with hash -213248955, now seen corresponding path program 1 times [2020-07-21 20:56:46,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:56:46,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2136931260] [2020-07-21 20:56:46,164 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:56:46,275 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 20:56:46,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:56:46,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 20:56:46,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:56:46,323 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 20:56:46,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:56:46,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2136931260] [2020-07-21 20:56:46,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:56:46,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 20:56:46,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489981170] [2020-07-21 20:56:46,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 20:56:46,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:56:46,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 20:56:46,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:56:46,327 INFO L87 Difference]: Start difference. First operand 317 states and 415 transitions. Second operand 3 states. [2020-07-21 20:56:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:56:46,398 INFO L93 Difference]: Finished difference Result 826 states and 1113 transitions. [2020-07-21 20:56:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 20:56:46,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-21 20:56:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:56:46,403 INFO L225 Difference]: With dead ends: 826 [2020-07-21 20:56:46,403 INFO L226 Difference]: Without dead ends: 526 [2020-07-21 20:56:46,406 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 20:56:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-07-21 20:56:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 522. [2020-07-21 20:56:46,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2020-07-21 20:56:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 671 transitions. [2020-07-21 20:56:46,445 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 671 transitions. Word has length 66 [2020-07-21 20:56:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:56:46,446 INFO L479 AbstractCegarLoop]: Abstraction has 522 states and 671 transitions. [2020-07-21 20:56:46,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 20:56:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 671 transitions. [2020-07-21 20:56:46,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 20:56:46,448 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:56:46,448 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 20:56:46,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:56:46,664 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:56:46,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:56:46,664 INFO L82 PathProgramCache]: Analyzing trace with hash -326635612, now seen corresponding path program 1 times [2020-07-21 20:56:46,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:56:46,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1519720138] [2020-07-21 20:56:46,665 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:56:46,729 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:56:46,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:56:46,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 20:56:46,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:56:46,770 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 20:56:46,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:56:46,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1519720138] [2020-07-21 20:56:46,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:56:46,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 20:56:46,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822626152] [2020-07-21 20:56:46,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 20:56:46,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:56:46,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 20:56:46,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 20:56:46,773 INFO L87 Difference]: Start difference. First operand 522 states and 671 transitions. Second operand 6 states. [2020-07-21 20:56:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:56:46,833 INFO L93 Difference]: Finished difference Result 1013 states and 1341 transitions. [2020-07-21 20:56:46,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 20:56:46,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-07-21 20:56:46,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:56:46,838 INFO L225 Difference]: With dead ends: 1013 [2020-07-21 20:56:46,838 INFO L226 Difference]: Without dead ends: 544 [2020-07-21 20:56:46,841 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 20:56:46,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-07-21 20:56:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2020-07-21 20:56:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-07-21 20:56:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 689 transitions. [2020-07-21 20:56:46,875 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 689 transitions. Word has length 66 [2020-07-21 20:56:46,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:56:46,876 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 689 transitions. [2020-07-21 20:56:46,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 20:56:46,876 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 689 transitions. [2020-07-21 20:56:46,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-21 20:56:46,878 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:56:46,879 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-21 20:56:47,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:56:47,095 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:56:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:56:47,095 INFO L82 PathProgramCache]: Analyzing trace with hash 755716257, now seen corresponding path program 1 times [2020-07-21 20:56:47,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:56:47,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [344129392] [2020-07-21 20:56:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:56:47,156 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:56:47,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:56:47,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 20:56:47,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:56:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 20:56:47,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:56:47,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [344129392] [2020-07-21 20:56:47,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:56:47,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 20:56:47,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446728885] [2020-07-21 20:56:47,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 20:56:47,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:56:47,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 20:56:47,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:56:47,187 INFO L87 Difference]: Start difference. First operand 544 states and 689 transitions. Second operand 3 states. [2020-07-21 20:56:47,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:56:47,260 INFO L93 Difference]: Finished difference Result 1396 states and 1816 transitions. [2020-07-21 20:56:47,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 20:56:47,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-07-21 20:56:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:56:47,267 INFO L225 Difference]: With dead ends: 1396 [2020-07-21 20:56:47,267 INFO L226 Difference]: Without dead ends: 680 [2020-07-21 20:56:47,271 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 20:56:47,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-07-21 20:56:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2020-07-21 20:56:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2020-07-21 20:56:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 874 transitions. [2020-07-21 20:56:47,318 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 874 transitions. Word has length 86 [2020-07-21 20:56:47,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:56:47,319 INFO L479 AbstractCegarLoop]: Abstraction has 680 states and 874 transitions. [2020-07-21 20:56:47,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 20:56:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 874 transitions. [2020-07-21 20:56:47,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 20:56:47,321 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:56:47,321 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 20:56:47,536 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:56:47,537 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:56:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:56:47,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1347703966, now seen corresponding path program 1 times [2020-07-21 20:56:47,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:56:47,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1091609360] [2020-07-21 20:56:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:56:47,646 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 20:56:47,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:56:47,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-21 20:56:47,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:56:47,670 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 20:56:47,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:56:47,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1091609360] [2020-07-21 20:56:47,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:56:47,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 20:56:47,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698785810] [2020-07-21 20:56:47,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 20:56:47,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:56:47,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 20:56:47,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:56:47,676 INFO L87 Difference]: Start difference. First operand 680 states and 874 transitions. Second operand 3 states. [2020-07-21 20:56:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:56:47,746 INFO L93 Difference]: Finished difference Result 1489 states and 1976 transitions. [2020-07-21 20:56:47,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 20:56:47,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-21 20:56:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:56:47,753 INFO L225 Difference]: With dead ends: 1489 [2020-07-21 20:56:47,753 INFO L226 Difference]: Without dead ends: 862 [2020-07-21 20:56:47,757 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 20:56:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2020-07-21 20:56:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 722. [2020-07-21 20:56:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2020-07-21 20:56:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 936 transitions. [2020-07-21 20:56:47,810 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 936 transitions. Word has length 66 [2020-07-21 20:56:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:56:47,810 INFO L479 AbstractCegarLoop]: Abstraction has 722 states and 936 transitions. [2020-07-21 20:56:47,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 20:56:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 936 transitions. [2020-07-21 20:56:47,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-21 20:56:47,814 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:56:47,814 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 20:56:48,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:56:48,029 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:56:48,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:56:48,030 INFO L82 PathProgramCache]: Analyzing trace with hash -232030383, now seen corresponding path program 1 times [2020-07-21 20:56:48,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:56:48,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1629356811] [2020-07-21 20:56:48,031 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:56:48,118 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:56:48,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:56:48,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 20:56:48,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:56:48,152 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 20:56:48,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 20:56:48,248 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 20:56:48,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1629356811] [2020-07-21 20:56:48,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-21 20:56:48,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2020-07-21 20:56:48,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223188246] [2020-07-21 20:56:48,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-21 20:56:48,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:56:48,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-21 20:56:48,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-21 20:56:48,251 INFO L87 Difference]: Start difference. First operand 722 states and 936 transitions. Second operand 4 states. [2020-07-21 20:56:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:56:48,412 INFO L93 Difference]: Finished difference Result 794 states and 1059 transitions. [2020-07-21 20:56:48,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-21 20:56:48,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-07-21 20:56:48,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:56:48,418 INFO L225 Difference]: With dead ends: 794 [2020-07-21 20:56:48,419 INFO L226 Difference]: Without dead ends: 791 [2020-07-21 20:56:48,420 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 20:56:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2020-07-21 20:56:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 723. [2020-07-21 20:56:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2020-07-21 20:56:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 936 transitions. [2020-07-21 20:56:48,496 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 936 transitions. Word has length 98 [2020-07-21 20:56:48,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:56:48,497 INFO L479 AbstractCegarLoop]: Abstraction has 723 states and 936 transitions. [2020-07-21 20:56:48,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-21 20:56:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 936 transitions. [2020-07-21 20:56:48,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-21 20:56:48,500 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:56:48,500 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 20:56:48,713 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:56:48,714 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:56:48,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:56:48,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2020-07-21 20:56:48,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:56:48,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1758187212] [2020-07-21 20:56:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:56:48,813 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 20:56:48,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:56:48,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-21 20:56:48,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:56:48,902 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 20:56:48,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 20:56:49,041 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 20:56:49,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1758187212] [2020-07-21 20:56:49,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 20:56:49,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2020-07-21 20:56:49,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461810340] [2020-07-21 20:56:49,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 20:56:49,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:56:49,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 20:56:49,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-21 20:56:49,044 INFO L87 Difference]: Start difference. First operand 723 states and 936 transitions. Second operand 12 states. [2020-07-21 20:56:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:56:51,083 INFO L93 Difference]: Finished difference Result 3078 states and 5301 transitions. [2020-07-21 20:56:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-21 20:56:51,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2020-07-21 20:56:51,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:56:51,119 INFO L225 Difference]: With dead ends: 3078 [2020-07-21 20:56:51,119 INFO L226 Difference]: Without dead ends: 3075 [2020-07-21 20:56:51,122 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 20:56:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2020-07-21 20:56:51,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2907. [2020-07-21 20:56:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2907 states. [2020-07-21 20:56:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 4802 transitions. [2020-07-21 20:56:51,497 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 4802 transitions. Word has length 99 [2020-07-21 20:56:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:56:51,498 INFO L479 AbstractCegarLoop]: Abstraction has 2907 states and 4802 transitions. [2020-07-21 20:56:51,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 20:56:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 4802 transitions. [2020-07-21 20:56:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-07-21 20:56:51,505 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:56:51,505 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:51,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:56:51,719 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:56:51,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:56:51,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1070593826, now seen corresponding path program 1 times [2020-07-21 20:56:51,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:56:51,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [477326027] [2020-07-21 20:56:51,720 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:56:51,791 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:56:51,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:56:51,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 20:56:51,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:56:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-21 20:56:51,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:56:51,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [477326027] [2020-07-21 20:56:51,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:56:51,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 20:56:51,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361582584] [2020-07-21 20:56:51,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 20:56:51,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:56:51,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 20:56:51,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:56:51,819 INFO L87 Difference]: Start difference. First operand 2907 states and 4802 transitions. Second operand 3 states. [2020-07-21 20:56:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:56:52,003 INFO L93 Difference]: Finished difference Result 4497 states and 7897 transitions. [2020-07-21 20:56:52,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 20:56:52,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-07-21 20:56:52,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:56:52,030 INFO L225 Difference]: With dead ends: 4497 [2020-07-21 20:56:52,030 INFO L226 Difference]: Without dead ends: 2265 [2020-07-21 20:56:52,073 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 143 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 20:56:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2020-07-21 20:56:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2201. [2020-07-21 20:56:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2201 states. [2020-07-21 20:56:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2201 states to 2201 states and 3317 transitions. [2020-07-21 20:56:52,300 INFO L78 Accepts]: Start accepts. Automaton has 2201 states and 3317 transitions. Word has length 145 [2020-07-21 20:56:52,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:56:52,300 INFO L479 AbstractCegarLoop]: Abstraction has 2201 states and 3317 transitions. [2020-07-21 20:56:52,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 20:56:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 3317 transitions. [2020-07-21 20:56:52,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-21 20:56:52,309 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:56:52,309 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 20:56:52,523 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:56:52,524 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:56:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:56:52,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1218823465, now seen corresponding path program 1 times [2020-07-21 20:56:52,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:56:52,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [827757785] [2020-07-21 20:56:52,525 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 20:56:52,612 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:56:52,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:56:52,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 20:56:52,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:56:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-21 20:56:52,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:56:52,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [827757785] [2020-07-21 20:56:52,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:56:52,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 20:56:52,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183501000] [2020-07-21 20:56:52,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 20:56:52,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:56:52,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 20:56:52,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:56:52,642 INFO L87 Difference]: Start difference. First operand 2201 states and 3317 transitions. Second operand 3 states. [2020-07-21 20:56:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:56:52,710 INFO L93 Difference]: Finished difference Result 2838 states and 4294 transitions. [2020-07-21 20:56:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 20:56:52,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-07-21 20:56:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:56:52,712 INFO L225 Difference]: With dead ends: 2838 [2020-07-21 20:56:52,712 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 20:56:52,729 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:56:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 20:56:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 20:56:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 20:56:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 20:56:52,731 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2020-07-21 20:56:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:56:52,731 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 20:56:52,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 20:56:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 20:56:52,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 20:56:52,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:56:52,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 20:56:54,766 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 1 [2020-07-21 20:56:54,967 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-07-21 20:56:55,208 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-07-21 20:56:55,342 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-07-21 20:56:55,729 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2020-07-21 20:56:55,882 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2020-07-21 20:56:56,217 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2020-07-21 20:56:56,477 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2020-07-21 20:56:56,630 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 37 [2020-07-21 20:56:56,827 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-07-21 20:56:57,819 WARN L193 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2020-07-21 20:56:58,128 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2020-07-21 20:56:58,322 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2020-07-21 20:56:59,338 WARN L193 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2020-07-21 20:57:00,072 WARN L193 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2020-07-21 20:57:00,396 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2020-07-21 20:57:00,702 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2020-07-21 20:57:01,032 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2020-07-21 20:57:01,944 WARN L193 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2020-07-21 20:57:02,084 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-07-21 20:57:02,363 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2020-07-21 20:57:02,668 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2020-07-21 20:57:03,237 WARN L193 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2020-07-21 20:57:03,397 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2020-07-21 20:57:03,711 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-07-21 20:57:03,716 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2020-07-21 20:57:03,716 INFO L268 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2020-07-21 20:57:03,716 INFO L268 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2020-07-21 20:57:03,716 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2020-07-21 20:57:03,716 INFO L271 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: true [2020-07-21 20:57:03,716 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2020-07-21 20:57:03,716 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2020-07-21 20:57:03,716 INFO L268 CegarLoopResult]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2020-07-21 20:57:03,717 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 20:57:03,717 INFO L268 CegarLoopResult]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2020-07-21 20:57:03,717 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 20:57:03,717 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 20:57:03,717 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2020-07-21 20:57:03,718 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2020-07-21 20:57:03,718 INFO L268 CegarLoopResult]: For program point L355(line 355) no Hoare annotation was computed. [2020-07-21 20:57:03,718 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 20:57:03,719 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 .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 20:57:03,719 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_dr_st~0)) (.cse8 (not (= 0 ~c_num_read~0))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not (= 1 |old(~q_free~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)) (.cse5 (= 1 ~q_free~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (not (<= ~c_dr_pc~0 0))) (.cse9 (<= ~p_dw_pc~0 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 (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse0 .cse1 .cse2 .cse3 (and .cse4 (= ~c_num_read~0 ~p_num_write~0) .cse5 .cse6)) (or .cse7 .cse4 .cse2 .cse3) (or .cse8 .cse0 (and .cse9 .cse10) .cse1 .cse11 .cse2 .cse12 .cse3 .cse13) (or .cse8 .cse7 .cse0 .cse1 .cse11 .cse2 .cse12 (and .cse9 .cse10 (= 0 ~p_num_write~0) .cse5 .cse6) .cse13) (or .cse7 .cse9 .cse2 .cse3 .cse13))) [2020-07-21 20:57:03,719 INFO L264 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse4 (= 0 ~q_free~0)) (.cse11 (<= 2 ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (not (= 0 ~c_num_read~0))) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (= 1 |old(~q_free~0)|))) (.cse7 (not (= 0 |old(~p_num_write~0)|))) (.cse9 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse5 (<= ~p_dw_pc~0 0)) (.cse8 (not (= 1 ~p_dw_i~0))) (.cse12 (not (<= 2 |old(~c_dr_st~0)|))) (.cse10 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 (= 1 ~p_num_write~0) .cse6) .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse11 .cse8 .cse12) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse2 (and .cse4 .cse11 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6) .cse3 .cse8 .cse12) (or .cse0 .cse5 .cse2 .cse3 .cse7 .cse8 .cse9 .cse12 .cse10) (or .cse1 .cse5 .cse8 .cse12 .cse10))) [2020-07-21 20:57:03,720 INFO L268 CegarLoopResult]: For program point L124-1(line 124) no Hoare annotation was computed. [2020-07-21 20:57:03,722 INFO L268 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2020-07-21 20:57:03,722 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2020-07-21 20:57:03,722 INFO L264 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_dr_st~0)) (.cse3 (not (<= 2 |old(~c_dr_st~0)|))) (.cse7 (not (= 0 ~c_num_read~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse5 (not (= 1 |old(~q_free~0)|))) (.cse9 (not (= 0 |old(~p_num_write~0)|))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse10 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse8 (<= ~p_dw_pc~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (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 .cse2 .cse3 (and .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse6)) (or .cse7 .cse4 .cse8 .cse5 .cse9 .cse2 .cse10 .cse3 .cse11) (or .cse0 .cse8 .cse2 .cse3 .cse11) (or .cse7 .cse0 .cse4 .cse5 .cse9 .cse2 .cse10 (and .cse8 (= 0 ~p_num_write~0) .cse6) .cse11))) [2020-07-21 20:57:03,723 INFO L264 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse7 (= 0 ~q_free~0)) (.cse1 (<= 2 ~c_dr_st~0)) (.cse12 (= 1 ~q_free~0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (not (= 0 ~c_num_read~0))) (.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (= 1 |old(~q_free~0)|))) (.cse10 (not (= 0 |old(~p_num_write~0)|))) (.cse11 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse8 (<= ~p_dw_pc~0 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 .cse4 .cse0 .cse5 .cse6 (and .cse7 .cse8 (= 1 ~p_num_write~0) .cse9) .cse10 .cse2 .cse11 (and .cse8 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0) .cse12 .cse9) .cse13) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse5 .cse6 .cse2 (and .cse7 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse9) .cse3 (and .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse12 .cse9)) (or .cse4 .cse5 .cse8 .cse6 .cse10 .cse2 .cse11 .cse3 .cse13) (or .cse0 .cse8 .cse2 .cse3 .cse13))) [2020-07-21 20:57:03,723 INFO L268 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2020-07-21 20:57:03,723 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-07-21 20:57:03,724 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-21 20:57:03,724 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-07-21 20:57:03,724 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-07-21 20:57:03,724 INFO L264 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (<= 2 ~c_dr_st~0)) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (not (<= 2 |old(~p_dw_st~0)|)) .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) (not (= 1 ~q_free~0)) (<= 2 ~p_dw_st~0) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 (not (= 0 |old(~p_dw_st~0)|)) .cse2 (= 0 ~p_dw_st~0) .cse3) (or .cse1 .cse4 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse3 (not (= 0 ~q_free~0))))) [2020-07-21 20:57:03,725 INFO L268 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2020-07-21 20:57:03,726 INFO L268 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-07-21 20:57:03,727 INFO L268 CegarLoopResult]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2020-07-21 20:57:03,727 INFO L268 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2020-07-21 20:57:03,728 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2020-07-21 20:57:03,728 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (<= 2 ~c_dr_st~0)) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (not (<= 2 |old(~p_dw_st~0)|)) .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) (not (= 1 ~q_free~0)) (<= 2 ~p_dw_st~0) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 (not (= 0 |old(~p_dw_st~0)|)) .cse2 (= 0 ~p_dw_st~0) .cse3) (or .cse1 .cse4 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse3 (not (= 0 ~q_free~0))))) [2020-07-21 20:57:03,729 INFO L264 CegarLoopResult]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse5 (= 0 immediate_notify_threads_~tmp~0)) (.cse11 (<= 2 ~c_dr_st~0)) (.cse12 (= 1 ~p_dw_i~0)) (.cse8 (= 0 ~p_dw_st~0)) (.cse13 (<= ~c_dr_pc~0 0))) (let ((.cse7 (and .cse11 .cse12 .cse8 .cse13)) (.cse1 (not .cse13)) (.cse9 (and .cse11 .cse5)) (.cse0 (not (<= ~p_dw_pc~0 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not .cse12)) (.cse10 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse6 (not (<= 2 |old(~c_dr_st~0)|))) (.cse4 (not (= 0 ~q_free~0)))) (and (or .cse0 (not (= 0 ~c_num_read~0)) .cse1 .cse2 .cse3 (not (= 1 ~p_num_write~0)) .cse4 .cse5) (or .cse1 (not (= 0 |old(~p_dw_st~0)|)) .cse3 .cse6 .cse7) (or .cse2 (not (<= 2 |old(~p_dw_st~0)|)) .cse3 (not (= ~c_num_read~0 ~p_num_write~0)) .cse8 (and (<= 2 ~p_dw_st~0) .cse5) (not (= 1 ~q_free~0)) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse1 .cse3 .cse6 .cse9 .cse7) (or .cse0 .cse1 .cse3 .cse6 .cse5) (or .cse2 .cse3 .cse10 .cse6 .cse9 .cse4 (and .cse11 .cse8)) (or .cse0 .cse2 .cse3 .cse10 .cse6 .cse4 .cse5)))) [2020-07-21 20:57:03,731 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-07-21 20:57:03,731 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-21 20:57:03,731 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 20:57:03,731 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 20:57:03,732 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse19 (not (= 0 |old(~p_num_write~0)|))) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= 0 ~p_num_write~0)) (.cse21 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse26 (<= 2 ~p_dw_st~0)) (.cse23 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse13 (<= ~p_dw_pc~0 0)) (.cse20 (not (<= |old(~p_dw_pc~0)| 0))) (.cse10 (not (= 1 |old(~c_num_read~0)|))) (.cse7 (<= ~c_dr_pc~0 0)) (.cse22 (<= 2 ~c_dr_st~0)) (.cse25 (= ~c_num_read~0 ~p_num_write~0)) (.cse17 (= 1 ~q_free~0)) (.cse18 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (not (= 1 |old(~q_free~0)|))) (.cse24 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse8 (not (= 0 |old(~p_dw_st~0)|))) (.cse6 (not (<= |old(~c_dr_pc~0)| 0))) (.cse15 (= 0 ~p_dw_st~0)) (.cse11 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not (= 1 |old(~p_num_write~0)|))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse5 (not (= 0 |old(~c_num_read~0)|))) (.cse12 (= 1 ~p_num_write~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse9 .cse4 .cse10 .cse11 .cse12) (or (and .cse13 (= 0 ~c_num_read~0) .cse14 .cse15 .cse7 .cse16 .cse17 .cse18) .cse0 .cse8 .cse9 .cse19 .cse4 .cse5 .cse6 .cse20 .cse21) (or .cse0 .cse8 .cse9 .cse19 .cse4 .cse5 .cse11 (and .cse13 .cse14 .cse16) .cse20 .cse21) (or .cse22 .cse0 .cse2 .cse3 .cse4 .cse11 .cse23) (or .cse0 .cse9 .cse2 .cse4 .cse24 (and .cse22 .cse25 .cse17 .cse18 .cse26) .cse11) (or .cse0 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse18 .cse26) .cse2 .cse3 .cse4 .cse23) (or .cse13 .cse8 .cse4 .cse6 .cse11 .cse20) (or .cse0 .cse1 .cse9 .cse2 .cse4 .cse10 .cse11 .cse12) (or .cse4 (and .cse22 .cse7) .cse6 .cse11) (or (and .cse22 .cse25 .cse15 .cse17 .cse18) .cse0 .cse8 .cse9 .cse4 .cse24 .cse11) (or .cse8 .cse4 .cse6 .cse15 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12))) [2020-07-21 20:57:03,732 INFO L264 CegarLoopResult]: At program point L254(line 254) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_dr_st~0)) (.cse15 (= 1 ~p_dw_i~0)) (.cse13 (= 1 ~q_free~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse3 (not (<= |old(~c_dr_pc~0)| 0))) (.cse2 (<= ~c_dr_pc~0 0)) (.cse12 (not (= 0 |old(~p_dw_st~0)|))) (.cse10 (not (= 1 |old(~q_free~0)|))) (.cse8 (and .cse1 .cse15 (= ~c_num_read~0 ~p_num_write~0) .cse13 .cse14)) (.cse11 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (<= 2 |old(~p_dw_st~0)|))) (.cse7 (not (= 0 |old(~q_free~0)|))) (.cse0 (not .cse15)) (.cse4 (not (<= 2 |old(~c_dr_st~0)|))) (.cse9 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse0 .cse9) (or .cse5 .cse10 .cse6 .cse0 .cse11 .cse4) (or .cse5 .cse12 .cse10 .cse8 (not (= 0 |old(~p_num_write~0)|)) .cse0 (not (= 0 |old(~c_num_read~0)|)) .cse3 (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse2 (= 0 ~p_num_write~0) .cse13 .cse14) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse5 .cse12 .cse10 .cse8 .cse0 .cse11 .cse4) (or .cse5 .cse6 .cse7 .cse0 .cse4 .cse9)))) [2020-07-21 20:57:03,732 INFO L268 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-07-21 20:57:03,732 INFO L268 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2020-07-21 20:57:03,732 INFO L268 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-07-21 20:57:03,733 INFO L264 CegarLoopResult]: At program point L238(line 238) the Hoare annotation is: (let ((.cse8 (<= 2 ~c_dr_st~0)) (.cse23 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= 0 ~p_dw_st~0)) (.cse14 (= 1 ~q_free~0)) (.cse9 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse22 (= 1 ~p_dw_i~0)) (.cse15 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (<= 2 ~p_dw_st~0))) (let ((.cse6 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse11 (not (= 0 |old(~p_dw_st~0)|))) (.cse4 (and (= 0 ~q_free~0) .cse9 .cse22 .cse15 .cse24)) (.cse5 (and .cse8 .cse22 .cse23 .cse12 .cse14 .cse15)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse18 (not (<= |old(~c_dr_pc~0)| 0))) (.cse16 (not (= 1 |old(~q_free~0)|))) (.cse21 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse7 (and .cse8 .cse22 .cse23 .cse14 .cse15 .cse24)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse19 (not (= 1 |old(~p_num_write~0)|))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse3 (not .cse22)) (.cse17 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (not (<= 2 |old(~c_dr_st~0)|))) (.cse20 (= 1 ~p_num_write~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse8 .cse9) .cse10 .cse6) (or .cse0 .cse11 (not (= 0 |old(~p_num_write~0)|)) .cse4 (not (<= |old(~p_dw_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse12 .cse13 (= 0 ~p_num_write~0) .cse14 .cse15) .cse16 .cse3 .cse17 .cse18 .cse5 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse7) (or .cse0 .cse19 .cse16 .cse1 .cse3 (not (= 1 |old(~c_num_read~0)|)) .cse10 .cse20) (or .cse0 .cse11 .cse16 .cse4 .cse3 .cse21 .cse5 .cse10 .cse7) (or .cse3 (and .cse8 .cse13) .cse18 .cse10) (or .cse0 .cse16 .cse1 .cse3 .cse21 .cse10 .cse7) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse17 .cse10 .cse20)))) [2020-07-21 20:57:03,734 INFO L264 CegarLoopResult]: At program point L269(line 269) the Hoare annotation is: (let ((.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= 1 ~p_dw_i~0))) (let ((.cse1 (not (= 0 |old(~p_dw_st~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse5 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse8 (not (<= |old(~c_dr_pc~0)| 0))) (.cse6 (not (<= 2 |old(~c_dr_st~0)|))) (.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)|))) (.cse4 (not .cse12)) (.cse3 (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse12 .cse7 (<= 2 ~p_dw_st~0))) (.cse11 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (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) .cse7) .cse0 .cse1 .cse2 (not (= 0 |old(~p_num_write~0)|)) .cse4 .cse3 (not (= 0 |old(~c_num_read~0)|)) .cse8 (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse0 .cse2 .cse9 .cse4 .cse5 .cse6) (or .cse4 .cse8 .cse6) (or .cse0 .cse9 .cse10 .cse4 .cse6 .cse11) (or .cse0 .cse9 .cse10 .cse4 .cse3 .cse11)))) [2020-07-21 20:57:03,734 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2020-07-21 20:57:03,734 INFO L268 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2020-07-21 20:57:03,735 INFO L268 CegarLoopResult]: For program point L247(lines 237 277) no Hoare annotation was computed. [2020-07-21 20:57:03,735 INFO L264 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse8 (<= 2 ~c_dr_st~0)) (.cse23 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= 0 ~p_dw_st~0)) (.cse14 (= 1 ~q_free~0)) (.cse9 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse22 (= 1 ~p_dw_i~0)) (.cse15 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (<= 2 ~p_dw_st~0))) (let ((.cse6 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse11 (not (= 0 |old(~p_dw_st~0)|))) (.cse4 (and (= 0 ~q_free~0) .cse9 .cse22 .cse15 .cse24)) (.cse5 (and .cse8 .cse22 .cse23 .cse12 .cse14 .cse15)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse18 (not (<= |old(~c_dr_pc~0)| 0))) (.cse16 (not (= 1 |old(~q_free~0)|))) (.cse21 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse7 (and .cse8 .cse22 .cse23 .cse14 .cse15 .cse24)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse19 (not (= 1 |old(~p_num_write~0)|))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse3 (not .cse22)) (.cse17 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (not (<= 2 |old(~c_dr_st~0)|))) (.cse20 (= 1 ~p_num_write~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse8 .cse9) .cse10 .cse6) (or .cse0 .cse11 (not (= 0 |old(~p_num_write~0)|)) .cse4 (not (<= |old(~p_dw_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse12 .cse13 (= 0 ~p_num_write~0) .cse14 .cse15) .cse16 .cse3 .cse17 .cse18 .cse5 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse7) (or .cse0 .cse19 .cse16 .cse1 .cse3 (not (= 1 |old(~c_num_read~0)|)) .cse10 .cse20) (or .cse0 .cse11 .cse16 .cse4 .cse3 .cse21 .cse5 .cse10 .cse7) (or .cse3 (and .cse8 .cse13) .cse18 .cse10) (or .cse0 .cse16 .cse1 .cse3 .cse21 .cse10 .cse7) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse17 .cse10 .cse20)))) [2020-07-21 20:57:03,735 INFO L268 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2020-07-21 20:57:03,736 INFO L264 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse8 (<= 2 ~c_dr_st~0)) (.cse23 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= 0 ~p_dw_st~0)) (.cse14 (= 1 ~q_free~0)) (.cse9 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse22 (= 1 ~p_dw_i~0)) (.cse15 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (<= 2 ~p_dw_st~0))) (let ((.cse6 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse11 (not (= 0 |old(~p_dw_st~0)|))) (.cse4 (and (= 0 ~q_free~0) .cse9 .cse22 .cse15 .cse24)) (.cse5 (and .cse8 .cse22 .cse23 .cse12 .cse14 .cse15)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse18 (not (<= |old(~c_dr_pc~0)| 0))) (.cse16 (not (= 1 |old(~q_free~0)|))) (.cse21 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse7 (and .cse8 .cse22 .cse23 .cse14 .cse15 .cse24)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse19 (not (= 1 |old(~p_num_write~0)|))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse3 (not .cse22)) (.cse17 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (not (<= 2 |old(~c_dr_st~0)|))) (.cse20 (= 1 ~p_num_write~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse8 .cse9) .cse10 .cse6) (or .cse0 .cse11 (not (= 0 |old(~p_num_write~0)|)) .cse4 (not (<= |old(~p_dw_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse12 .cse13 (= 0 ~p_num_write~0) .cse14 .cse15) .cse16 .cse3 .cse17 .cse18 .cse5 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse7) (or .cse0 .cse19 .cse16 .cse1 .cse3 (not (= 1 |old(~c_num_read~0)|)) .cse10 .cse20) (or .cse0 .cse11 .cse16 .cse4 .cse3 .cse21 .cse5 .cse10 .cse7) (or .cse3 (and .cse8 .cse13) .cse18 .cse10) (or .cse0 .cse16 .cse1 .cse3 .cse21 .cse10 .cse7) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse17 .cse10 .cse20)))) [2020-07-21 20:57:03,736 INFO L268 CegarLoopResult]: For program point L290-1(line 290) no Hoare annotation was computed. [2020-07-21 20:57:03,736 INFO L271 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: true [2020-07-21 20:57:03,736 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2020-07-21 20:57:03,736 INFO L268 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2020-07-21 20:57:03,736 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2020-07-21 20:57:03,736 INFO L271 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: true [2020-07-21 20:57:03,737 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2020-07-21 20:57:03,737 INFO L264 CegarLoopResult]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse3 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse4 (not (= 1 ~q_free~0))) (.cse6 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~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 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~p_dw_st~0)) .cse6) (or .cse0 .cse1 (not (= 0 ~p_dw_st~0)) .cse2 .cse3 .cse4 .cse5 .cse6) (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) .cse0 .cse1 .cse2 (not (= 1 ~p_num_write~0)) .cse5 (not (= 0 ~q_free~0))) (or .cse0 .cse2 .cse5 (not (<= 2 ~c_dr_st~0))))) [2020-07-21 20:57:03,737 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2020-07-21 20:57:03,737 INFO L268 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2020-07-21 20:57:03,737 INFO L268 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2020-07-21 20:57:03,737 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2020-07-21 20:57:03,738 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2020-07-21 20:57:03,739 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2020-07-21 20:57:03,740 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 20:57:03,741 INFO L268 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2020-07-21 20:57:03,741 INFO L268 CegarLoopResult]: For program point L318(line 318) no Hoare annotation was computed. [2020-07-21 20:57:03,741 INFO L264 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse4 (= 0 ~p_dw_st~0)) (.cse6 (<= ~c_dr_pc~0 0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse5 (= 1 ~q_free~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (<= 2 ~p_dw_st~0))) (or (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse4 .cse6 (= 0 ~p_num_write~0) .cse5 .cse0) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and .cse2 .cse6) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse2 .cse3 .cse5 .cse0 .cse1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 20:57:03,741 INFO L264 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse4 (= 0 ~p_dw_st~0)) (.cse6 (<= ~c_dr_pc~0 0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse5 (= 1 ~q_free~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (<= 2 ~p_dw_st~0))) (or (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse4 .cse6 (= 0 ~p_num_write~0) .cse5 .cse0) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and .cse2 .cse6) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse2 .cse3 .cse5 .cse0 .cse1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 20:57:03,741 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2020-07-21 20:57:03,741 INFO L268 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2020-07-21 20:57:03,742 INFO L264 CegarLoopResult]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse4 (= 0 ~p_dw_st~0)) (.cse6 (<= ~c_dr_pc~0 0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse5 (= 1 ~q_free~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (<= 2 ~p_dw_st~0))) (or (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse4 .cse6 (= 0 ~p_num_write~0) .cse5 .cse0) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and .cse2 .cse6) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse2 .cse3 .cse5 .cse0 .cse1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 20:57:03,742 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 20:57:03,742 INFO L271 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2020-07-21 20:57:03,742 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 20:57:03,742 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 20:57:03,742 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 20:57:03,743 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 20:57:03,743 INFO L268 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2020-07-21 20:57:03,743 INFO L268 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2020-07-21 20:57:03,743 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2020-07-21 20:57:03,743 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2020-07-21 20:57:03,743 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2020-07-21 20:57:03,743 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 20:57:03,743 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2020-07-21 20:57:03,744 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2020-07-21 20:57:03,744 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))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse1 (<= 2 ~c_dr_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 (= 0 ~c_num_read~0) .cse2 .cse3 .cse4) .cse5 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))) (let ((.cse6 (= ~c_num_read~0 ~p_num_write~0))) (or .cse0 (not (<= 2 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) .cse5 (and .cse1 .cse6 .cse4 (<= 2 ~p_dw_st~0)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) (and .cse1 .cse2 .cse6 .cse3 .cse4))))) [2020-07-21 20:57:03,744 INFO L268 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2020-07-21 20:57:03,744 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 1 ~p_dw_i~0)))) (and (or .cse0 (not (<= 2 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) .cse1 (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)|)) .cse1 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))))) [2020-07-21 20:57:03,744 INFO L264 CegarLoopResult]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= 0 |old(~q_free~0)|))) (.cse8 (not (= 1 ~p_dw_i~0))) (.cse9 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (not (<= |old(~c_dr_pc~0)| 0))) (.cse11 (<= ~c_dr_pc~0 0)) (.cse4 (= 1 ~q_free~0))) (and (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse7 (<= 2 ~p_dw_st~0))) (or .cse0 (and .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse7) .cse8 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) (and .cse1 .cse2 .cse4 .cse7))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse8 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse9 .cse10 (and (= 0 ~c_num_read~0) .cse1 .cse3 .cse11 .cse4) (not (= 0 ~p_num_write~0))) (or .cse0 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 (not (= 1 ~p_num_write~0)) .cse4))) [2020-07-21 20:57:03,745 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))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (= 0 |old(~c_num_read~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 (not (= 0 ~p_num_write~0))) (or .cse0 .cse4 .cse5 (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 2 ~p_dw_st~0)) .cse1 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or .cse0 .cse4 .cse5 .cse1 .cse2 .cse3 (not (= 1 ~p_num_write~0))))) [2020-07-21 20:57:03,745 INFO L268 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2020-07-21 20:57:03,745 INFO L268 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2020-07-21 20:57:03,745 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))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (= 0 |old(~c_num_read~0)|))) (.cse3 (not (<= |old(~c_dr_pc~0)| 0))) (.cse4 (<= ~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 (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse4 (= 1 ~q_free~0)) (not (= 0 ~p_num_write~0))) (or .cse0 .cse5 .cse6 (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 2 ~p_dw_st~0)) .cse1 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or .cse0 .cse5 .cse6 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0))))) [2020-07-21 20:57:03,745 INFO L268 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2020-07-21 20:57:03,745 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 1 ~p_dw_i~0)))) (and (or .cse0 (not (<= 2 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) .cse1 (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)|)) .cse1 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))))) [2020-07-21 20:57:03,745 INFO L268 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2020-07-21 20:57:03,746 INFO L268 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2020-07-21 20:57:03,746 INFO L264 CegarLoopResult]: At program point L169(line 169) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (= 0 |old(~c_num_read~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 (not (= 0 ~p_num_write~0))) (or .cse0 .cse4 .cse5 .cse1 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) (and (= ~c_last_read~0 ~p_last_write~0) (= ~c_num_read~0 ~p_num_write~0) (= 1 ~q_free~0) (<= 2 ~p_dw_st~0))) (or .cse0 .cse4 .cse5 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0 0) (not (= 1 ~p_num_write~0))))) [2020-07-21 20:57:03,746 INFO L268 CegarLoopResult]: For program point L169-1(line 169) no Hoare annotation was computed. [2020-07-21 20:57:03,746 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2020-07-21 20:57:03,746 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2020-07-21 20:57:03,746 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 20:57:03,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:57:03 BoogieIcfgContainer [2020-07-21 20:57:03,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 20:57:03,842 INFO L168 Benchmark]: Toolchain (without parser) took 21069.14 ms. Allocated memory was 136.3 MB in the beginning and 494.4 MB in the end (delta: 358.1 MB). Free memory was 100.4 MB in the beginning and 314.7 MB in the end (delta: -214.3 MB). Peak memory consumption was 380.2 MB. Max. memory is 7.1 GB. [2020-07-21 20:57:03,843 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-21 20:57:03,843 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.88 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 179.2 MB in the end (delta: -79.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2020-07-21 20:57:03,844 INFO L168 Benchmark]: Boogie Preprocessor took 43.98 ms. Allocated memory is still 200.3 MB. Free memory was 179.2 MB in the beginning and 176.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-21 20:57:03,846 INFO L168 Benchmark]: RCFGBuilder took 528.46 ms. Allocated memory is still 200.3 MB. Free memory was 176.6 MB in the beginning and 150.1 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2020-07-21 20:57:03,847 INFO L168 Benchmark]: TraceAbstraction took 20039.28 ms. Allocated memory was 200.3 MB in the beginning and 494.4 MB in the end (delta: 294.1 MB). Free memory was 149.4 MB in the beginning and 314.7 MB in the end (delta: -165.3 MB). Peak memory consumption was 365.2 MB. Max. memory is 7.1 GB. [2020-07-21 20:57:03,850 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.48 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 450.88 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 179.2 MB in the end (delta: -79.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.98 ms. Allocated memory is still 200.3 MB. Free memory was 179.2 MB in the beginning and 176.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 528.46 ms. Allocated memory is still 200.3 MB. Free memory was 176.6 MB in the beginning and 150.1 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20039.28 ms. Allocated memory was 200.3 MB in the beginning and 494.4 MB in the end (delta: 294.1 MB). Free memory was 149.4 MB in the beginning and 314.7 MB in the end (delta: -165.3 MB). Peak memory consumption was 365.2 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: (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 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)) || ((!(c_num_read == \old(p_num_write)) && 2 <= c_dr_st) && c_num_read + 1 == p_num_write)) || !(2 <= \old(c_dr_st))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) || (((((((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)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(\old(c_last_read) == \old(p_last_write))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 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))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(\old(c_num_read) == \old(p_num_write))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_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(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 == 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))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write) - 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))) || !(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))) || ((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(p_num_write == \old(c_num_read) + 1))) && ((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(1 == p_num_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((!(c_dr_pc <= 0) || 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))) && ((((((!(c_num_read == \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || ((0 == q_free && c_num_read + 1 == p_num_write) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || (((2 <= c_dr_st && c_num_read == p_num_write) && 1 == q_free) && p_last_write == q_buf_0))) && ((((((((!(0 == c_num_read) || !(\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_dr_pc <= 0) || p_dw_pc <= 0) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((!(p_last_write == q_buf_0) || (((c_last_read == p_last_write && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || ((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(p_num_write == \old(c_num_read) + 1)) || (((c_last_read == p_last_write && c_num_read == p_num_write) && 1 == q_free) && 2 <= p_dw_st)) && (((((((((!(p_dw_pc <= 0) || !(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 == c_num_read && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc <= 0) && 1 == q_free)) || !(0 == p_num_write))) && ((((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || c_dr_pc <= 0) || !(1 == 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: (((((((((((((((0 == q_free && c_num_read + 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) || ((((2 <= c_dr_st && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || (((((((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: (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 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)) || ((!(c_num_read == \old(p_num_write)) && 2 <= c_dr_st) && c_num_read + 1 == p_num_write)) || !(2 <= \old(c_dr_st))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) || (((((((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)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(\old(c_last_read) == \old(p_last_write))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 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))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(\old(c_num_read) == \old(p_num_write))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_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(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 == 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))) || !(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 == 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)) || !(1 == p_dw_i)) || !(c_num_read == p_num_write)) || !(1 == q_free)) || 0 == __retres1) || !(2 <= p_dw_st)) || !(c_last_read == p_last_write)) && (((((((!(c_dr_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(c_num_read == p_num_write)) || !(1 == q_free)) || 0 == __retres1) || !(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))) || ((((2 <= c_dr_st && 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)) && ((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || (((2 <= c_dr_st && c_num_read == p_num_write) && 1 == q_free) && 2 <= p_dw_st)) || !(p_num_write == \old(c_num_read) + 1)) || ((((2 <= c_dr_st && c_last_read == p_last_write) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((!(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 == 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))) && ((((!(c_dr_pc <= 0) || p_dw_pc <= 0) || !(1 == p_dw_i)) || !(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.0s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1978 SDtfs, 1884 SDslu, 2364 SDs, 0 SdLazy, 1563 SolverSat, 403 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1231 GetRequests, 1189 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2907occurred in iteration=10, 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, 12 MinimizatonAttempts, 456 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3365 PreInvPairs, 3807 NumberOfFragments, 5077 HoareAnnotationTreeSize, 3365 FomulaSimplifications, 6562 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 45 FomulaSimplificationsInter, 13837 FormulaSimplificationTreeSizeReductionInter, 8.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1030 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1213 ConstructedInterpolants, 0 QuantifiedInterpolants, 217407 SizeOfPredicates, 18 NumberOfNonLiveVariables, 3443 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 234/278 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...