/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_VARIABLES --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 17:20:51,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 17:20:51,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 17:20:51,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 17:20:51,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 17:20:51,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 17:20:51,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 17:20:51,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 17:20:51,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 17:20:51,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 17:20:51,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 17:20:51,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 17:20:51,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 17:20:51,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 17:20:51,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 17:20:51,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 17:20:51,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 17:20:51,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 17:20:51,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 17:20:51,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 17:20:51,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 17:20:51,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 17:20:51,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 17:20:51,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 17:20:51,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 17:20:51,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 17:20:51,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 17:20:51,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 17:20:51,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 17:20:51,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 17:20:51,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 17:20:51,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 17:20:51,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 17:20:51,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 17:20:51,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 17:20:51,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 17:20:51,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 17:20:51,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 17:20:51,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 17:20:51,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 17:20:51,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 17:20:51,714 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 17:20:51,729 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 17:20:51,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 17:20:51,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 17:20:51,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 17:20:51,731 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 17:20:51,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 17:20:51,731 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 17:20:51,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 17:20:51,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 17:20:51,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 17:20:51,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 17:20:51,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 17:20:51,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 17:20:51,733 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 17:20:51,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 17:20:51,733 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 17:20:51,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 17:20:51,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 17:20:51,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 17:20:51,734 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 17:20:51,734 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 17:20:51,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 17:20:51,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 17:20:51,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 17:20:51,735 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 17:20:51,735 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 17:20:51,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:20:51,736 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 17:20:51,736 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 17:20:51,736 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES 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 17:20:52,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 17:20:52,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 17:20:52,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 17:20:52,034 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 17:20:52,035 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 17:20:52,037 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 17:20:52,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7e8fffc/e262d7efb6e2408c9a1f634543758a84/FLAGb27484a48 [2020-07-21 17:20:52,635 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 17:20:52,636 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-21 17:20:52,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7e8fffc/e262d7efb6e2408c9a1f634543758a84/FLAGb27484a48 [2020-07-21 17:20:52,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7e8fffc/e262d7efb6e2408c9a1f634543758a84 [2020-07-21 17:20:52,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 17:20:52,983 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 17:20:52,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 17:20:52,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 17:20:52,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 17:20:52,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:20:52" (1/1) ... [2020-07-21 17:20:52,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564a53f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:20:52, skipping insertion in model container [2020-07-21 17:20:52,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:20:52" (1/1) ... [2020-07-21 17:20:53,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 17:20:53,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 17:20:53,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 17:20:53,250 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 17:20:53,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 17:20:53,300 INFO L208 MainTranslator]: Completed translation [2020-07-21 17:20:53,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:20:53 WrapperNode [2020-07-21 17:20:53,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 17:20:53,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 17:20:53,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 17:20:53,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 17:20:53,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:20:53" (1/1) ... [2020-07-21 17:20:53,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:20:53" (1/1) ... [2020-07-21 17:20:53,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:20:53" (1/1) ... [2020-07-21 17:20:53,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:20:53" (1/1) ... [2020-07-21 17:20:53,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:20:53" (1/1) ... [2020-07-21 17:20:53,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:20:53" (1/1) ... [2020-07-21 17:20:53,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:20:53" (1/1) ... [2020-07-21 17:20:53,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 17:20:53,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 17:20:53,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 17:20:53,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 17:20:53,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:20:53" (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 17:20:53,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 17:20:53,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 17:20:53,493 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-21 17:20:53,493 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-07-21 17:20:53,494 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-07-21 17:20:53,494 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-07-21 17:20:53,494 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-07-21 17:20:53,494 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-07-21 17:20:53,494 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-21 17:20:53,494 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-21 17:20:53,495 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-21 17:20:53,495 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-21 17:20:53,495 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-21 17:20:53,495 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-21 17:20:53,495 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 17:20:53,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 17:20:53,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 17:20:53,496 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-21 17:20:53,496 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-07-21 17:20:53,496 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-07-21 17:20:53,496 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-07-21 17:20:53,496 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-07-21 17:20:53,496 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-07-21 17:20:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-21 17:20:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-21 17:20:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-21 17:20:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-21 17:20:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-21 17:20:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-21 17:20:53,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 17:20:53,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 17:20:53,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 17:20:53,988 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 17:20:53,988 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-21 17:20:53,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:20:53 BoogieIcfgContainer [2020-07-21 17:20:53,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 17:20:53,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 17:20:53,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 17:20:53,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 17:20:53,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:20:52" (1/3) ... [2020-07-21 17:20:54,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0a44a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:20:53, skipping insertion in model container [2020-07-21 17:20:54,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:20:53" (2/3) ... [2020-07-21 17:20:54,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0a44a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:20:54, skipping insertion in model container [2020-07-21 17:20:54,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:20:53" (3/3) ... [2020-07-21 17:20:54,002 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-07-21 17:20:54,010 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 17:20:54,018 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 17:20:54,028 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 17:20:54,053 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 17:20:54,053 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 17:20:54,053 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 17:20:54,053 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 17:20:54,054 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 17:20:54,054 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 17:20:54,054 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 17:20:54,054 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 17:20:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2020-07-21 17:20:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 17:20:54,083 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:20:54,084 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 17:20:54,085 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:20:54,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:20:54,090 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2020-07-21 17:20:54,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:20:54,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [293059528] [2020-07-21 17:20:54,097 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 17:20:54,316 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:20:54,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:20:54,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 17:20:54,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:20:54,398 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 17:20:54,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:20:54,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [293059528] [2020-07-21 17:20:54,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:20:54,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:20:54,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858043377] [2020-07-21 17:20:54,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:20:54,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:20:54,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:20:54,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:20:54,426 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2020-07-21 17:20:54,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:20:54,519 INFO L93 Difference]: Finished difference Result 279 states and 392 transitions. [2020-07-21 17:20:54,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:20:54,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-21 17:20:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:20:54,537 INFO L225 Difference]: With dead ends: 279 [2020-07-21 17:20:54,538 INFO L226 Difference]: Without dead ends: 175 [2020-07-21 17:20:54,544 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 17:20:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-07-21 17:20:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2020-07-21 17:20:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-07-21 17:20:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 219 transitions. [2020-07-21 17:20:54,634 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 219 transitions. Word has length 65 [2020-07-21 17:20:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:20:54,635 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 219 transitions. [2020-07-21 17:20:54,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:20:54,635 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 219 transitions. [2020-07-21 17:20:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 17:20:54,640 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:20:54,641 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 17:20:54,852 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:20:54,852 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:20:54,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:20:54,854 INFO L82 PathProgramCache]: Analyzing trace with hash -478691660, now seen corresponding path program 1 times [2020-07-21 17:20:54,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:20:54,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [661012652] [2020-07-21 17:20:54,855 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 17:20:55,017 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:20:55,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:20:55,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 17:20:55,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:20:55,060 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 17:20:55,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:20:55,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [661012652] [2020-07-21 17:20:55,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:20:55,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:20:55,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041854275] [2020-07-21 17:20:55,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:20:55,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:20:55,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:20:55,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:20:55,066 INFO L87 Difference]: Start difference. First operand 171 states and 219 transitions. Second operand 3 states. [2020-07-21 17:20:55,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:20:55,139 INFO L93 Difference]: Finished difference Result 468 states and 631 transitions. [2020-07-21 17:20:55,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:20:55,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-21 17:20:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:20:55,145 INFO L225 Difference]: With dead ends: 468 [2020-07-21 17:20:55,146 INFO L226 Difference]: Without dead ends: 314 [2020-07-21 17:20:55,148 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 17:20:55,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-07-21 17:20:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2020-07-21 17:20:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-07-21 17:20:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 412 transitions. [2020-07-21 17:20:55,194 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 412 transitions. Word has length 65 [2020-07-21 17:20:55,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:20:55,197 INFO L479 AbstractCegarLoop]: Abstraction has 310 states and 412 transitions. [2020-07-21 17:20:55,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:20:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 412 transitions. [2020-07-21 17:20:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 17:20:55,205 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:20:55,205 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 17:20:55,412 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:20:55,414 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:20:55,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:20:55,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1988256317, now seen corresponding path program 1 times [2020-07-21 17:20:55,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:20:55,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [837337848] [2020-07-21 17:20:55,416 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 17:20:55,527 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:20:55,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:20:55,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 17:20:55,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:20:55,574 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 17:20:55,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:20:55,575 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [837337848] [2020-07-21 17:20:55,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:20:55,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:20:55,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792985015] [2020-07-21 17:20:55,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:20:55,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:20:55,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:20:55,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:20:55,578 INFO L87 Difference]: Start difference. First operand 310 states and 412 transitions. Second operand 3 states. [2020-07-21 17:20:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:20:55,679 INFO L93 Difference]: Finished difference Result 882 states and 1239 transitions. [2020-07-21 17:20:55,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:20:55,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-21 17:20:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:20:55,700 INFO L225 Difference]: With dead ends: 882 [2020-07-21 17:20:55,700 INFO L226 Difference]: Without dead ends: 592 [2020-07-21 17:20:55,710 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 17:20:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-07-21 17:20:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 588. [2020-07-21 17:20:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-07-21 17:20:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 791 transitions. [2020-07-21 17:20:55,797 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 791 transitions. Word has length 66 [2020-07-21 17:20:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:20:55,797 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 791 transitions. [2020-07-21 17:20:55,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:20:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 791 transitions. [2020-07-21 17:20:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 17:20:55,802 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:20:55,802 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 17:20:56,016 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:20:56,017 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:20:56,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:20:56,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2101642974, now seen corresponding path program 1 times [2020-07-21 17:20:56,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:20:56,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1205713349] [2020-07-21 17:20:56,019 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 17:20:56,141 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:20:56,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:20:56,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-21 17:20:56,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:20:56,191 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 17:20:56,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:20:56,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1205713349] [2020-07-21 17:20:56,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:20:56,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:20:56,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705616719] [2020-07-21 17:20:56,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:20:56,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:20:56,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:20:56,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:20:56,195 INFO L87 Difference]: Start difference. First operand 588 states and 791 transitions. Second operand 3 states. [2020-07-21 17:20:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:20:56,264 INFO L93 Difference]: Finished difference Result 1301 states and 1786 transitions. [2020-07-21 17:20:56,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:20:56,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-21 17:20:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:20:56,271 INFO L225 Difference]: With dead ends: 1301 [2020-07-21 17:20:56,272 INFO L226 Difference]: Without dead ends: 802 [2020-07-21 17:20:56,294 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 17:20:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2020-07-21 17:20:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 673. [2020-07-21 17:20:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2020-07-21 17:20:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 907 transitions. [2020-07-21 17:20:56,372 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 907 transitions. Word has length 66 [2020-07-21 17:20:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:20:56,372 INFO L479 AbstractCegarLoop]: Abstraction has 673 states and 907 transitions. [2020-07-21 17:20:56,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:20:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 907 transitions. [2020-07-21 17:20:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-21 17:20:56,376 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:20:56,376 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:20:56,591 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:20:56,592 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:20:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:20:56,593 INFO L82 PathProgramCache]: Analyzing trace with hash 373415101, now seen corresponding path program 1 times [2020-07-21 17:20:56,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:20:56,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1195569643] [2020-07-21 17:20:56,594 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 17:20:56,677 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:20:56,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:20:56,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 17:20:56,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:20:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:20:56,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:20:56,703 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1195569643] [2020-07-21 17:20:56,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:20:56,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:20:56,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171079819] [2020-07-21 17:20:56,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:20:56,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:20:56,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:20:56,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:20:56,711 INFO L87 Difference]: Start difference. First operand 673 states and 907 transitions. Second operand 3 states. [2020-07-21 17:20:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:20:56,794 INFO L93 Difference]: Finished difference Result 1545 states and 2227 transitions. [2020-07-21 17:20:56,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:20:56,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-07-21 17:20:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:20:56,804 INFO L225 Difference]: With dead ends: 1545 [2020-07-21 17:20:56,804 INFO L226 Difference]: Without dead ends: 892 [2020-07-21 17:20:56,810 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 17:20:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2020-07-21 17:20:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2020-07-21 17:20:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2020-07-21 17:20:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1229 transitions. [2020-07-21 17:20:56,876 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1229 transitions. Word has length 86 [2020-07-21 17:20:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:20:56,878 INFO L479 AbstractCegarLoop]: Abstraction has 892 states and 1229 transitions. [2020-07-21 17:20:56,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:20:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1229 transitions. [2020-07-21 17:20:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-07-21 17:20:56,884 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:20:56,885 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:20:57,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:20:57,098 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:20:57,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:20:57,099 INFO L82 PathProgramCache]: Analyzing trace with hash 982228556, now seen corresponding path program 1 times [2020-07-21 17:20:57,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:20:57,101 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [803719594] [2020-07-21 17:20:57,102 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 17:20:57,209 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:20:57,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:20:57,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 17:20:57,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:20:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-07-21 17:20:57,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:20:57,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [803719594] [2020-07-21 17:20:57,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:20:57,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:20:57,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618441476] [2020-07-21 17:20:57,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:20:57,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:20:57,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:20:57,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:20:57,271 INFO L87 Difference]: Start difference. First operand 892 states and 1229 transitions. Second operand 3 states. [2020-07-21 17:20:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:20:57,321 INFO L93 Difference]: Finished difference Result 1667 states and 2281 transitions. [2020-07-21 17:20:57,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:20:57,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2020-07-21 17:20:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:20:57,328 INFO L225 Difference]: With dead ends: 1667 [2020-07-21 17:20:57,328 INFO L226 Difference]: Without dead ends: 794 [2020-07-21 17:20:57,334 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 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 17:20:57,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2020-07-21 17:20:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2020-07-21 17:20:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-07-21 17:20:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1072 transitions. [2020-07-21 17:20:57,388 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1072 transitions. Word has length 151 [2020-07-21 17:20:57,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:20:57,388 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 1072 transitions. [2020-07-21 17:20:57,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:20:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1072 transitions. [2020-07-21 17:20:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-07-21 17:20:57,392 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:20:57,392 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 17:20:57,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:20:57,607 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:20:57,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:20:57,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1973930899, now seen corresponding path program 1 times [2020-07-21 17:20:57,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:20:57,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1047174959] [2020-07-21 17:20:57,608 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 17:20:57,707 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:20:57,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:20:57,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 17:20:57,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:20:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-07-21 17:20:57,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:20:57,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1047174959] [2020-07-21 17:20:57,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:20:57,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 17:20:57,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071358404] [2020-07-21 17:20:57,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 17:20:57,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:20:57,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 17:20:57,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:20:57,759 INFO L87 Difference]: Start difference. First operand 794 states and 1072 transitions. Second operand 6 states. [2020-07-21 17:20:57,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:20:57,832 INFO L93 Difference]: Finished difference Result 1585 states and 2159 transitions. [2020-07-21 17:20:57,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 17:20:57,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2020-07-21 17:20:57,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:20:57,839 INFO L225 Difference]: With dead ends: 1585 [2020-07-21 17:20:57,839 INFO L226 Difference]: Without dead ends: 810 [2020-07-21 17:20:57,843 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 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 17:20:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2020-07-21 17:20:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 804. [2020-07-21 17:20:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-07-21 17:20:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1076 transitions. [2020-07-21 17:20:57,920 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1076 transitions. Word has length 148 [2020-07-21 17:20:57,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:20:57,921 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 1076 transitions. [2020-07-21 17:20:57,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 17:20:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1076 transitions. [2020-07-21 17:20:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-07-21 17:20:57,925 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:20:57,925 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 17:20:58,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:20:58,140 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:20:58,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:20:58,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1734760175, now seen corresponding path program 1 times [2020-07-21 17:20:58,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:20:58,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [169718545] [2020-07-21 17:20:58,141 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 17:20:58,241 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:20:58,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:20:58,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 17:20:58,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:20:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-07-21 17:20:58,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 17:20:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-07-21 17:20:58,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [169718545] [2020-07-21 17:20:58,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-21 17:20:58,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2020-07-21 17:20:58,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230525301] [2020-07-21 17:20:58,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-21 17:20:58,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:20:58,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-21 17:20:58,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-21 17:20:58,399 INFO L87 Difference]: Start difference. First operand 804 states and 1076 transitions. Second operand 4 states. [2020-07-21 17:20:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:20:58,547 INFO L93 Difference]: Finished difference Result 877 states and 1205 transitions. [2020-07-21 17:20:58,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-21 17:20:58,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2020-07-21 17:20:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:20:58,554 INFO L225 Difference]: With dead ends: 877 [2020-07-21 17:20:58,554 INFO L226 Difference]: Without dead ends: 874 [2020-07-21 17:20:58,556 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 294 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 17:20:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2020-07-21 17:20:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 805. [2020-07-21 17:20:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-07-21 17:20:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1076 transitions. [2020-07-21 17:20:58,621 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1076 transitions. Word has length 148 [2020-07-21 17:20:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:20:58,622 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 1076 transitions. [2020-07-21 17:20:58,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-21 17:20:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1076 transitions. [2020-07-21 17:20:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-07-21 17:20:58,627 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:20:58,627 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 17:20:58,841 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:20:58,842 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:20:58,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:20:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2056705100, now seen corresponding path program 1 times [2020-07-21 17:20:58,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:20:58,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1951810444] [2020-07-21 17:20:58,844 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 17:20:59,002 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:20:59,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:20:59,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 17:20:59,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:20:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-21 17:20:59,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:20:59,052 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1951810444] [2020-07-21 17:20:59,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:20:59,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 17:20:59,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740049975] [2020-07-21 17:20:59,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 17:20:59,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:20:59,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 17:20:59,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:20:59,054 INFO L87 Difference]: Start difference. First operand 805 states and 1076 transitions. Second operand 6 states. [2020-07-21 17:20:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:20:59,137 INFO L93 Difference]: Finished difference Result 1597 states and 2196 transitions. [2020-07-21 17:20:59,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 17:20:59,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2020-07-21 17:20:59,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:20:59,143 INFO L225 Difference]: With dead ends: 1597 [2020-07-21 17:20:59,143 INFO L226 Difference]: Without dead ends: 811 [2020-07-21 17:20:59,147 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-21 17:20:59,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-07-21 17:20:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 744. [2020-07-21 17:20:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2020-07-21 17:20:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 947 transitions. [2020-07-21 17:20:59,191 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 947 transitions. Word has length 149 [2020-07-21 17:20:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:20:59,192 INFO L479 AbstractCegarLoop]: Abstraction has 744 states and 947 transitions. [2020-07-21 17:20:59,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 17:20:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 947 transitions. [2020-07-21 17:20:59,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-21 17:20:59,195 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:20:59,195 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:20:59,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:20:59,411 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:20:59,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:20:59,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1565088270, now seen corresponding path program 1 times [2020-07-21 17:20:59,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:20:59,413 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1246389056] [2020-07-21 17:20:59,413 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 17:20:59,509 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:20:59,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:20:59,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 17:20:59,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:20:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-21 17:20:59,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:20:59,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1246389056] [2020-07-21 17:20:59,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:20:59,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 17:20:59,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523512505] [2020-07-21 17:20:59,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 17:20:59,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:20:59,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 17:20:59,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:20:59,546 INFO L87 Difference]: Start difference. First operand 744 states and 947 transitions. Second operand 6 states. [2020-07-21 17:20:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:20:59,607 INFO L93 Difference]: Finished difference Result 1473 states and 1955 transitions. [2020-07-21 17:20:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 17:20:59,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2020-07-21 17:20:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:20:59,612 INFO L225 Difference]: With dead ends: 1473 [2020-07-21 17:20:59,612 INFO L226 Difference]: Without dead ends: 814 [2020-07-21 17:20:59,617 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 17:20:59,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2020-07-21 17:20:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 794. [2020-07-21 17:20:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-07-21 17:20:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 997 transitions. [2020-07-21 17:20:59,661 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 997 transitions. Word has length 99 [2020-07-21 17:20:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:20:59,662 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 997 transitions. [2020-07-21 17:20:59,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 17:20:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 997 transitions. [2020-07-21 17:20:59,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-21 17:20:59,665 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:20:59,665 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 17:20:59,878 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:20:59,879 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:20:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:20:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1191538996, now seen corresponding path program 1 times [2020-07-21 17:20:59,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:20:59,880 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [344668463] [2020-07-21 17:20:59,880 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 17:21:00,006 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:21:00,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:00,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 17:21:00,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 17:21:00,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:00,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [344668463] [2020-07-21 17:21:00,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:00,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 17:21:00,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112856496] [2020-07-21 17:21:00,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 17:21:00,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:00,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 17:21:00,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:21:00,044 INFO L87 Difference]: Start difference. First operand 794 states and 997 transitions. Second operand 6 states. [2020-07-21 17:21:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:00,103 INFO L93 Difference]: Finished difference Result 1431 states and 1849 transitions. [2020-07-21 17:21:00,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 17:21:00,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2020-07-21 17:21:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:00,108 INFO L225 Difference]: With dead ends: 1431 [2020-07-21 17:21:00,108 INFO L226 Difference]: Without dead ends: 699 [2020-07-21 17:21:00,112 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 17:21:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2020-07-21 17:21:00,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 693. [2020-07-21 17:21:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2020-07-21 17:21:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 853 transitions. [2020-07-21 17:21:00,149 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 853 transitions. Word has length 99 [2020-07-21 17:21:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:00,149 INFO L479 AbstractCegarLoop]: Abstraction has 693 states and 853 transitions. [2020-07-21 17:21:00,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 17:21:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 853 transitions. [2020-07-21 17:21:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-07-21 17:21:00,152 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:00,152 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:21:00,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:00,366 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:00,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:00,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1611389462, now seen corresponding path program 1 times [2020-07-21 17:21:00,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:00,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1931366661] [2020-07-21 17:21:00,368 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 17:21:00,486 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:21:00,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:00,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 17:21:00,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 17:21:00,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:00,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1931366661] [2020-07-21 17:21:00,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:00,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:21:00,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127960821] [2020-07-21 17:21:00,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:21:00,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:00,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:21:00,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:21:00,523 INFO L87 Difference]: Start difference. First operand 693 states and 853 transitions. Second operand 3 states. [2020-07-21 17:21:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:00,588 INFO L93 Difference]: Finished difference Result 1206 states and 1510 transitions. [2020-07-21 17:21:00,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:21:00,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2020-07-21 17:21:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:00,598 INFO L225 Difference]: With dead ends: 1206 [2020-07-21 17:21:00,598 INFO L226 Difference]: Without dead ends: 706 [2020-07-21 17:21:00,601 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:21:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2020-07-21 17:21:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 693. [2020-07-21 17:21:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2020-07-21 17:21:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 851 transitions. [2020-07-21 17:21:00,636 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 851 transitions. Word has length 119 [2020-07-21 17:21:00,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:00,637 INFO L479 AbstractCegarLoop]: Abstraction has 693 states and 851 transitions. [2020-07-21 17:21:00,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:21:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 851 transitions. [2020-07-21 17:21:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-21 17:21:00,639 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:00,640 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 17:21:00,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:00,854 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:00,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:00,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2020-07-21 17:21:00,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:00,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [708915376] [2020-07-21 17:21:00,855 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:00,990 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:21:00,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:00,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-21 17:21:00,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:01,098 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 17:21:01,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 17:21:01,306 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 17:21:01,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [708915376] [2020-07-21 17:21:01,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 17:21:01,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2020-07-21 17:21:01,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261485009] [2020-07-21 17:21:01,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 17:21:01,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:01,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 17:21:01,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-21 17:21:01,310 INFO L87 Difference]: Start difference. First operand 693 states and 851 transitions. Second operand 12 states. [2020-07-21 17:21:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:03,354 INFO L93 Difference]: Finished difference Result 2906 states and 4430 transitions. [2020-07-21 17:21:03,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-21 17:21:03,355 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2020-07-21 17:21:03,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:03,380 INFO L225 Difference]: With dead ends: 2906 [2020-07-21 17:21:03,380 INFO L226 Difference]: Without dead ends: 2903 [2020-07-21 17:21:03,383 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2020-07-21 17:21:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-07-21 17:21:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2730. [2020-07-21 17:21:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2020-07-21 17:21:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 4048 transitions. [2020-07-21 17:21:03,605 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 4048 transitions. Word has length 99 [2020-07-21 17:21:03,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:03,606 INFO L479 AbstractCegarLoop]: Abstraction has 2730 states and 4048 transitions. [2020-07-21 17:21:03,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 17:21:03,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 4048 transitions. [2020-07-21 17:21:03,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-21 17:21:03,613 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:03,613 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:21:03,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:03,829 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:03,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:03,829 INFO L82 PathProgramCache]: Analyzing trace with hash 83738947, now seen corresponding path program 2 times [2020-07-21 17:21:03,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:03,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1596439898] [2020-07-21 17:21:03,830 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:03,941 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:21:03,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:03,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 17:21:03,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-21 17:21:04,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:04,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1596439898] [2020-07-21 17:21:04,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:04,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:21:04,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369961135] [2020-07-21 17:21:04,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:21:04,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:04,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:21:04,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:21:04,037 INFO L87 Difference]: Start difference. First operand 2730 states and 4048 transitions. Second operand 3 states. [2020-07-21 17:21:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:04,169 INFO L93 Difference]: Finished difference Result 4216 states and 6542 transitions. [2020-07-21 17:21:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:21:04,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-07-21 17:21:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:04,184 INFO L225 Difference]: With dead ends: 4216 [2020-07-21 17:21:04,185 INFO L226 Difference]: Without dead ends: 2123 [2020-07-21 17:21:04,212 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:21:04,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2020-07-21 17:21:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2067. [2020-07-21 17:21:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2067 states. [2020-07-21 17:21:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2857 transitions. [2020-07-21 17:21:04,356 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2857 transitions. Word has length 125 [2020-07-21 17:21:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:04,356 INFO L479 AbstractCegarLoop]: Abstraction has 2067 states and 2857 transitions. [2020-07-21 17:21:04,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:21:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2857 transitions. [2020-07-21 17:21:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-07-21 17:21:04,362 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:04,362 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:21:04,576 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:04,577 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:04,578 INFO L82 PathProgramCache]: Analyzing trace with hash 870523271, now seen corresponding path program 1 times [2020-07-21 17:21:04,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:04,578 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [8664329] [2020-07-21 17:21:04,579 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:04,717 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:21:04,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:04,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 17:21:04,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-21 17:21:04,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:04,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [8664329] [2020-07-21 17:21:04,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:04,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:21:04,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732597289] [2020-07-21 17:21:04,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:21:04,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:04,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:21:04,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:21:04,751 INFO L87 Difference]: Start difference. First operand 2067 states and 2857 transitions. Second operand 3 states. [2020-07-21 17:21:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:04,802 INFO L93 Difference]: Finished difference Result 2655 states and 3671 transitions. [2020-07-21 17:21:04,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:21:04,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2020-07-21 17:21:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:04,804 INFO L225 Difference]: With dead ends: 2655 [2020-07-21 17:21:04,804 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 17:21:04,821 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:21:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 17:21:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 17:21:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 17:21:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 17:21:04,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2020-07-21 17:21:04,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:04,822 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 17:21:04,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:21:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 17:21:04,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 17:21:05,036 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:05,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 17:21:07,168 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2020-07-21 17:21:07,447 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2020-07-21 17:21:07,586 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-07-21 17:21:07,961 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-07-21 17:21:08,272 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2020-07-21 17:21:08,776 WARN L193 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2020-07-21 17:21:09,147 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2020-07-21 17:21:09,374 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 38 [2020-07-21 17:21:09,562 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2020-07-21 17:21:10,689 WARN L193 SmtUtils]: Spent 968.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2020-07-21 17:21:10,968 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2020-07-21 17:21:11,383 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-07-21 17:21:11,574 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 43 [2020-07-21 17:21:12,426 WARN L193 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2020-07-21 17:21:13,078 WARN L193 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2020-07-21 17:21:13,545 WARN L193 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2020-07-21 17:21:13,932 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2020-07-21 17:21:14,038 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-07-21 17:21:14,458 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2020-07-21 17:21:15,459 WARN L193 SmtUtils]: Spent 961.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2020-07-21 17:21:15,621 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-07-21 17:21:15,931 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2020-07-21 17:21:16,298 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2020-07-21 17:21:16,645 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2020-07-21 17:21:16,918 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2020-07-21 17:21:17,144 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2020-07-21 17:21:17,149 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2020-07-21 17:21:17,149 INFO L268 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2020-07-21 17:21:17,149 INFO L268 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2020-07-21 17:21:17,149 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2020-07-21 17:21:17,150 INFO L264 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse4 (not (= 1 ~q_free~0))) (.cse6 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse5 (not (<= 2 ~c_dr_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~c_num_read~0 ~p_num_write~0)) .cse4 .cse5) (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) .cse6 .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse6 .cse0 .cse1 .cse2 .cse3 .cse5))) [2020-07-21 17:21:17,150 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2020-07-21 17:21:17,150 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2020-07-21 17:21:17,150 INFO L268 CegarLoopResult]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2020-07-21 17:21:17,150 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 17:21:17,150 INFO L268 CegarLoopResult]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2020-07-21 17:21:17,150 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 17:21:17,150 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 17:21:17,151 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2020-07-21 17:21:17,151 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2020-07-21 17:21:17,151 INFO L268 CegarLoopResult]: For program point L355(line 355) no Hoare annotation was computed. [2020-07-21 17:21:17,151 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 17:21:17,151 INFO L264 CegarLoopResult]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse6 (not (<= 2 |old(~c_dr_st~0)|))) (.cse7 (not (<= ~c_dr_pc~0 0))) (.cse3 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (not (= 1 |old(~q_free~0)|))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse0 (= 0 ~q_free~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (<= 2 ~p_dw_st~0))) (and (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse3 (not (<= 1 ~c_dr_pc~0)) .cse4 .cse5 .cse6) (or .cse7 .cse3 .cse5 .cse6 (and (<= 2 ~c_dr_st~0) .cse1)) (or (not (= 0 ~c_num_read~0)) .cse7 .cse3 .cse4 (not (= 0 |old(~p_num_write~0)|)) .cse5 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (and .cse0 (= 1 ~p_num_write~0) .cse1 .cse2) (not (<= |old(~p_dw_pc~0)| 0))))) [2020-07-21 17:21:17,152 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse0 (not (= 0 ~c_num_read~0))) (.cse5 (not (= 0 |old(~p_num_write~0)|))) (.cse7 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse2 (<= ~p_dw_pc~0 0)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (not (<= |old(~p_dw_pc~0)| 0))) (.cse10 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (not (= 1 |old(~q_free~0)|))) (.cse6 (not (= 1 ~p_dw_i~0))) (.cse8 (not (<= 2 |old(~c_dr_st~0)|))) (.cse13 (<= 2 ~c_dr_st~0)) (.cse11 (= 1 ~q_free~0)) (.cse12 (= ~p_last_write~0 ~q_buf_0~0))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 (and .cse2 .cse3 .cse11)) (or .cse0 .cse10 .cse1 .cse4 .cse5 .cse6 .cse7 (and .cse2 .cse3 (= 0 ~p_num_write~0) .cse11 .cse12) .cse9) (or .cse10 .cse1 .cse6 .cse8 (and .cse13 .cse12)) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse1 (not (<= 1 ~c_dr_pc~0)) .cse4 .cse6 .cse8 (and .cse13 (= ~c_num_read~0 ~p_num_write~0) .cse11 .cse12)))) [2020-07-21 17:21:17,152 INFO L264 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse0 (not (= 0 ~c_num_read~0))) (.cse5 (<= ~p_dw_pc~0 0)) (.cse7 (not (= 0 |old(~p_num_write~0)|))) (.cse9 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse10 (not (<= |old(~p_dw_pc~0)| 0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse12 (<= 2 ~c_dr_st~0)) (.cse4 (= 0 ~q_free~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (= 1 |old(~q_free~0)|))) (.cse8 (not (= 1 ~p_dw_i~0))) (.cse11 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 (= 1 ~p_num_write~0) .cse6) .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse5 .cse3 .cse8 .cse9 .cse11 .cse10) (or .cse0 .cse2 .cse5 .cse3 .cse7 .cse8 .cse9 .cse11 .cse10) (or .cse1 .cse2 .cse8 .cse11 (and .cse12 .cse6)) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (and .cse12 .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6) .cse2 (not (<= 1 ~c_dr_pc~0)) .cse3 .cse8 .cse11))) [2020-07-21 17:21:17,152 INFO L268 CegarLoopResult]: For program point L124-1(line 124) no Hoare annotation was computed. [2020-07-21 17:21:17,153 INFO L268 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2020-07-21 17:21:17,153 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2020-07-21 17:21:17,153 INFO L264 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse10 (not (= 0 ~c_num_read~0))) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse8 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse7 (<= ~p_dw_pc~0 0)) (.cse9 (not (<= |old(~p_dw_pc~0)| 0))) (.cse6 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 |old(~c_dr_st~0)|))) (.cse4 (<= 2 ~c_dr_st~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0))) (and (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse0 (not (<= 1 ~c_dr_pc~0)) .cse1 .cse2 .cse3 (and .cse4 (= ~c_num_read~0 ~p_num_write~0) .cse5)) (or .cse6 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3 .cse9) (or .cse10 .cse0 .cse7 .cse1 .cse11 .cse2 .cse8 .cse3 .cse9) (or .cse10 .cse6 .cse0 .cse1 .cse11 .cse2 .cse8 (and .cse7 (= 0 ~p_num_write~0) .cse5) .cse9) (or .cse6 .cse0 .cse2 .cse3 (and .cse4 .cse5)))) [2020-07-21 17:21:17,153 INFO L264 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse4 (= 0 ~q_free~0)) (.cse10 (= 1 ~q_free~0)) (.cse0 (not (= 0 ~c_num_read~0))) (.cse5 (<= ~p_dw_pc~0 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)|))) (.cse11 (not (<= |old(~p_dw_pc~0)| 0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse8 (not (= 1 ~p_dw_i~0))) (.cse12 (not (<= 2 |old(~c_dr_st~0)|))) (.cse13 (<= 2 ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 (= 1 ~p_num_write~0) .cse6) .cse7 .cse8 .cse9 (and .cse5 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0) .cse10 .cse6) .cse11) (or .cse1 .cse2 .cse5 .cse3 .cse8 .cse9 .cse12 .cse11) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse2 (not (<= 1 ~c_dr_pc~0)) .cse3 .cse8 (and .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6) .cse12 (and .cse13 (= ~c_num_read~0 ~p_num_write~0) .cse10 .cse6)) (or .cse0 .cse2 .cse5 .cse3 .cse7 .cse8 .cse9 .cse12 .cse11) (or .cse1 .cse2 .cse8 .cse12 (and .cse13 .cse6)))) [2020-07-21 17:21:17,153 INFO L268 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2020-07-21 17:21:17,153 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-07-21 17:21:17,154 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-21 17:21:17,154 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-07-21 17:21:17,154 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-07-21 17:21:17,154 INFO L264 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 1 ~q_free~0))) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (<= 2 ~c_dr_st~0)) (.cse1 (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 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse3 (not (= 0 ~q_free~0))) (or .cse1 (not (<= 1 ~c_dr_pc~0)) .cse4 .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse7) (or .cse1 .cse4 .cse2 .cse5 (not (= 1 ~p_num_write~0)) .cse6 (not (= 1 ~c_num_read~0)) .cse7) (or (not (<= ~c_dr_pc~0 0)) .cse0 .cse1 .cse2 .cse3))) [2020-07-21 17:21:17,154 INFO L268 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2020-07-21 17:21:17,154 INFO L268 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-07-21 17:21:17,154 INFO L268 CegarLoopResult]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2020-07-21 17:21:17,155 INFO L268 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2020-07-21 17:21:17,155 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2020-07-21 17:21:17,155 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 1 ~q_free~0))) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (<= 2 ~c_dr_st~0)) (.cse1 (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 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse3 (not (= 0 ~q_free~0))) (or .cse1 (not (<= 1 ~c_dr_pc~0)) .cse4 .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse7) (or .cse1 .cse4 .cse2 .cse5 (not (= 1 ~p_num_write~0)) .cse6 (not (= 1 ~c_num_read~0)) .cse7) (or (not (<= ~c_dr_pc~0 0)) .cse0 .cse1 .cse2 .cse3))) [2020-07-21 17:21:17,155 INFO L264 CegarLoopResult]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse11 (= 0 immediate_notify_threads_~tmp~0))) (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (= 0 ~p_dw_st~0)) (.cse4 (and (<= 2 ~p_dw_st~0) .cse11)) (.cse5 (not (= 1 ~q_free~0))) (.cse6 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse7 (not (= 1 ~p_num_write~0))) (.cse8 (not (<= ~p_dw_pc~0 0))) (.cse14 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse10 (not (= 0 ~q_free~0))) (.cse9 (not (<= ~c_dr_pc~0 0))) (.cse13 (<= 2 ~c_dr_st~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse12 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 (not (<= 1 ~c_dr_pc~0)) .cse1 .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (not (= 1 ~c_num_read~0)) .cse6) (or .cse8 (not (= 0 ~c_num_read~0)) .cse9 .cse0 .cse2 .cse7 .cse10 .cse11) (or .cse8 .cse9 .cse0 .cse2 .cse12 .cse11) (or .cse13 .cse0 .cse2 .cse14 .cse12 .cse10) (or .cse8 .cse0 .cse2 .cse14 .cse12 .cse10 .cse11) (or .cse9 .cse13 .cse0 .cse2 .cse12)))) [2020-07-21 17:21:17,155 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-07-21 17:21:17,156 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-21 17:21:17,156 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 17:21:17,156 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 17:21:17,156 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse4 (= 0 ~p_dw_st~0)) (.cse1 (not (= 0 |old(~p_dw_st~0)|))) (.cse12 (not (= 1 |old(~q_free~0)|))) (.cse14 (not (<= |old(~p_dw_pc~0)| 0))) (.cse6 (<= ~p_dw_pc~0 0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= 1 ~q_free~0)) (.cse15 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse3 (not (<= |old(~c_dr_pc~0)| 0))) (.cse7 (= 0 ~c_num_read~0)) (.cse9 (<= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~c_dr_st~0)) (.cse5 (not (<= 2 |old(~c_dr_st~0)|))) (.cse16 (not (= 1 |old(~p_num_write~0)|))) (.cse13 (not (= 0 |old(~c_num_read~0)|))) (.cse19 (= 1 ~p_num_write~0)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse17 (not (<= 2 |old(~p_dw_st~0)|))) (.cse23 (not (= 0 |old(~q_free~0)|))) (.cse24 (= 0 ~q_free~0)) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (<= 2 ~p_dw_st~0)) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse18 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse25 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or (and .cse6 .cse7 .cse8 .cse4 .cse9 (= 0 ~p_num_write~0) .cse10 .cse11) .cse0 .cse1 .cse12 (not (= 0 |old(~p_num_write~0)|)) .cse2 .cse13 .cse3 .cse14 .cse15) (or .cse0 .cse16 .cse12 .cse17 .cse18 .cse2 (not (= 1 |old(~c_num_read~0)|)) .cse5 .cse19) (or (and .cse20 (= ~c_num_read~0 ~p_num_write~0) .cse21 .cse10 .cse11 .cse22) .cse0 .cse12 .cse17 .cse18 .cse2 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse5) (or .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse14 (and .cse6 .cse8 .cse10) .cse15) (or .cse0 .cse2 .cse3 .cse5 (and .cse20 .cse9 .cse11)) (or .cse0 .cse16 .cse17 .cse23 .cse2 .cse13 .cse3 (and .cse24 .cse7 .cse9 .cse11 .cse22)) (or .cse20 .cse0 .cse17 .cse23 .cse2 .cse5 .cse25) (or .cse0 .cse16 .cse17 .cse23 .cse2 .cse13 .cse19) (or .cse0 .cse17 .cse23 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse24 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse21 .cse11 .cse22) .cse2 .cse18 .cse25))) [2020-07-21 17:21:17,156 INFO L264 CegarLoopResult]: At program point L254(line 254) the Hoare annotation is: (let ((.cse14 (<= 2 ~c_dr_st~0)) (.cse15 (= 1 ~p_dw_i~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse13 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse5 (not (= 1 |old(~q_free~0)|))) (.cse11 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse0 (and .cse14 .cse15 (= ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse3 .cse4)) (.cse9 (not (<= 2 |old(~p_dw_st~0)|))) (.cse10 (not (= 0 |old(~q_free~0)|))) (.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not .cse15)) (.cse8 (not (<= |old(~c_dr_pc~0)| 0))) (.cse12 (not (<= 2 |old(~c_dr_st~0)|))) (.cse2 (<= ~c_dr_pc~0 0))) (and (or .cse0 .cse1 (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (<= 1 eval_~tmp___1~0) .cse2 (= 0 ~p_num_write~0) .cse3 .cse4) (not (= 0 |old(~p_dw_st~0)|)) .cse5 (not (= 0 |old(~p_num_write~0)|)) .cse6 .cse7 .cse8 (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse1 .cse9 .cse10 .cse6 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse9 .cse10 .cse6 .cse11 .cse13) (or .cse1 .cse5 .cse9 .cse11 .cse6 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse12) (or .cse0 .cse1 (not (= 1 |old(~p_num_write~0)|)) .cse9 .cse10 .cse6 .cse7) (or .cse1 .cse6 .cse8 .cse12 (and .cse14 .cse2 .cse4))))) [2020-07-21 17:21:17,156 INFO L268 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-07-21 17:21:17,157 INFO L268 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2020-07-21 17:21:17,157 INFO L268 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-07-21 17:21:17,157 INFO L264 CegarLoopResult]: At program point L238(line 238) the Hoare annotation is: (let ((.cse18 (= 0 ~p_dw_st~0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse26 (= 0 ~q_free~0)) (.cse17 (= 0 ~c_num_read~0)) (.cse16 (= 1 ~p_num_write~0)) (.cse12 (<= 2 ~c_dr_st~0)) (.cse23 (= 1 ~p_dw_i~0)) (.cse24 (= ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= 1 ~c_dr_pc~0)) (.cse20 (= 1 ~q_free~0)) (.cse21 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (<= 2 ~p_dw_st~0))) (let ((.cse11 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse10 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse0 (and .cse12 .cse23 .cse24 .cse25 .cse20 .cse21 .cse27)) (.cse7 (and .cse26 .cse17 .cse16 .cse21 .cse27)) (.cse9 (and .cse26 .cse13 .cse25 .cse21 .cse27)) (.cse15 (not (= 1 |old(~q_free~0)|))) (.cse4 (and .cse12 .cse23 .cse18 .cse24 .cse25 .cse20 .cse21)) (.cse22 (not (<= |old(~c_dr_pc~0)| 0))) (.cse19 (<= ~c_dr_pc~0 0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~p_num_write~0)|))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse6 (not .cse23)) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse4 .cse5 .cse3 .cse6 .cse10 .cse9 .cse11) (or .cse1 .cse5 .cse3 .cse6 .cse10 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse12 .cse13) .cse14 .cse11) (or .cse1 .cse2 .cse15 .cse5 .cse10 .cse6 (not (= 1 |old(~c_num_read~0)|)) .cse14 .cse16) (or .cse0 .cse1 .cse15 .cse5 .cse10 .cse6 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse14) (or .cse0 .cse1 (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse7 (not (<= |old(~p_dw_pc~0)| 0)) .cse9 (and (<= ~p_dw_pc~0 0) .cse17 (= ~c_last_read~0 ~p_last_write~0) .cse18 .cse19 (= 0 ~p_num_write~0) .cse20 .cse21) .cse15 .cse4 .cse6 .cse8 .cse22 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse1 .cse6 .cse22 .cse14 (and .cse12 .cse19 .cse21)) (or .cse1 .cse2 .cse5 .cse3 .cse6 .cse8 .cse14 .cse16)))) [2020-07-21 17:21:17,157 INFO L264 CegarLoopResult]: At program point L269(line 269) the Hoare annotation is: (let ((.cse9 (= 0 ~c_num_read~0)) (.cse14 (= 0 ~q_free~0)) (.cse13 (= 1 ~p_dw_i~0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (<= 2 ~p_dw_st~0))) (let ((.cse0 (and .cse14 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse13 (<= 1 ~c_dr_pc~0) .cse10 .cse15)) (.cse5 (and .cse14 .cse9 (= 1 ~p_num_write~0) .cse10 .cse15)) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse8 (not (= 1 |old(~q_free~0)|))) (.cse11 (not (<= |old(~c_dr_pc~0)| 0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse4 (not .cse13)) (.cse12 (not (<= 2 |old(~c_dr_st~0)|))) (.cse7 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 (not (= 1 |old(~p_num_write~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 1 |old(~c_dr_pc~0)|)) .cse7) (or .cse0 .cse1 (not (= 0 |old(~p_dw_st~0)|)) .cse8 (not (= 0 |old(~p_num_write~0)|)) .cse4 (and (<= ~p_dw_pc~0 0) .cse9 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= 1 eval_~tmp___1~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= 1 ~q_free~0) .cse10) .cse5 .cse6 .cse11 (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse1 .cse8 .cse2 .cse4 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse12) (or .cse1 .cse4 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse12 .cse7)))) [2020-07-21 17:21:17,157 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2020-07-21 17:21:17,157 INFO L268 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2020-07-21 17:21:17,157 INFO L268 CegarLoopResult]: For program point L247(lines 237 277) no Hoare annotation was computed. [2020-07-21 17:21:17,158 INFO L264 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse12 (<= 2 ~c_dr_st~0)) (.cse21 (= 1 ~p_dw_i~0)) (.cse19 (<= 1 ~c_dr_pc~0)) (.cse18 (= 0 ~q_free~0)) (.cse16 (= 1 ~p_num_write~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (<= 2 ~p_dw_st~0))) (let ((.cse7 (and .cse18 (= 0 ~c_num_read~0) .cse16 .cse17 .cse20)) (.cse9 (not (= 1 |old(~q_free~0)|))) (.cse10 (not (<= |old(~c_dr_pc~0)| 0))) (.cse2 (not (= 1 |old(~p_num_write~0)|))) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (and .cse12 .cse21 (= ~c_num_read~0 ~p_num_write~0) .cse19 (= 1 ~q_free~0) .cse17 .cse20)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= 0 |old(~q_free~0)|))) (.cse5 (not .cse21)) (.cse11 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse8 (and .cse18 .cse13 .cse19 .cse17 .cse20)) (.cse15 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 (not (= 0 |old(~p_dw_st~0)|)) .cse9 (not (= 0 |old(~p_num_write~0)|)) .cse5 .cse6 .cse7 .cse10 (not (<= |old(~p_dw_pc~0)| 0)) .cse8 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse1 .cse3 .cse4 .cse5 .cse11 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse12 .cse13) .cse14 .cse15) (or .cse1 .cse2 .cse9 .cse3 .cse11 .cse5 (not (= 1 |old(~c_num_read~0)|)) .cse14 .cse16) (or .cse0 .cse1 .cse9 .cse3 .cse11 .cse5 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse14) (or .cse1 .cse5 .cse10 .cse14 (and .cse12 (<= ~c_dr_pc~0 0) .cse17)) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse16) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse8 .cse15)))) [2020-07-21 17:21:17,158 INFO L268 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2020-07-21 17:21:17,158 INFO L264 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse18 (= 0 ~p_dw_st~0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse26 (= 0 ~q_free~0)) (.cse17 (= 0 ~c_num_read~0)) (.cse16 (= 1 ~p_num_write~0)) (.cse12 (<= 2 ~c_dr_st~0)) (.cse23 (= 1 ~p_dw_i~0)) (.cse24 (= ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= 1 ~c_dr_pc~0)) (.cse20 (= 1 ~q_free~0)) (.cse21 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (<= 2 ~p_dw_st~0))) (let ((.cse11 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse10 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse0 (and .cse12 .cse23 .cse24 .cse25 .cse20 .cse21 .cse27)) (.cse7 (and .cse26 .cse17 .cse16 .cse21 .cse27)) (.cse9 (and .cse26 .cse13 .cse25 .cse21 .cse27)) (.cse15 (not (= 1 |old(~q_free~0)|))) (.cse4 (and .cse12 .cse23 .cse18 .cse24 .cse25 .cse20 .cse21)) (.cse22 (not (<= |old(~c_dr_pc~0)| 0))) (.cse19 (<= ~c_dr_pc~0 0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~p_num_write~0)|))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse6 (not .cse23)) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse4 .cse5 .cse3 .cse6 .cse10 .cse9 .cse11) (or .cse1 .cse5 .cse3 .cse6 .cse10 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse12 .cse13) .cse14 .cse11) (or .cse1 .cse2 .cse15 .cse5 .cse10 .cse6 (not (= 1 |old(~c_num_read~0)|)) .cse14 .cse16) (or .cse0 .cse1 .cse15 .cse5 .cse10 .cse6 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse14) (or .cse0 .cse1 (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse7 (not (<= |old(~p_dw_pc~0)| 0)) .cse9 (and (<= ~p_dw_pc~0 0) .cse17 (= ~c_last_read~0 ~p_last_write~0) .cse18 .cse19 (= 0 ~p_num_write~0) .cse20 .cse21) .cse15 .cse4 .cse6 .cse8 .cse22 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse1 .cse6 .cse22 .cse14 (and .cse12 .cse19 .cse21)) (or .cse1 .cse2 .cse5 .cse3 .cse6 .cse8 .cse14 .cse16)))) [2020-07-21 17:21:17,158 INFO L268 CegarLoopResult]: For program point L290-1(line 290) no Hoare annotation was computed. [2020-07-21 17:21:17,158 INFO L271 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: true [2020-07-21 17:21:17,158 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2020-07-21 17:21:17,158 INFO L268 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2020-07-21 17:21:17,158 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2020-07-21 17:21:17,158 INFO L271 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: true [2020-07-21 17:21:17,159 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2020-07-21 17:21:17,159 INFO L264 CegarLoopResult]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse3 (not (= 1 ~q_free~0))) (.cse6 (not (= 1 ~c_num_read~0))) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 1 ~p_num_write~0))) (.cse5 (= 0 is_do_read_c_triggered_~__retres1~1))) (and (or .cse0 .cse1 (not (= 0 ~p_dw_st~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse5 (not (<= 2 ~c_dr_st~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~p_dw_st~0)) .cse6 .cse7) (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) .cse0 .cse1 .cse2 .cse4 .cse5 (not (= 0 ~q_free~0))))) [2020-07-21 17:21:17,159 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2020-07-21 17:21:17,159 INFO L268 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2020-07-21 17:21:17,159 INFO L268 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2020-07-21 17:21:17,159 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2020-07-21 17:21:17,159 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2020-07-21 17:21:17,159 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2020-07-21 17:21:17,159 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 17:21:17,159 INFO L268 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2020-07-21 17:21:17,160 INFO L268 CegarLoopResult]: For program point L318(line 318) no Hoare annotation was computed. [2020-07-21 17:21:17,160 INFO L264 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse0 (= 0 ~q_free~0)) (.cse1 (= 0 ~c_num_read~0)) (.cse5 (= 1 ~q_free~0)) (.cse3 (<= 2 ~p_dw_st~0)) (.cse6 (<= 2 ~c_dr_st~0)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 (= 1 ~p_num_write~0) .cse2 .cse3) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse2 .cse3) (and (<= ~p_dw_pc~0 0) .cse1 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse4 (= 0 ~p_num_write~0) .cse5 .cse2) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse6 (= ~c_num_read~0 ~p_num_write~0) .cse5 .cse2 .cse3) (and .cse6 .cse4 .cse2) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 17:21:17,160 INFO L264 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse0 (= 0 ~q_free~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse3 (<= 2 ~c_dr_st~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 (= 0 ~c_num_read~0) (= 1 ~p_num_write~0) .cse1 .cse2) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse1 .cse2) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse3 (= ~c_num_read~0 ~p_num_write~0) (= 1 ~q_free~0) .cse1 .cse2) (and .cse3 (<= ~c_dr_pc~0 0) .cse1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 17:21:17,160 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2020-07-21 17:21:17,160 INFO L268 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2020-07-21 17:21:17,161 INFO L264 CegarLoopResult]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse0 (= 0 ~q_free~0)) (.cse1 (= 0 ~c_num_read~0)) (.cse5 (= 1 ~q_free~0)) (.cse3 (<= 2 ~p_dw_st~0)) (.cse6 (<= 2 ~c_dr_st~0)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 (= 1 ~p_num_write~0) .cse2 .cse3) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse2 .cse3) (and (<= ~p_dw_pc~0 0) .cse1 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse4 (= 0 ~p_num_write~0) .cse5 .cse2) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse6 (= ~c_num_read~0 ~p_num_write~0) .cse5 .cse2 .cse3) (and .cse6 .cse4 .cse2) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 17:21:17,161 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 17:21:17,161 INFO L271 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2020-07-21 17:21:17,161 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 17:21:17,161 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 17:21:17,161 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 17:21:17,161 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 17:21:17,161 INFO L268 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2020-07-21 17:21:17,161 INFO L268 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2020-07-21 17:21:17,161 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2020-07-21 17:21:17,162 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2020-07-21 17:21:17,162 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2020-07-21 17:21:17,162 INFO L264 CegarLoopResult]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse5 (not (= 0 ~q_free~0))) (.cse0 (not (<= ~p_dw_pc~0 0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse6 (not (<= 2 ~c_dr_st~0)))) (and (or .cse0 (not (= 0 ~c_num_read~0)) .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0)) .cse5) (or .cse0 .cse2 .cse3 .cse4 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6))) [2020-07-21 17:21:17,162 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2020-07-21 17:21:17,162 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2020-07-21 17:21:17,162 INFO L264 CegarLoopResult]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (<= 2 |old(~p_dw_st~0)|))) (.cse9 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (= 0 |old(~c_num_read~0)|))) (.cse11 (<= 2 ~p_dw_st~0)) (.cse3 (<= 2 ~c_dr_st~0)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= 0 ~p_dw_st~0)) (.cse6 (<= 1 ~c_dr_pc~0)) (.cse7 (= 1 ~q_free~0))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse1 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse2 (not (<= |old(~c_dr_pc~0)| 0)) (and .cse3 (= 0 ~c_num_read~0) .cse4 .cse5 .cse6 .cse7) (not (= 0 ~p_num_write~0))) (let ((.cse10 (= ~c_num_read~0 ~p_num_write~0))) (or .cse0 .cse8 .cse9 .cse1 (not (<= 1 |old(~c_dr_pc~0)|)) (and .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse3 .cse10 .cse6 .cse7 .cse11) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))))) (let ((.cse12 (= 1 ~c_num_read~0))) (or .cse0 .cse8 .cse9 .cse1 .cse2 (and .cse12 .cse3 .cse6 .cse7 .cse11) (not (= 1 ~p_num_write~0)) (and .cse12 .cse3 .cse4 .cse5 .cse6 .cse7))))) [2020-07-21 17:21:17,163 INFO L268 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2020-07-21 17:21:17,163 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))))) [2020-07-21 17:21:17,163 INFO L264 CegarLoopResult]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse12 (= 1 ~p_dw_i~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse0 (not .cse14)) (.cse10 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not (= 0 |old(~q_free~0)|))) (.cse5 (not .cse12)) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse8 (= 0 ~q_free~0)) (.cse1 (= 0 ~c_num_read~0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse4 (= 1 ~q_free~0)) (.cse7 (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)|)) (and .cse1 .cse2 .cse3 .cse4) .cse5 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse6 .cse7 (not (= 0 ~p_num_write~0))) (let ((.cse13 (= ~c_num_read~0 ~p_num_write~0))) (or (and .cse8 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse9) .cse0 .cse10 .cse11 .cse5 (not (<= 1 |old(~c_dr_pc~0)|)) (and .cse12 .cse2 .cse3 .cse13 .cse14 .cse4) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) (and .cse2 .cse13 .cse4 .cse9))) (let ((.cse15 (= 1 ~c_num_read~0))) (or (and .cse15 .cse2 .cse4 .cse9) .cse0 .cse10 .cse11 .cse5 .cse6 (and .cse8 .cse1 (<= ~c_dr_pc~0 0) .cse9) (and .cse15 .cse12 .cse2 .cse3 .cse14 .cse4) .cse7 (not (= 1 ~p_num_write~0))))))) [2020-07-21 17:21:17,163 INFO L264 CegarLoopResult]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) (<= 2 ~p_dw_st~0)) .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 .cse5 (not (= 0 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 1 ~p_num_write~0))))) [2020-07-21 17:21:17,163 INFO L268 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2020-07-21 17:21:17,164 INFO L268 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2020-07-21 17:21:17,164 INFO L264 CegarLoopResult]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (<= 2 |old(~p_dw_st~0)|))) (.cse9 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (= 0 ~q_free~0)) (.cse4 (= 0 ~c_num_read~0)) (.cse5 (<= ~c_dr_pc~0 0)) (.cse7 (<= 2 ~p_dw_st~0)) (.cse3 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse1 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse2 .cse3 (and .cse4 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse5 (= 1 ~q_free~0)) (not (= 0 ~p_num_write~0))) (or (and .cse6 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse7) .cse0 .cse8 .cse9 .cse1 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or .cse0 .cse8 .cse9 .cse1 .cse2 (and .cse6 .cse4 .cse5 .cse7) .cse3 (not (= 1 ~p_num_write~0))))) [2020-07-21 17:21:17,164 INFO L268 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2020-07-21 17:21:17,164 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))))) [2020-07-21 17:21:17,164 INFO L268 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2020-07-21 17:21:17,164 INFO L268 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2020-07-21 17:21:17,165 INFO L264 CegarLoopResult]: At program point L169(line 169) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 1 ~q_free~0)) (.cse8 (<= 2 ~p_dw_st~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 1 ~p_num_write~0)) (and (= 1 ~c_num_read~0) .cse6 (<= ~c_dr_pc~0 0) .cse7 .cse8)) (or .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (and .cse6 (= ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse7 .cse8) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 .cse5 (not (= 0 ~p_num_write~0))))) [2020-07-21 17:21:17,165 INFO L268 CegarLoopResult]: For program point L169-1(line 169) no Hoare annotation was computed. [2020-07-21 17:21:17,165 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2020-07-21 17:21:17,165 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2020-07-21 17:21:17,165 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 17:21:17,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:21:17 BoogieIcfgContainer [2020-07-21 17:21:17,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 17:21:17,221 INFO L168 Benchmark]: Toolchain (without parser) took 24239.91 ms. Allocated memory was 144.2 MB in the beginning and 539.0 MB in the end (delta: 394.8 MB). Free memory was 101.8 MB in the beginning and 324.9 MB in the end (delta: -223.1 MB). Peak memory consumption was 414.9 MB. Max. memory is 7.1 GB. [2020-07-21 17:21:17,222 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-21 17:21:17,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.64 ms. Allocated memory is still 144.2 MB. Free memory was 101.6 MB in the beginning and 88.7 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-07-21 17:21:17,223 INFO L168 Benchmark]: Boogie Preprocessor took 131.85 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 88.7 MB in the beginning and 179.2 MB in the end (delta: -90.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-21 17:21:17,223 INFO L168 Benchmark]: RCFGBuilder took 560.10 ms. Allocated memory is still 201.9 MB. Free memory was 179.2 MB in the beginning and 152.8 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-21 17:21:17,224 INFO L168 Benchmark]: TraceAbstraction took 23224.95 ms. Allocated memory was 201.9 MB in the beginning and 539.0 MB in the end (delta: 337.1 MB). Free memory was 152.1 MB in the beginning and 324.9 MB in the end (delta: -172.7 MB). Peak memory consumption was 407.6 MB. Max. memory is 7.1 GB. [2020-07-21 17:21:17,226 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.59 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 316.64 ms. Allocated memory is still 144.2 MB. Free memory was 101.6 MB in the beginning and 88.7 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.85 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 88.7 MB in the beginning and 179.2 MB in the end (delta: -90.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 560.10 ms. Allocated memory is still 201.9 MB. Free memory was 179.2 MB in the beginning and 152.8 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23224.95 ms. Allocated memory was 201.9 MB in the beginning and 539.0 MB in the end (delta: 337.1 MB). Free memory was 152.1 MB in the beginning and 324.9 MB in the end (delta: -172.7 MB). Peak memory consumption was 407.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || ((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) && (((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || ((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0)) || !(\old(p_dw_pc) <= 0)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || ((!(c_num_read == \old(p_num_write)) && 2 <= c_dr_st) && c_num_read + 1 == p_num_write)) || !(2 <= \old(c_dr_st))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(c_dr_pc))) || !(1 == p_dw_i)) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && (((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(c_dr_pc))) || !(1 == p_dw_i)) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st)))) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st))) || ((2 <= c_dr_st && c_dr_pc <= 0) && p_last_write == q_buf_0))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && (((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_num_read) + 1 == \old(p_num_write))) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && 2 <= p_dw_st) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(p_num_write == \old(c_num_read) + 1)) && ((((((((!(p_dw_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(0 == p_num_write))) && ((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(1 == p_num_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((!(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_dr_pc <= 0) || !(\old(q_buf_0) == \old(p_last_write))) || p_dw_pc <= 0) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && (((((((!(c_num_read == \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 <= c_dr_pc)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || ((0 == q_free && c_num_read + 1 == p_num_write) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || (((2 <= c_dr_st && c_num_read == p_num_write) && 1 == q_free) && p_last_write == q_buf_0))) && ((((((((!(0 == c_num_read) || !(\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) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || (2 <= c_dr_st && p_last_write == q_buf_0)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((!(p_dw_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || (((0 == c_num_read && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(0 == p_num_write)) && (((((((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && 2 <= p_dw_st) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || (((((1 == p_dw_i && c_last_read == p_last_write) && 0 == p_dw_st) && c_num_read == p_num_write) && p_last_write == q_buf_0) && 1 == q_free)) || !(p_num_write == \old(c_num_read) + 1)) || (((c_last_read == p_last_write && c_num_read == p_num_write) && 1 == q_free) && 2 <= p_dw_st))) && ((((((((((((1 == c_num_read && c_last_read == p_last_write) && 1 == q_free) && 2 <= p_dw_st) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || (((0 == q_free && 0 == c_num_read) && c_dr_pc <= 0) && 2 <= p_dw_st)) || (((((1 == c_num_read && 1 == p_dw_i) && c_last_read == p_last_write) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == q_free)) || !(\old(c_dr_pc) <= 0)) || !(1 == p_num_write)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || 0 == __retres1) || !(1 == p_dw_i)) || !(1 == p_num_write)) || !(0 == q_free)) && ((((((!(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))) && (((((!(p_dw_pc <= 0) || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || 0 == __retres1) || !(1 == p_dw_i)) || !(2 <= c_dr_st)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || ((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((p_dw_pc <= 0 && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc <= 0) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(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)) || ((2 <= c_dr_st && c_dr_pc <= 0) && p_last_write == q_buf_0)) || !(\old(c_last_read) == \old(p_last_write)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_num_write))) || !(0 == \old(q_free))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || ((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) && ((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || ((!(c_num_read == \old(p_num_write)) && 2 <= c_dr_st) && c_num_read + 1 == p_num_write)) || !(2 <= \old(c_dr_st))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(c_dr_pc))) || !(1 == p_dw_i)) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && (((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(c_dr_pc))) || !(1 == p_dw_i)) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st)))) && (((((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || ((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((p_dw_pc <= 0 && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc <= 0) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || !(1 == \old(q_free))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st))) || ((2 <= c_dr_st && c_dr_pc <= 0) && p_last_write == q_buf_0))) && (((((((!(\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: ((((((((((0 == q_free && c_num_read + 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(c_num_read == \old(p_num_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 <= c_dr_pc)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) && ((((!(c_dr_pc <= 0) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || (2 <= c_dr_st && p_last_write == q_buf_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))) || (((0 == q_free && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((((((((!(c_dr_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(1 == q_free)) || !(1 == p_num_write)) || 0 == __retres1) || !(1 == c_num_read)) || !(c_last_read == p_last_write)) && ((((!(c_dr_pc <= 0) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || 0 == __retres1) || !(2 <= c_dr_st))) && ((((((((!(c_dr_pc <= 0) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || !(1 == q_free)) || !(1 == p_num_write)) || 0 == __retres1) || !(2 <= p_dw_st)) || !(1 == c_num_read)) || !(c_last_read == p_last_write))) && (((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || !(1 == p_num_write)) || 0 == __retres1) || !(0 == q_free)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((!(p_dw_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || (((((2 <= c_dr_st && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free)) || !(0 == p_num_write)) && (((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || (((((2 <= c_dr_st && c_last_read == p_last_write) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free)) || ((((2 <= c_dr_st && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && 2 <= p_dw_st)) || !(p_num_write == \old(c_num_read) + 1))) && (((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || ((((1 == c_num_read && 2 <= c_dr_st) && 1 <= c_dr_pc) && 1 == q_free) && 2 <= p_dw_st)) || !(1 == p_num_write)) || (((((1 == c_num_read && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: (((((((!(p_last_write == q_buf_0) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || 1 <= __retres1) || !(c_num_read == p_num_write)) || !(1 == q_free)) || !(2 <= c_dr_st)) && (((((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || 1 <= __retres1) || !(1 == q_free)) || !(0 == p_num_write)) || !(c_last_read == p_last_write))) && (((((!(c_dr_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || 1 <= __retres1) || !(2 <= c_dr_st)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((!(c_num_read == \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 <= c_dr_pc)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || ((2 <= c_dr_st && c_num_read == p_num_write) && p_last_write == q_buf_0)) && (((((((!(c_dr_pc <= 0) || !(\old(q_buf_0) == \old(p_last_write))) || p_dw_pc <= 0) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || p_dw_pc <= 0) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || ((p_dw_pc <= 0 && 0 == p_num_write) && p_last_write == q_buf_0)) || !(\old(p_dw_pc) <= 0))) && ((((!(c_dr_pc <= 0) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || (2 <= c_dr_st && p_last_write == q_buf_0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.9s, OverallIterations: 15, TraceHistogramMax: 4, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2398 SDtfs, 2207 SDslu, 3349 SDs, 0 SdLazy, 1521 SolverSat, 491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1909 GetRequests, 1854 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2730occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 551 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 4391 PreInvPairs, 4717 NumberOfFragments, 5711 HoareAnnotationTreeSize, 4391 FomulaSimplifications, 8104 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 45 FomulaSimplificationsInter, 11167 FormulaSimplificationTreeSizeReductionInter, 10.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1658 NumberOfCodeBlocks, 1306 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1888 ConstructedInterpolants, 0 QuantifiedInterpolants, 358864 SizeOfPredicates, 23 NumberOfNonLiveVariables, 8455 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 678/721 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...