/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 16:54:04,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 16:54:04,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 16:54:04,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 16:54:04,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 16:54:04,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 16:54:04,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 16:54:04,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 16:54:04,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 16:54:04,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 16:54:04,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 16:54:04,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 16:54:04,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 16:54:04,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 16:54:04,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 16:54:04,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 16:54:04,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 16:54:04,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 16:54:04,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 16:54:04,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 16:54:04,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 16:54:04,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 16:54:04,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 16:54:04,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 16:54:04,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 16:54:04,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 16:54:04,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 16:54:04,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 16:54:04,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 16:54:04,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 16:54:04,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 16:54:04,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 16:54:04,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 16:54:04,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 16:54:04,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 16:54:04,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 16:54:04,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 16:54:04,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 16:54:04,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 16:54:04,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 16:54:04,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 16:54:04,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-09 16:54:04,363 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 16:54:04,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 16:54:04,364 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 16:54:04,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 16:54:04,365 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 16:54:04,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 16:54:04,365 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 16:54:04,365 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 16:54:04,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 16:54:04,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 16:54:04,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 16:54:04,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 16:54:04,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 16:54:04,367 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 16:54:04,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 16:54:04,368 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 16:54:04,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 16:54:04,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 16:54:04,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 16:54:04,368 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 16:54:04,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 16:54:04,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 16:54:04,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 16:54:04,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 16:54:04,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 16:54:04,370 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 16:54:04,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 16:54:04,370 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 16:54:04,370 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 16:54:04,370 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 16:54:04,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 16:54:04,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 16:54:04,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 16:54:04,677 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 16:54:04,677 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 16:54:04,678 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i [2020-10-09 16:54:04,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/954551b09/e40c5f99e9234d8698621aed142a7765/FLAG751234fcb [2020-10-09 16:54:05,269 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 16:54:05,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i [2020-10-09 16:54:05,291 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/954551b09/e40c5f99e9234d8698621aed142a7765/FLAG751234fcb [2020-10-09 16:54:05,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/954551b09/e40c5f99e9234d8698621aed142a7765 [2020-10-09 16:54:05,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 16:54:05,590 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 16:54:05,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 16:54:05,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 16:54:05,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 16:54:05,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 04:54:05" (1/1) ... [2020-10-09 16:54:05,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b4d328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:54:05, skipping insertion in model container [2020-10-09 16:54:05,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 04:54:05" (1/1) ... [2020-10-09 16:54:05,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 16:54:05,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 16:54:06,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 16:54:06,130 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 16:54:06,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 16:54:06,306 INFO L208 MainTranslator]: Completed translation [2020-10-09 16:54:06,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:54:06 WrapperNode [2020-10-09 16:54:06,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 16:54:06,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 16:54:06,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 16:54:06,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 16:54:06,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:54:06" (1/1) ... [2020-10-09 16:54:06,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:54:06" (1/1) ... [2020-10-09 16:54:06,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 16:54:06,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 16:54:06,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 16:54:06,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 16:54:06,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:54:06" (1/1) ... [2020-10-09 16:54:06,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:54:06" (1/1) ... [2020-10-09 16:54:06,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:54:06" (1/1) ... [2020-10-09 16:54:06,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:54:06" (1/1) ... [2020-10-09 16:54:06,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:54:06" (1/1) ... [2020-10-09 16:54:06,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:54:06" (1/1) ... [2020-10-09 16:54:06,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:54:06" (1/1) ... [2020-10-09 16:54:06,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 16:54:06,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 16:54:06,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 16:54:06,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 16:54:06,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:54:06" (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-10-09 16:54:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 16:54:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 16:54:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 16:54:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 16:54:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 16:54:06,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 16:54:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 16:54:06,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 16:54:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-09 16:54:06,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-09 16:54:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 16:54:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 16:54:06,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 16:54:06,511 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 16:54:08,157 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 16:54:08,158 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 16:54:08,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 04:54:08 BoogieIcfgContainer [2020-10-09 16:54:08,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 16:54:08,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 16:54:08,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 16:54:08,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 16:54:08,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 04:54:05" (1/3) ... [2020-10-09 16:54:08,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b075be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 04:54:08, skipping insertion in model container [2020-10-09 16:54:08,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:54:06" (2/3) ... [2020-10-09 16:54:08,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b075be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 04:54:08, skipping insertion in model container [2020-10-09 16:54:08,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 04:54:08" (3/3) ... [2020-10-09 16:54:08,168 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_power.opt.i [2020-10-09 16:54:08,179 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 16:54:08,187 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 16:54:08,188 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 16:54:08,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,216 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,216 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,217 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,217 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,221 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,221 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,221 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,222 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,228 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,228 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,233 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,233 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,236 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,236 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,237 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:54:08,254 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 16:54:08,275 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 16:54:08,275 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 16:54:08,275 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 16:54:08,276 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 16:54:08,276 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 16:54:08,276 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 16:54:08,276 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 16:54:08,276 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 16:54:08,289 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-10-09 16:54:08,335 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-09 16:54:08,335 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:54:08,340 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-09 16:54:08,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 205 flow [2020-10-09 16:54:08,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 92 transitions, 193 flow [2020-10-09 16:54:08,362 INFO L129 PetriNetUnfolder]: 0/57 cut-off events. [2020-10-09 16:54:08,362 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:54:08,362 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:54:08,363 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-09 16:54:08,364 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:54:08,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:54:08,370 INFO L82 PathProgramCache]: Analyzing trace with hash -903219512, now seen corresponding path program 1 times [2020-10-09 16:54:08,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:54:08,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884033378] [2020-10-09 16:54:08,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-09 16:54:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:54:08,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 16:54:08,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:54:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:54:08,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:54:08,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:54:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:54:08,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884033378] [2020-10-09 16:54:08,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:54:08,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-10-09 16:54:08,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446161102] [2020-10-09 16:54:08,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 16:54:08,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:54:08,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 16:54:08,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 16:54:08,819 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 95 [2020-10-09 16:54:08,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 193 flow. Second operand 4 states. [2020-10-09 16:54:08,822 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:54:08,822 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 95 [2020-10-09 16:54:08,823 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:54:08,856 INFO L129 PetriNetUnfolder]: 0/89 cut-off events. [2020-10-09 16:54:08,856 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:54:08,857 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 89 events. 0/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 4/91 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-09 16:54:08,858 INFO L132 encePairwiseOnDemand]: 90/95 looper letters, 0 selfloop transitions, 2 changer transitions 11/89 dead transitions. [2020-10-09 16:54:08,859 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 89 transitions, 191 flow [2020-10-09 16:54:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 16:54:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 16:54:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2020-10-09 16:54:08,874 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9719298245614035 [2020-10-09 16:54:08,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2020-10-09 16:54:08,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2020-10-09 16:54:08,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:54:08,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2020-10-09 16:54:08,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 16:54:08,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 16:54:08,890 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 16:54:08,892 INFO L185 Difference]: Start difference. First operand has 100 places, 92 transitions, 193 flow. Second operand 3 states and 277 transitions. [2020-10-09 16:54:08,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 89 transitions, 191 flow [2020-10-09 16:54:08,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 89 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-09 16:54:08,900 INFO L241 Difference]: Finished difference. Result has 98 places, 78 transitions, 166 flow [2020-10-09 16:54:08,903 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2020-10-09 16:54:08,904 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2020-10-09 16:54:08,904 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 166 flow [2020-10-09 16:54:08,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 16:54:08,905 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:54:08,905 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-09 16:54:09,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 16:54:09,118 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:54:09,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:54:09,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1892047465, now seen corresponding path program 1 times [2020-10-09 16:54:09,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:54:09,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186749209] [2020-10-09 16:54:09,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-09 16:54:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:54:09,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 16:54:09,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:54:09,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:54:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:54:09,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:54:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:54:09,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186749209] [2020-10-09 16:54:09,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:54:09,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 16:54:09,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464439371] [2020-10-09 16:54:09,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 16:54:09,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:54:09,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 16:54:09,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 16:54:09,571 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 95 [2020-10-09 16:54:09,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 166 flow. Second operand 8 states. [2020-10-09 16:54:09,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:54:09,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 95 [2020-10-09 16:54:09,573 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:54:09,669 INFO L129 PetriNetUnfolder]: 3/104 cut-off events. [2020-10-09 16:54:09,669 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:54:09,670 INFO L80 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 104 events. 3/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs, 0 based on Foata normal form. 2/106 useless extension candidates. Maximal degree in co-relation 91. Up to 7 conditions per place. [2020-10-09 16:54:09,671 INFO L132 encePairwiseOnDemand]: 89/95 looper letters, 6 selfloop transitions, 2 changer transitions 10/88 dead transitions. [2020-10-09 16:54:09,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 222 flow [2020-10-09 16:54:09,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 16:54:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 16:54:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 785 transitions. [2020-10-09 16:54:09,677 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9181286549707602 [2020-10-09 16:54:09,677 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 785 transitions. [2020-10-09 16:54:09,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 785 transitions. [2020-10-09 16:54:09,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:54:09,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 785 transitions. [2020-10-09 16:54:09,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 16:54:09,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 16:54:09,683 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 16:54:09,683 INFO L185 Difference]: Start difference. First operand has 98 places, 78 transitions, 166 flow. Second operand 9 states and 785 transitions. [2020-10-09 16:54:09,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 222 flow [2020-10-09 16:54:09,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 16:54:09,687 INFO L241 Difference]: Finished difference. Result has 100 places, 78 transitions, 182 flow [2020-10-09 16:54:09,688 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=182, PETRI_PLACES=100, PETRI_TRANSITIONS=78} [2020-10-09 16:54:09,688 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2020-10-09 16:54:09,689 INFO L481 AbstractCegarLoop]: Abstraction has has 100 places, 78 transitions, 182 flow [2020-10-09 16:54:09,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 16:54:09,689 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:54:09,689 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-09 16:54:09,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 16:54:09,891 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:54:09,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:54:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1296511436, now seen corresponding path program 1 times [2020-10-09 16:54:09,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:54:09,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795255267] [2020-10-09 16:54:09,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-09 16:54:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:54:09,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 16:54:10,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:54:10,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:54:10,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:54:10,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:54:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:54:10,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795255267] [2020-10-09 16:54:10,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:54:10,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 16:54:10,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987550250] [2020-10-09 16:54:10,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 16:54:10,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:54:10,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 16:54:10,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 16:54:10,175 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 95 [2020-10-09 16:54:10,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 78 transitions, 182 flow. Second operand 8 states. [2020-10-09 16:54:10,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:54:10,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 95 [2020-10-09 16:54:10,176 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:54:10,345 INFO L129 PetriNetUnfolder]: 64/250 cut-off events. [2020-10-09 16:54:10,345 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 16:54:10,347 INFO L80 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 250 events. 64/250 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1023 event pairs, 0 based on Foata normal form. 8/253 useless extension candidates. Maximal degree in co-relation 396. Up to 36 conditions per place. [2020-10-09 16:54:10,348 INFO L132 encePairwiseOnDemand]: 86/95 looper letters, 10 selfloop transitions, 9 changer transitions 29/116 dead transitions. [2020-10-09 16:54:10,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 116 transitions, 354 flow [2020-10-09 16:54:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 16:54:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-09 16:54:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1035 transitions. [2020-10-09 16:54:10,352 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9078947368421053 [2020-10-09 16:54:10,352 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1035 transitions. [2020-10-09 16:54:10,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1035 transitions. [2020-10-09 16:54:10,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:54:10,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1035 transitions. [2020-10-09 16:54:10,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-09 16:54:10,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-09 16:54:10,358 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-09 16:54:10,358 INFO L185 Difference]: Start difference. First operand has 100 places, 78 transitions, 182 flow. Second operand 12 states and 1035 transitions. [2020-10-09 16:54:10,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 116 transitions, 354 flow [2020-10-09 16:54:10,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 116 transitions, 338 flow, removed 6 selfloop flow, removed 8 redundant places. [2020-10-09 16:54:10,363 INFO L241 Difference]: Finished difference. Result has 106 places, 84 transitions, 264 flow [2020-10-09 16:54:10,363 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=264, PETRI_PLACES=106, PETRI_TRANSITIONS=84} [2020-10-09 16:54:10,363 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 6 predicate places. [2020-10-09 16:54:10,364 INFO L481 AbstractCegarLoop]: Abstraction has has 106 places, 84 transitions, 264 flow [2020-10-09 16:54:10,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 16:54:10,364 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:54:10,364 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:54:10,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 16:54:10,577 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:54:10,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:54:10,578 INFO L82 PathProgramCache]: Analyzing trace with hash -572298967, now seen corresponding path program 1 times [2020-10-09 16:54:10,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:54:10,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824341552] [2020-10-09 16:54:10,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-09 16:54:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:54:10,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 16:54:10,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:54:10,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:54:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:54:10,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:54:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:54:10,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824341552] [2020-10-09 16:54:10,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:54:10,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 16:54:10,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360027168] [2020-10-09 16:54:10,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 16:54:10,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:54:10,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 16:54:10,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 16:54:10,933 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 95 [2020-10-09 16:54:10,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 84 transitions, 264 flow. Second operand 8 states. [2020-10-09 16:54:10,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:54:10,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 95 [2020-10-09 16:54:10,934 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:54:11,056 INFO L129 PetriNetUnfolder]: 35/260 cut-off events. [2020-10-09 16:54:11,056 INFO L130 PetriNetUnfolder]: For 483/496 co-relation queries the response was YES. [2020-10-09 16:54:11,058 INFO L80 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 260 events. 35/260 cut-off events. For 483/496 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1103 event pairs, 6 based on Foata normal form. 7/260 useless extension candidates. Maximal degree in co-relation 603. Up to 51 conditions per place. [2020-10-09 16:54:11,059 INFO L132 encePairwiseOnDemand]: 88/95 looper letters, 11 selfloop transitions, 3 changer transitions 10/99 dead transitions. [2020-10-09 16:54:11,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 99 transitions, 344 flow [2020-10-09 16:54:11,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 16:54:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 16:54:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 782 transitions. [2020-10-09 16:54:11,062 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9146198830409357 [2020-10-09 16:54:11,063 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 782 transitions. [2020-10-09 16:54:11,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 782 transitions. [2020-10-09 16:54:11,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:54:11,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 782 transitions. [2020-10-09 16:54:11,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 16:54:11,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 16:54:11,067 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 16:54:11,067 INFO L185 Difference]: Start difference. First operand has 106 places, 84 transitions, 264 flow. Second operand 9 states and 782 transitions. [2020-10-09 16:54:11,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 99 transitions, 344 flow [2020-10-09 16:54:11,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 99 transitions, 314 flow, removed 11 selfloop flow, removed 7 redundant places. [2020-10-09 16:54:11,073 INFO L241 Difference]: Finished difference. Result has 109 places, 85 transitions, 264 flow [2020-10-09 16:54:11,073 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=264, PETRI_PLACES=109, PETRI_TRANSITIONS=85} [2020-10-09 16:54:11,073 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2020-10-09 16:54:11,074 INFO L481 AbstractCegarLoop]: Abstraction has has 109 places, 85 transitions, 264 flow [2020-10-09 16:54:11,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 16:54:11,074 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:54:11,074 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:54:11,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 16:54:11,293 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:54:11,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:54:11,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1146050673, now seen corresponding path program 1 times [2020-10-09 16:54:11,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:54:11,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972042479] [2020-10-09 16:54:11,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-09 16:54:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:54:11,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-09 16:54:11,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:54:11,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:54:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:54:11,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:54:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:54:11,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972042479] [2020-10-09 16:54:11,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:54:11,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2020-10-09 16:54:11,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449372273] [2020-10-09 16:54:11,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 16:54:11,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:54:11,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 16:54:11,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-09 16:54:11,643 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 95 [2020-10-09 16:54:11,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 85 transitions, 264 flow. Second operand 10 states. [2020-10-09 16:54:11,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:54:11,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 95 [2020-10-09 16:54:11,644 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:54:11,847 INFO L129 PetriNetUnfolder]: 32/186 cut-off events. [2020-10-09 16:54:11,848 INFO L130 PetriNetUnfolder]: For 285/361 co-relation queries the response was YES. [2020-10-09 16:54:11,849 INFO L80 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 186 events. 32/186 cut-off events. For 285/361 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 606 event pairs, 0 based on Foata normal form. 18/197 useless extension candidates. Maximal degree in co-relation 482. Up to 53 conditions per place. [2020-10-09 16:54:11,851 INFO L132 encePairwiseOnDemand]: 86/95 looper letters, 4 selfloop transitions, 12 changer transitions 14/98 dead transitions. [2020-10-09 16:54:11,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 98 transitions, 409 flow [2020-10-09 16:54:11,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-09 16:54:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-09 16:54:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 933 transitions. [2020-10-09 16:54:11,855 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8928229665071771 [2020-10-09 16:54:11,855 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 933 transitions. [2020-10-09 16:54:11,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 933 transitions. [2020-10-09 16:54:11,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:54:11,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 933 transitions. [2020-10-09 16:54:11,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-09 16:54:11,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-09 16:54:11,860 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-09 16:54:11,860 INFO L185 Difference]: Start difference. First operand has 109 places, 85 transitions, 264 flow. Second operand 11 states and 933 transitions. [2020-10-09 16:54:11,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 98 transitions, 409 flow [2020-10-09 16:54:11,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 98 transitions, 369 flow, removed 16 selfloop flow, removed 9 redundant places. [2020-10-09 16:54:11,865 INFO L241 Difference]: Finished difference. Result has 110 places, 84 transitions, 278 flow [2020-10-09 16:54:11,866 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=278, PETRI_PLACES=110, PETRI_TRANSITIONS=84} [2020-10-09 16:54:11,866 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places. [2020-10-09 16:54:11,866 INFO L481 AbstractCegarLoop]: Abstraction has has 110 places, 84 transitions, 278 flow [2020-10-09 16:54:11,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 16:54:11,866 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:54:11,868 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:54:12,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-09 16:54:12,079 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:54:12,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:54:12,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1231316429, now seen corresponding path program 1 times [2020-10-09 16:54:12,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:54:12,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043180625] [2020-10-09 16:54:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-09 16:54:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:54:12,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 16:54:12,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:54:12,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:54:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:54:12,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:54:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:54:12,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043180625] [2020-10-09 16:54:12,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:54:12,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-09 16:54:12,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410244862] [2020-10-09 16:54:12,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 16:54:12,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:54:12,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 16:54:12,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-09 16:54:12,542 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 95 [2020-10-09 16:54:12,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 84 transitions, 278 flow. Second operand 9 states. [2020-10-09 16:54:12,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:54:12,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 95 [2020-10-09 16:54:12,544 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:54:12,641 INFO L129 PetriNetUnfolder]: 12/152 cut-off events. [2020-10-09 16:54:12,641 INFO L130 PetriNetUnfolder]: For 130/148 co-relation queries the response was YES. [2020-10-09 16:54:12,642 INFO L80 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 152 events. 12/152 cut-off events. For 130/148 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 355 event pairs, 0 based on Foata normal form. 1/148 useless extension candidates. Maximal degree in co-relation 277. Up to 25 conditions per place. [2020-10-09 16:54:12,643 INFO L132 encePairwiseOnDemand]: 89/95 looper letters, 9 selfloop transitions, 1 changer transitions 5/89 dead transitions. [2020-10-09 16:54:12,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 89 transitions, 320 flow [2020-10-09 16:54:12,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 16:54:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-09 16:54:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 597 transitions. [2020-10-09 16:54:12,645 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8977443609022556 [2020-10-09 16:54:12,645 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 597 transitions. [2020-10-09 16:54:12,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 597 transitions. [2020-10-09 16:54:12,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:54:12,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 597 transitions. [2020-10-09 16:54:12,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-09 16:54:12,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-09 16:54:12,649 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-09 16:54:12,649 INFO L185 Difference]: Start difference. First operand has 110 places, 84 transitions, 278 flow. Second operand 7 states and 597 transitions. [2020-10-09 16:54:12,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 89 transitions, 320 flow [2020-10-09 16:54:12,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 89 transitions, 238 flow, removed 21 selfloop flow, removed 16 redundant places. [2020-10-09 16:54:12,652 INFO L241 Difference]: Finished difference. Result has 101 places, 84 transitions, 211 flow [2020-10-09 16:54:12,653 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=211, PETRI_PLACES=101, PETRI_TRANSITIONS=84} [2020-10-09 16:54:12,654 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 1 predicate places. [2020-10-09 16:54:12,654 INFO L481 AbstractCegarLoop]: Abstraction has has 101 places, 84 transitions, 211 flow [2020-10-09 16:54:12,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 16:54:12,655 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:54:12,655 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:54:12,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-09 16:54:12,866 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:54:12,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:54:12,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1031034383, now seen corresponding path program 2 times [2020-10-09 16:54:12,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:54:12,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285067528] [2020-10-09 16:54:12,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-09 16:54:12,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 16:54:12,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-09 16:54:12,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 16:54:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 16:54:13,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 16:54:13,189 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 16:54:13,189 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 16:54:13,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-09 16:54:13,444 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,444 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,445 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,446 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,446 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,446 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,446 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,446 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,447 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,447 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,447 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,447 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,447 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,447 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,448 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,448 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,448 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,449 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,449 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,449 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,449 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,449 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,450 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,450 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,451 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,451 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,451 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,451 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,451 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,452 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,452 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,452 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,452 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,452 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,452 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,453 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,453 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,453 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,453 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,453 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,454 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,454 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,454 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,454 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,454 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,455 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,455 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,455 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,455 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,455 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,455 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,456 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,456 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,456 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,456 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,456 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,457 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 16:54:13,457 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:54:13,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 04:54:13 BasicIcfg [2020-10-09 16:54:13,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 16:54:13,584 INFO L168 Benchmark]: Toolchain (without parser) took 7993.10 ms. Allocated memory was 252.2 MB in the beginning and 493.9 MB in the end (delta: 241.7 MB). Free memory was 207.2 MB in the beginning and 454.3 MB in the end (delta: -247.1 MB). Peak memory consumption was 219.1 MB. Max. memory is 14.2 GB. [2020-10-09 16:54:13,584 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 16:54:13,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.16 ms. Allocated memory was 252.2 MB in the beginning and 317.2 MB in the end (delta: 65.0 MB). Free memory was 207.2 MB in the beginning and 265.4 MB in the end (delta: -58.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 14.2 GB. [2020-10-09 16:54:13,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.45 ms. Allocated memory is still 317.2 MB. Free memory was 265.4 MB in the beginning and 260.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-09 16:54:13,587 INFO L168 Benchmark]: Boogie Preprocessor took 36.96 ms. Allocated memory is still 317.2 MB. Free memory is still 260.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 16:54:13,588 INFO L168 Benchmark]: RCFGBuilder took 1720.43 ms. Allocated memory was 317.2 MB in the beginning and 359.7 MB in the end (delta: 42.5 MB). Free memory was 257.8 MB in the beginning and 211.1 MB in the end (delta: 46.8 MB). Peak memory consumption was 94.9 MB. Max. memory is 14.2 GB. [2020-10-09 16:54:13,588 INFO L168 Benchmark]: TraceAbstraction took 5420.08 ms. Allocated memory was 359.7 MB in the beginning and 493.9 MB in the end (delta: 134.2 MB). Free memory was 211.1 MB in the beginning and 454.3 MB in the end (delta: -243.2 MB). Peak memory consumption was 115.5 MB. Max. memory is 14.2 GB. [2020-10-09 16:54:13,593 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.44 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 717.16 ms. Allocated memory was 252.2 MB in the beginning and 317.2 MB in the end (delta: 65.0 MB). Free memory was 207.2 MB in the beginning and 265.4 MB in the end (delta: -58.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 93.45 ms. Allocated memory is still 317.2 MB. Free memory was 265.4 MB in the beginning and 260.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 36.96 ms. Allocated memory is still 317.2 MB. Free memory is still 260.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 1720.43 ms. Allocated memory was 317.2 MB in the beginning and 359.7 MB in the end (delta: 42.5 MB). Free memory was 257.8 MB in the beginning and 211.1 MB in the end (delta: 46.8 MB). Peak memory consumption was 94.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 5420.08 ms. Allocated memory was 359.7 MB in the beginning and 493.9 MB in the end (delta: 134.2 MB). Free memory was 211.1 MB in the beginning and 454.3 MB in the end (delta: -243.2 MB). Peak memory consumption was 115.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L702] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L704] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L705] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L706] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L708] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L710] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L711] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L712] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L713] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L714] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L715] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L716] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L720] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L721] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L722] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L723] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L724] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L725] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L726] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] 0 pthread_t t1196; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] 0 pthread_t t1197; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 0 pthread_t t1198; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L769] 3 y$w_buff1 = y$w_buff0 [L770] 3 y$w_buff0 = 2 [L771] 3 y$w_buff1_used = y$w_buff0_used [L772] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L774] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L775] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L776] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L777] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L778] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L784] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L758] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L759] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L742] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L794] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L830] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 0 y$flush_delayed = weak$$choice2 [L833] 0 y$mem_tmp = y [L834] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L835] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L842] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L842] 0 y = y$flush_delayed ? y$mem_tmp : y [L843] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 33 SDtfs, 178 SDslu, 310 SDs, 0 SdLazy, 360 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 753 GetRequests, 680 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 724 ConstructedInterpolants, 0 QuantifiedInterpolants, 107273 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1097 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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 incorrect! Received shutdown request...