/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 11:39:53,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 11:39:53,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 11:39:53,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 11:39:53,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 11:39:53,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 11:39:53,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 11:39:53,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 11:39:53,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 11:39:53,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 11:39:53,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 11:39:53,315 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 11:39:53,315 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 11:39:53,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 11:39:53,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 11:39:53,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 11:39:53,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 11:39:53,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 11:39:53,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 11:39:53,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 11:39:53,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 11:39:53,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 11:39:53,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 11:39:53,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 11:39:53,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 11:39:53,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 11:39:53,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 11:39:53,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 11:39:53,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 11:39:53,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 11:39:53,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 11:39:53,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 11:39:53,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 11:39:53,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 11:39:53,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 11:39:53,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 11:39:53,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 11:39:53,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 11:39:53,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 11:39:53,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 11:39:53,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 11:39:53,347 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-12 11:39:53,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 11:39:53,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 11:39:53,373 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 11:39:53,373 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 11:39:53,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 11:39:53,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 11:39:53,374 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 11:39:53,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 11:39:53,374 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 11:39:53,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 11:39:53,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 11:39:53,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 11:39:53,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 11:39:53,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 11:39:53,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 11:39:53,376 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 11:39:53,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 11:39:53,376 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 11:39:53,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 11:39:53,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 11:39:53,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 11:39:53,376 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 11:39:53,376 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 11:39:53,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:39:53,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 11:39:53,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 11:39:53,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 11:39:53,377 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 11:39:53,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 11:39:53,377 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 11:39:53,377 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 11:39:53,377 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 11:39:53,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 11:39:53,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 11:39:53,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 11:39:53,645 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 11:39:53,646 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 11:39:53,647 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2022-12-12 11:39:54,537 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 11:39:54,799 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 11:39:54,799 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2022-12-12 11:39:54,815 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3462f9da/afbc72ad28364d069bdc5758f8a5abfe/FLAG5e3c0d27d [2022-12-12 11:39:54,827 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3462f9da/afbc72ad28364d069bdc5758f8a5abfe [2022-12-12 11:39:54,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 11:39:54,830 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 11:39:54,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 11:39:54,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 11:39:54,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 11:39:54,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:39:54" (1/1) ... [2022-12-12 11:39:54,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e46fb47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:39:54, skipping insertion in model container [2022-12-12 11:39:54,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:39:54" (1/1) ... [2022-12-12 11:39:54,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 11:39:54,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 11:39:54,967 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i[988,1001] [2022-12-12 11:39:55,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:39:55,172 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 11:39:55,182 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i[988,1001] [2022-12-12 11:39:55,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:39:55,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:39:55,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:39:55,254 INFO L208 MainTranslator]: Completed translation [2022-12-12 11:39:55,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:39:55 WrapperNode [2022-12-12 11:39:55,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 11:39:55,256 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 11:39:55,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 11:39:55,256 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 11:39:55,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:39:55" (1/1) ... [2022-12-12 11:39:55,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:39:55" (1/1) ... [2022-12-12 11:39:55,315 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-12-12 11:39:55,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 11:39:55,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 11:39:55,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 11:39:55,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 11:39:55,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:39:55" (1/1) ... [2022-12-12 11:39:55,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:39:55" (1/1) ... [2022-12-12 11:39:55,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:39:55" (1/1) ... [2022-12-12 11:39:55,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:39:55" (1/1) ... [2022-12-12 11:39:55,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:39:55" (1/1) ... [2022-12-12 11:39:55,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:39:55" (1/1) ... [2022-12-12 11:39:55,340 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:39:55" (1/1) ... [2022-12-12 11:39:55,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:39:55" (1/1) ... [2022-12-12 11:39:55,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 11:39:55,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 11:39:55,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 11:39:55,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 11:39:55,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:39:55" (1/1) ... [2022-12-12 11:39:55,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:39:55,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:39:55,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 11:39:55,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 11:39:55,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 11:39:55,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 11:39:55,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 11:39:55,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 11:39:55,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 11:39:55,407 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 11:39:55,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 11:39:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 11:39:55,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 11:39:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 11:39:55,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 11:39:55,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 11:39:55,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 11:39:55,410 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 11:39:55,515 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 11:39:55,518 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 11:39:55,832 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 11:39:55,941 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 11:39:55,942 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 11:39:55,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:39:55 BoogieIcfgContainer [2022-12-12 11:39:55,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 11:39:55,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 11:39:55,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 11:39:55,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 11:39:55,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 11:39:54" (1/3) ... [2022-12-12 11:39:55,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da5279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:39:55, skipping insertion in model container [2022-12-12 11:39:55,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:39:55" (2/3) ... [2022-12-12 11:39:55,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da5279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:39:55, skipping insertion in model container [2022-12-12 11:39:55,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:39:55" (3/3) ... [2022-12-12 11:39:55,950 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2022-12-12 11:39:55,976 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 11:39:55,976 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 11:39:55,976 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 11:39:56,053 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 11:39:56,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2022-12-12 11:39:56,129 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-12 11:39:56,129 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:39:56,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-12 11:39:56,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2022-12-12 11:39:56,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2022-12-12 11:39:56,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 11:39:56,157 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7beeca55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 11:39:56,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 11:39:56,172 INFO L130 PetriNetUnfolder]: 0/41 cut-off events. [2022-12-12 11:39:56,172 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:39:56,172 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:39:56,173 INFO L214 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] [2022-12-12 11:39:56,174 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:39:56,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:39:56,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1579952717, now seen corresponding path program 1 times [2022-12-12 11:39:56,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:39:56,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061776659] [2022-12-12 11:39:56,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:39:56,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:39:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:39:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:39:56,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:39:56,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061776659] [2022-12-12 11:39:56,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061776659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:39:56,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:39:56,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 11:39:56,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532381577] [2022-12-12 11:39:56,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:39:56,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:39:56,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:39:56,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:39:56,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:39:56,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2022-12-12 11:39:56,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:39:56,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:39:56,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2022-12-12 11:39:56,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:39:56,667 INFO L130 PetriNetUnfolder]: 26/159 cut-off events. [2022-12-12 11:39:56,667 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-12 11:39:56,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 159 events. 26/159 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 464 event pairs, 2 based on Foata normal form. 13/159 useless extension candidates. Maximal degree in co-relation 181. Up to 46 conditions per place. [2022-12-12 11:39:56,669 INFO L137 encePairwiseOnDemand]: 87/92 looper letters, 11 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2022-12-12 11:39:56,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 90 transitions, 215 flow [2022-12-12 11:39:56,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:39:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:39:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2022-12-12 11:39:56,679 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9239130434782609 [2022-12-12 11:39:56,682 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 0 predicate places. [2022-12-12 11:39:56,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 90 transitions, 215 flow [2022-12-12 11:39:56,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 90 transitions, 210 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-12 11:39:56,686 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 210 flow [2022-12-12 11:39:56,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:39:56,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:39:56,686 INFO L214 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] [2022-12-12 11:39:56,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 11:39:56,687 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:39:56,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:39:56,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1282779464, now seen corresponding path program 1 times [2022-12-12 11:39:56,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:39:56,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274753911] [2022-12-12 11:39:56,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:39:56,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:39:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:39:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:39:56,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:39:56,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274753911] [2022-12-12 11:39:56,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274753911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:39:56,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:39:56,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:39:56,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817536335] [2022-12-12 11:39:56,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:39:56,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:39:56,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:39:56,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:39:56,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:39:56,926 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 92 [2022-12-12 11:39:56,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 68.85714285714286) internal successors, (482), 7 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:39:56,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:39:56,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 92 [2022-12-12 11:39:56,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:39:57,329 INFO L130 PetriNetUnfolder]: 319/935 cut-off events. [2022-12-12 11:39:57,330 INFO L131 PetriNetUnfolder]: For 237/420 co-relation queries the response was YES. [2022-12-12 11:39:57,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1806 conditions, 935 events. 319/935 cut-off events. For 237/420 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5706 event pairs, 76 based on Foata normal form. 0/897 useless extension candidates. Maximal degree in co-relation 1755. Up to 293 conditions per place. [2022-12-12 11:39:57,338 INFO L137 encePairwiseOnDemand]: 84/92 looper letters, 26 selfloop transitions, 4 changer transitions 56/144 dead transitions. [2022-12-12 11:39:57,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 144 transitions, 546 flow [2022-12-12 11:39:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:39:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:39:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 740 transitions. [2022-12-12 11:39:57,344 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8043478260869565 [2022-12-12 11:39:57,344 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 7 predicate places. [2022-12-12 11:39:57,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 144 transitions, 546 flow [2022-12-12 11:39:57,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 144 transitions, 538 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-12 11:39:57,350 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 144 transitions, 538 flow [2022-12-12 11:39:57,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.85714285714286) internal successors, (482), 7 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:39:57,351 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:39:57,351 INFO L214 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] [2022-12-12 11:39:57,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 11:39:57,351 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:39:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:39:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1924113838, now seen corresponding path program 1 times [2022-12-12 11:39:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:39:57,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866402836] [2022-12-12 11:39:57,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:39:57,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:39:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:39:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:39:57,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:39:57,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866402836] [2022-12-12 11:39:57,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866402836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:39:57,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:39:57,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:39:57,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674457115] [2022-12-12 11:39:57,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:39:57,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:39:57,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:39:57,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:39:57,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:39:57,602 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 92 [2022-12-12 11:39:57,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 144 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 69.0) internal successors, (483), 7 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:39:57,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:39:57,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 92 [2022-12-12 11:39:57,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:39:57,923 INFO L130 PetriNetUnfolder]: 433/1236 cut-off events. [2022-12-12 11:39:57,924 INFO L131 PetriNetUnfolder]: For 317/1088 co-relation queries the response was YES. [2022-12-12 11:39:57,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3174 conditions, 1236 events. 433/1236 cut-off events. For 317/1088 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8394 event pairs, 38 based on Foata normal form. 3/1215 useless extension candidates. Maximal degree in co-relation 3120. Up to 373 conditions per place. [2022-12-12 11:39:57,927 INFO L137 encePairwiseOnDemand]: 86/92 looper letters, 33 selfloop transitions, 3 changer transitions 142/236 dead transitions. [2022-12-12 11:39:57,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 236 transitions, 1350 flow [2022-12-12 11:39:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 11:39:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 11:39:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 670 transitions. [2022-12-12 11:39:57,929 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8091787439613527 [2022-12-12 11:39:57,929 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 14 predicate places. [2022-12-12 11:39:57,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 236 transitions, 1350 flow [2022-12-12 11:39:57,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 236 transitions, 1260 flow, removed 45 selfloop flow, removed 0 redundant places. [2022-12-12 11:39:57,933 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 236 transitions, 1260 flow [2022-12-12 11:39:57,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.0) internal successors, (483), 7 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:39:57,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:39:57,934 INFO L214 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] [2022-12-12 11:39:57,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 11:39:57,934 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:39:57,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:39:57,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1365163037, now seen corresponding path program 1 times [2022-12-12 11:39:57,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:39:57,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303244403] [2022-12-12 11:39:57,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:39:57,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:39:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:39:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:39:58,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:39:58,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303244403] [2022-12-12 11:39:58,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303244403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:39:58,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:39:58,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:39:58,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922860560] [2022-12-12 11:39:58,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:39:58,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:39:58,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:39:58,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:39:58,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:39:58,077 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 92 [2022-12-12 11:39:58,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 236 transitions, 1260 flow. Second operand has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:39:58,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:39:58,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 92 [2022-12-12 11:39:58,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:39:58,298 INFO L130 PetriNetUnfolder]: 334/924 cut-off events. [2022-12-12 11:39:58,298 INFO L131 PetriNetUnfolder]: For 861/1019 co-relation queries the response was YES. [2022-12-12 11:39:58,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2430 conditions, 924 events. 334/924 cut-off events. For 861/1019 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5304 event pairs, 16 based on Foata normal form. 3/898 useless extension candidates. Maximal degree in co-relation 2377. Up to 345 conditions per place. [2022-12-12 11:39:58,301 INFO L137 encePairwiseOnDemand]: 83/92 looper letters, 42 selfloop transitions, 6 changer transitions 94/212 dead transitions. [2022-12-12 11:39:58,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 212 transitions, 1238 flow [2022-12-12 11:39:58,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:39:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:39:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 779 transitions. [2022-12-12 11:39:58,304 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8467391304347827 [2022-12-12 11:39:58,304 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 23 predicate places. [2022-12-12 11:39:58,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 212 transitions, 1238 flow [2022-12-12 11:39:58,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 212 transitions, 1148 flow, removed 44 selfloop flow, removed 1 redundant places. [2022-12-12 11:39:58,307 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 212 transitions, 1148 flow [2022-12-12 11:39:58,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:39:58,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:39:58,308 INFO L214 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] [2022-12-12 11:39:58,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 11:39:58,308 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:39:58,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:39:58,308 INFO L85 PathProgramCache]: Analyzing trace with hash 376228786, now seen corresponding path program 1 times [2022-12-12 11:39:58,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:39:58,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261192735] [2022-12-12 11:39:58,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:39:58,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:39:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:39:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:39:58,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:39:58,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261192735] [2022-12-12 11:39:58,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261192735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:39:58,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:39:58,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:39:58,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908732612] [2022-12-12 11:39:58,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:39:58,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:39:58,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:39:58,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:39:58,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:39:58,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 92 [2022-12-12 11:39:58,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 212 transitions, 1148 flow. Second operand has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:39:58,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:39:58,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 92 [2022-12-12 11:39:58,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:39:58,723 INFO L130 PetriNetUnfolder]: 266/663 cut-off events. [2022-12-12 11:39:58,724 INFO L131 PetriNetUnfolder]: For 922/1214 co-relation queries the response was YES. [2022-12-12 11:39:58,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2245 conditions, 663 events. 266/663 cut-off events. For 922/1214 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3559 event pairs, 15 based on Foata normal form. 37/687 useless extension candidates. Maximal degree in co-relation 2190. Up to 224 conditions per place. [2022-12-12 11:39:58,726 INFO L137 encePairwiseOnDemand]: 83/92 looper letters, 39 selfloop transitions, 9 changer transitions 87/197 dead transitions. [2022-12-12 11:39:58,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 197 transitions, 1340 flow [2022-12-12 11:39:58,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:39:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:39:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 980 transitions. [2022-12-12 11:39:58,728 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8193979933110368 [2022-12-12 11:39:58,729 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 22 predicate places. [2022-12-12 11:39:58,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 197 transitions, 1340 flow [2022-12-12 11:39:58,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 197 transitions, 1201 flow, removed 63 selfloop flow, removed 4 redundant places. [2022-12-12 11:39:58,732 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 197 transitions, 1201 flow [2022-12-12 11:39:58,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:39:58,733 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:39:58,733 INFO L214 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, 1] [2022-12-12 11:39:58,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 11:39:58,733 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:39:58,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:39:58,733 INFO L85 PathProgramCache]: Analyzing trace with hash -686989045, now seen corresponding path program 1 times [2022-12-12 11:39:58,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:39:58,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700311671] [2022-12-12 11:39:58,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:39:58,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:39:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:39:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:39:59,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:39:59,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700311671] [2022-12-12 11:39:59,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700311671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:39:59,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:39:59,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-12 11:39:59,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541197544] [2022-12-12 11:39:59,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:39:59,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-12 11:39:59,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:39:59,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-12 11:39:59,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-12 11:39:59,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 92 [2022-12-12 11:39:59,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 197 transitions, 1201 flow. Second operand has 13 states, 13 states have (on average 64.84615384615384) internal successors, (843), 13 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:39:59,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:39:59,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 92 [2022-12-12 11:39:59,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:40:00,138 INFO L130 PetriNetUnfolder]: 377/1024 cut-off events. [2022-12-12 11:40:00,138 INFO L131 PetriNetUnfolder]: For 1782/1975 co-relation queries the response was YES. [2022-12-12 11:40:00,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3210 conditions, 1024 events. 377/1024 cut-off events. For 1782/1975 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6750 event pairs, 22 based on Foata normal form. 12/1023 useless extension candidates. Maximal degree in co-relation 3145. Up to 269 conditions per place. [2022-12-12 11:40:00,142 INFO L137 encePairwiseOnDemand]: 76/92 looper letters, 28 selfloop transitions, 19 changer transitions 134/244 dead transitions. [2022-12-12 11:40:00,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 244 transitions, 1887 flow [2022-12-12 11:40:00,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-12 11:40:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-12 11:40:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 928 transitions. [2022-12-12 11:40:00,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7204968944099379 [2022-12-12 11:40:00,150 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 31 predicate places. [2022-12-12 11:40:00,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 244 transitions, 1887 flow [2022-12-12 11:40:00,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 244 transitions, 1775 flow, removed 53 selfloop flow, removed 3 redundant places. [2022-12-12 11:40:00,155 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 244 transitions, 1775 flow [2022-12-12 11:40:00,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.84615384615384) internal successors, (843), 13 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:40:00,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:40:00,156 INFO L214 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, 1] [2022-12-12 11:40:00,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 11:40:00,157 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:40:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:40:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash 165571283, now seen corresponding path program 2 times [2022-12-12 11:40:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:40:00,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111111288] [2022-12-12 11:40:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:40:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:40:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:40:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:40:00,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:40:00,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111111288] [2022-12-12 11:40:00,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111111288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:40:00,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:40:00,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 11:40:00,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060123862] [2022-12-12 11:40:00,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:40:00,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 11:40:00,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:40:00,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 11:40:00,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-12 11:40:00,389 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 92 [2022-12-12 11:40:00,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 244 transitions, 1775 flow. Second operand has 8 states, 8 states have (on average 67.75) internal successors, (542), 8 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:40:00,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:40:00,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 92 [2022-12-12 11:40:00,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:40:00,615 INFO L130 PetriNetUnfolder]: 589/1572 cut-off events. [2022-12-12 11:40:00,616 INFO L131 PetriNetUnfolder]: For 3664/4548 co-relation queries the response was YES. [2022-12-12 11:40:00,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5218 conditions, 1572 events. 589/1572 cut-off events. For 3664/4548 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11724 event pairs, 28 based on Foata normal form. 54/1609 useless extension candidates. Maximal degree in co-relation 5154. Up to 353 conditions per place. [2022-12-12 11:40:00,643 INFO L137 encePairwiseOnDemand]: 82/92 looper letters, 22 selfloop transitions, 5 changer transitions 232/316 dead transitions. [2022-12-12 11:40:00,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 316 transitions, 2863 flow [2022-12-12 11:40:00,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 11:40:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 11:40:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 558 transitions. [2022-12-12 11:40:00,647 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7581521739130435 [2022-12-12 11:40:00,647 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 35 predicate places. [2022-12-12 11:40:00,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 316 transitions, 2863 flow [2022-12-12 11:40:00,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 316 transitions, 2693 flow, removed 63 selfloop flow, removed 3 redundant places. [2022-12-12 11:40:00,657 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 316 transitions, 2693 flow [2022-12-12 11:40:00,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 67.75) internal successors, (542), 8 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:40:00,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:40:00,657 INFO L214 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, 1] [2022-12-12 11:40:00,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 11:40:00,658 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:40:00,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:40:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash -702967087, now seen corresponding path program 3 times [2022-12-12 11:40:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:40:00,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949272727] [2022-12-12 11:40:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:40:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:40:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:40:00,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 11:40:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:40:00,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 11:40:00,791 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 11:40:00,792 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 11:40:00,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-12 11:40:00,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 11:40:00,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 11:40:00,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-12 11:40:00,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 11:40:00,794 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-12-12 11:40:00,799 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 11:40:00,799 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 11:40:00,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 11:40:00 BasicIcfg [2022-12-12 11:40:00,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 11:40:00,885 INFO L158 Benchmark]: Toolchain (without parser) took 6050.72ms. Allocated memory was 221.2MB in the beginning and 370.1MB in the end (delta: 148.9MB). Free memory was 194.8MB in the beginning and 287.8MB in the end (delta: -93.0MB). Peak memory consumption was 57.4MB. Max. memory is 8.0GB. [2022-12-12 11:40:00,885 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 221.2MB. Free memory is still 197.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:40:00,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.34ms. Allocated memory is still 221.2MB. Free memory was 194.2MB in the beginning and 167.9MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 11:40:00,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.62ms. Allocated memory is still 221.2MB. Free memory was 167.9MB in the beginning and 165.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:40:00,886 INFO L158 Benchmark]: Boogie Preprocessor took 25.88ms. Allocated memory is still 221.2MB. Free memory was 165.4MB in the beginning and 163.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:40:00,886 INFO L158 Benchmark]: RCFGBuilder took 596.34ms. Allocated memory is still 221.2MB. Free memory was 163.3MB in the beginning and 126.1MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-12 11:40:00,886 INFO L158 Benchmark]: TraceAbstraction took 4935.08ms. Allocated memory was 221.2MB in the beginning and 370.1MB in the end (delta: 148.9MB). Free memory was 125.0MB in the beginning and 287.8MB in the end (delta: -162.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:40:00,887 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 221.2MB. Free memory is still 197.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 424.34ms. Allocated memory is still 221.2MB. Free memory was 194.2MB in the beginning and 167.9MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.62ms. Allocated memory is still 221.2MB. Free memory was 167.9MB in the beginning and 165.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.88ms. Allocated memory is still 221.2MB. Free memory was 165.4MB in the beginning and 163.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 596.34ms. Allocated memory is still 221.2MB. Free memory was 163.3MB in the beginning and 126.1MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 4935.08ms. Allocated memory was 221.2MB in the beginning and 370.1MB in the end (delta: 148.9MB). Free memory was 125.0MB in the beginning and 287.8MB in the end (delta: -162.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L729] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0] [L730] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0] [L731] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L831] 0 pthread_t t0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0={5: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L832] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=-1, t0={5: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L833] 0 pthread_t t1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, t1={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 1 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=0, t0={5:0}, t1={3:0}, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 y$flush_delayed = weak$$choice2 [L796] 2 y$mem_tmp = y [L797] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L798] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L799] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L800] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L801] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L803] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = y [L805] 2 y = y$flush_delayed ? y$mem_tmp : y [L806] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L809] 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) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 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 [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L775] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L776] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L777] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 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 [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 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 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 367 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 367 mSDsluCounter, 327 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 260 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 781 IncrementalHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 67 mSDtfsCounter, 781 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2693occurred in iteration=7, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 614 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 442 ConstructedInterpolants, 0 QuantifiedInterpolants, 2480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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! [2022-12-12 11:40:00,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...