/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:15:40,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:15:40,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:15:40,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:15:40,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:15:40,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:15:40,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:15:40,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:15:40,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:15:40,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:15:40,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:15:40,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:15:40,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:15:40,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:15:40,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:15:40,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:15:40,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:15:40,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:15:40,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:15:40,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:15:40,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:15:40,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:15:40,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:15:40,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:15:40,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:15:40,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:15:40,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:15:40,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:15:40,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:15:40,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:15:40,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:15:40,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:15:40,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:15:40,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:15:40,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:15:40,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:15:40,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:15:40,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:15:40,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:15:40,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:15:40,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:15:40,289 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-VariableLbe.epf [2023-01-27 18:15:40,334 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:15:40,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:15:40,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:15:40,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:15:40,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:15:40,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:15:40,336 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:15:40,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:15:40,336 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:15:40,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:15:40,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:15:40,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:15:40,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:15:40,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:15:40,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:15:40,337 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:15:40,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:15:40,337 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:15:40,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:15:40,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:15:40,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:15:40,338 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:15:40,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:15:40,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:15:40,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:15:40,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:15:40,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:15:40,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:15:40,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:15:40,339 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:15:40,339 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:15:40,339 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 18:15:40,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:15:40,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:15:40,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:15:40,715 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:15:40,733 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:15:40,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2023-01-27 18:15:42,431 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:15:42,723 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:15:42,723 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2023-01-27 18:15:42,739 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/534e1d047/ec31212664f449ac891f306fab0e3de2/FLAGc83f59919 [2023-01-27 18:15:42,754 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/534e1d047/ec31212664f449ac891f306fab0e3de2 [2023-01-27 18:15:42,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:15:42,757 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:15:42,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:15:42,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:15:42,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:15:42,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:15:42" (1/1) ... [2023-01-27 18:15:42,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b48df6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:42, skipping insertion in model container [2023-01-27 18:15:42,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:15:42" (1/1) ... [2023-01-27 18:15:42,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:15:42,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:15:43,091 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i[994,1007] [2023-01-27 18:15:43,271 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:15:43,286 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:15:43,295 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i[994,1007] [2023-01-27 18:15:43,354 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:15:43,413 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:15:43,413 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:15:43,418 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:15:43,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:43 WrapperNode [2023-01-27 18:15:43,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:15:43,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:15:43,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:15:43,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:15:43,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:43" (1/1) ... [2023-01-27 18:15:43,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:43" (1/1) ... [2023-01-27 18:15:43,519 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2023-01-27 18:15:43,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:15:43,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:15:43,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:15:43,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:15:43,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:43" (1/1) ... [2023-01-27 18:15:43,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:43" (1/1) ... [2023-01-27 18:15:43,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:43" (1/1) ... [2023-01-27 18:15:43,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:43" (1/1) ... [2023-01-27 18:15:43,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:43" (1/1) ... [2023-01-27 18:15:43,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:43" (1/1) ... [2023-01-27 18:15:43,575 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:43" (1/1) ... [2023-01-27 18:15:43,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:43" (1/1) ... [2023-01-27 18:15:43,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:15:43,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:15:43,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:15:43,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:15:43,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:43" (1/1) ... [2023-01-27 18:15:43,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:15:43,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:15:43,654 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) [2023-01-27 18:15:43,713 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 [2023-01-27 18:15:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 18:15:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:15:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:15:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:15:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:15:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:15:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:15:43,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:15:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:15:43,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:15:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:15:43,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:15:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:15:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:15:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:15:43,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:15:43,771 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:15:44,022 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:15:44,024 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:15:44,739 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:15:45,145 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:15:45,145 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:15:45,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:15:45 BoogieIcfgContainer [2023-01-27 18:15:45,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:15:45,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:15:45,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:15:45,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:15:45,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:15:42" (1/3) ... [2023-01-27 18:15:45,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5650a2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:15:45, skipping insertion in model container [2023-01-27 18:15:45,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:43" (2/3) ... [2023-01-27 18:15:45,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5650a2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:15:45, skipping insertion in model container [2023-01-27 18:15:45,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:15:45" (3/3) ... [2023-01-27 18:15:45,155 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.oepc.i [2023-01-27 18:15:45,177 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:15:45,177 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 18:15:45,177 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:15:45,282 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:15:45,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2023-01-27 18:15:45,437 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2023-01-27 18:15:45,437 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:15:45,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-01-27 18:15:45,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2023-01-27 18:15:45,450 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2023-01-27 18:15:45,454 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:15:45,485 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2023-01-27 18:15:45,488 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2023-01-27 18:15:45,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2023-01-27 18:15:45,546 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2023-01-27 18:15:45,546 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:15:45,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2023-01-27 18:15:45,548 INFO L119 LiptonReduction]: Number of co-enabled transitions 1152 [2023-01-27 18:15:56,284 INFO L134 LiptonReduction]: Checked pairs total: 3277 [2023-01-27 18:15:56,284 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-01-27 18:15:56,303 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:15:56,311 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;@7069548a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:15:56,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-27 18:15:56,348 INFO L130 PetriNetUnfolder]: 1/21 cut-off events. [2023-01-27 18:15:56,349 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:15:56,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:56,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:56,350 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 18:15:56,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:56,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1721835307, now seen corresponding path program 1 times [2023-01-27 18:15:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:56,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433568251] [2023-01-27 18:15:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:57,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:57,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433568251] [2023-01-27 18:15:57,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433568251] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:57,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:57,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:15:57,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573993940] [2023-01-27 18:15:57,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:57,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:15:57,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:57,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:15:57,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:15:57,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 216 [2023-01-27 18:15:57,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 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) [2023-01-27 18:15:57,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:57,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 216 [2023-01-27 18:15:57,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:58,069 INFO L130 PetriNetUnfolder]: 768/1178 cut-off events. [2023-01-27 18:15:58,069 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-01-27 18:15:58,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2398 conditions, 1178 events. 768/1178 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5270 event pairs, 227 based on Foata normal form. 120/1237 useless extension candidates. Maximal degree in co-relation 2387. Up to 727 conditions per place. [2023-01-27 18:15:58,090 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 26 selfloop transitions, 2 changer transitions 17/46 dead transitions. [2023-01-27 18:15:58,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 194 flow [2023-01-27 18:15:58,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:15:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:15:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-01-27 18:15:58,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2023-01-27 18:15:58,107 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-01-27 18:15:58,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-01-27 18:15:58,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:58,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-01-27 18:15:58,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-01-27 18:15:58,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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) [2023-01-27 18:15:58,137 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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) [2023-01-27 18:15:58,138 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 5 states and 594 transitions. [2023-01-27 18:15:58,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 194 flow [2023-01-27 18:15:58,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 46 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:15:58,142 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 58 flow [2023-01-27 18:15:58,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-01-27 18:15:58,145 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-01-27 18:15:58,145 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 58 flow [2023-01-27 18:15:58,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 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) [2023-01-27 18:15:58,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:58,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:58,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:15:58,147 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 18:15:58,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1356866732, now seen corresponding path program 1 times [2023-01-27 18:15:58,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:58,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467452512] [2023-01-27 18:15:58,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:58,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:58,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:58,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467452512] [2023-01-27 18:15:58,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467452512] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:58,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:58,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:15:58,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980845025] [2023-01-27 18:15:58,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:58,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:15:58,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:58,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:15:58,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:15:58,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 216 [2023-01-27 18:15:58,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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) [2023-01-27 18:15:58,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:58,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 216 [2023-01-27 18:15:58,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:58,874 INFO L130 PetriNetUnfolder]: 446/777 cut-off events. [2023-01-27 18:15:58,874 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2023-01-27 18:15:58,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1609 conditions, 777 events. 446/777 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3731 event pairs, 87 based on Foata normal form. 36/812 useless extension candidates. Maximal degree in co-relation 1596. Up to 497 conditions per place. [2023-01-27 18:15:58,886 INFO L137 encePairwiseOnDemand]: 212/216 looper letters, 28 selfloop transitions, 2 changer transitions 13/45 dead transitions. [2023-01-27 18:15:58,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 200 flow [2023-01-27 18:15:58,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:15:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:15:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-01-27 18:15:58,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2023-01-27 18:15:58,887 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-01-27 18:15:58,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-01-27 18:15:58,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:58,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-01-27 18:15:58,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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) [2023-01-27 18:15:58,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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) [2023-01-27 18:15:58,890 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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) [2023-01-27 18:15:58,891 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 58 flow. Second operand 5 states and 590 transitions. [2023-01-27 18:15:58,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 200 flow [2023-01-27 18:15:58,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 192 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 18:15:58,907 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 62 flow [2023-01-27 18:15:58,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-01-27 18:15:58,908 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-01-27 18:15:58,908 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 62 flow [2023-01-27 18:15:58,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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) [2023-01-27 18:15:58,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:58,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:58,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:15:58,909 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 18:15:58,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash 886784425, now seen corresponding path program 1 times [2023-01-27 18:15:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:58,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573649942] [2023-01-27 18:15:58,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:58,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:16:01,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:01,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573649942] [2023-01-27 18:16:01,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573649942] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:01,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:01,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:16:01,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874831941] [2023-01-27 18:16:01,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:01,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:16:01,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:01,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:16:01,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:16:01,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 216 [2023-01-27 18:16:01,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 87.71428571428571) internal successors, (614), 7 states have internal predecessors, (614), 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) [2023-01-27 18:16:01,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:01,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 216 [2023-01-27 18:16:01,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:01,629 INFO L130 PetriNetUnfolder]: 490/807 cut-off events. [2023-01-27 18:16:01,629 INFO L131 PetriNetUnfolder]: For 217/217 co-relation queries the response was YES. [2023-01-27 18:16:01,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 807 events. 490/807 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3749 event pairs, 68 based on Foata normal form. 24/828 useless extension candidates. Maximal degree in co-relation 1862. Up to 472 conditions per place. [2023-01-27 18:16:01,647 INFO L137 encePairwiseOnDemand]: 209/216 looper letters, 32 selfloop transitions, 6 changer transitions 10/50 dead transitions. [2023-01-27 18:16:01,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 50 transitions, 237 flow [2023-01-27 18:16:01,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:16:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:16:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 566 transitions. [2023-01-27 18:16:01,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4367283950617284 [2023-01-27 18:16:01,653 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 566 transitions. [2023-01-27 18:16:01,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 566 transitions. [2023-01-27 18:16:01,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:01,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 566 transitions. [2023-01-27 18:16:01,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 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) [2023-01-27 18:16:01,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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) [2023-01-27 18:16:01,665 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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) [2023-01-27 18:16:01,665 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 62 flow. Second operand 6 states and 566 transitions. [2023-01-27 18:16:01,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 50 transitions, 237 flow [2023-01-27 18:16:01,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 223 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-01-27 18:16:01,678 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 96 flow [2023-01-27 18:16:01,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2023-01-27 18:16:01,682 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-01-27 18:16:01,690 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 96 flow [2023-01-27 18:16:01,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.71428571428571) internal successors, (614), 7 states have internal predecessors, (614), 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) [2023-01-27 18:16:01,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:01,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:01,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:16:01,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 18:16:01,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:01,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1329325979, now seen corresponding path program 2 times [2023-01-27 18:16:01,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:01,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052126050] [2023-01-27 18:16:01,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:01,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:16:03,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:03,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052126050] [2023-01-27 18:16:03,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052126050] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:03,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:03,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:16:03,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001289742] [2023-01-27 18:16:03,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:03,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:16:03,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:03,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:16:03,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:16:03,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 216 [2023-01-27 18:16:03,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 96 flow. Second operand has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 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) [2023-01-27 18:16:03,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:03,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 216 [2023-01-27 18:16:03,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:04,304 INFO L130 PetriNetUnfolder]: 464/756 cut-off events. [2023-01-27 18:16:04,305 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES. [2023-01-27 18:16:04,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1973 conditions, 756 events. 464/756 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3338 event pairs, 83 based on Foata normal form. 24/778 useless extension candidates. Maximal degree in co-relation 1957. Up to 460 conditions per place. [2023-01-27 18:16:04,308 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 32 selfloop transitions, 5 changer transitions 10/49 dead transitions. [2023-01-27 18:16:04,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 258 flow [2023-01-27 18:16:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:16:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:16:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions. [2023-01-27 18:16:04,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44367283950617287 [2023-01-27 18:16:04,326 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 575 transitions. [2023-01-27 18:16:04,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions. [2023-01-27 18:16:04,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:04,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions. [2023-01-27 18:16:04,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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) [2023-01-27 18:16:04,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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) [2023-01-27 18:16:04,334 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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) [2023-01-27 18:16:04,334 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 96 flow. Second operand 6 states and 575 transitions. [2023-01-27 18:16:04,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 258 flow [2023-01-27 18:16:04,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 249 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-27 18:16:04,337 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 112 flow [2023-01-27 18:16:04,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2023-01-27 18:16:04,338 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-01-27 18:16:04,338 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 112 flow [2023-01-27 18:16:04,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 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) [2023-01-27 18:16:04,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:04,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:04,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:16:04,339 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 18:16:04,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:04,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1466310273, now seen corresponding path program 1 times [2023-01-27 18:16:04,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:04,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446330104] [2023-01-27 18:16:04,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:16:04,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:04,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446330104] [2023-01-27 18:16:04,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446330104] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:04,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:04,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:16:04,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356821308] [2023-01-27 18:16:04,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:04,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:16:04,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:04,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:16:04,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:16:04,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 216 [2023-01-27 18:16:04,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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) [2023-01-27 18:16:04,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:04,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 216 [2023-01-27 18:16:04,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:05,129 INFO L130 PetriNetUnfolder]: 373/640 cut-off events. [2023-01-27 18:16:05,129 INFO L131 PetriNetUnfolder]: For 514/514 co-relation queries the response was YES. [2023-01-27 18:16:05,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1784 conditions, 640 events. 373/640 cut-off events. For 514/514 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2852 event pairs, 57 based on Foata normal form. 56/692 useless extension candidates. Maximal degree in co-relation 1766. Up to 259 conditions per place. [2023-01-27 18:16:05,132 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 45 selfloop transitions, 5 changer transitions 1/53 dead transitions. [2023-01-27 18:16:05,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 334 flow [2023-01-27 18:16:05,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:16:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:16:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2023-01-27 18:16:05,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5381944444444444 [2023-01-27 18:16:05,133 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 465 transitions. [2023-01-27 18:16:05,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions. [2023-01-27 18:16:05,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:05,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions. [2023-01-27 18:16:05,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 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) [2023-01-27 18:16:05,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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) [2023-01-27 18:16:05,135 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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) [2023-01-27 18:16:05,136 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 112 flow. Second operand 4 states and 465 transitions. [2023-01-27 18:16:05,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 334 flow [2023-01-27 18:16:05,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 320 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-27 18:16:05,138 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 138 flow [2023-01-27 18:16:05,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-01-27 18:16:05,154 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-01-27 18:16:05,154 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 138 flow [2023-01-27 18:16:05,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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) [2023-01-27 18:16:05,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:05,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:05,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:16:05,154 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 18:16:05,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:05,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2014530009, now seen corresponding path program 1 times [2023-01-27 18:16:05,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:05,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847617534] [2023-01-27 18:16:05,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:05,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:16:05,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:05,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847617534] [2023-01-27 18:16:05,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847617534] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:05,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:05,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:16:05,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898448334] [2023-01-27 18:16:05,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:05,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:16:05,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:05,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:16:05,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:16:05,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 216 [2023-01-27 18:16:05,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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) [2023-01-27 18:16:05,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:05,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 216 [2023-01-27 18:16:05,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:05,880 INFO L130 PetriNetUnfolder]: 690/1169 cut-off events. [2023-01-27 18:16:05,880 INFO L131 PetriNetUnfolder]: For 1199/1199 co-relation queries the response was YES. [2023-01-27 18:16:05,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3821 conditions, 1169 events. 690/1169 cut-off events. For 1199/1199 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5463 event pairs, 202 based on Foata normal form. 14/1183 useless extension candidates. Maximal degree in co-relation 3802. Up to 665 conditions per place. [2023-01-27 18:16:05,885 INFO L137 encePairwiseOnDemand]: 212/216 looper letters, 44 selfloop transitions, 2 changer transitions 8/54 dead transitions. [2023-01-27 18:16:05,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 360 flow [2023-01-27 18:16:05,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:16:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:16:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2023-01-27 18:16:05,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5439814814814815 [2023-01-27 18:16:05,887 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 470 transitions. [2023-01-27 18:16:05,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 470 transitions. [2023-01-27 18:16:05,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:05,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 470 transitions. [2023-01-27 18:16:05,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 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) [2023-01-27 18:16:05,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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) [2023-01-27 18:16:05,889 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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) [2023-01-27 18:16:05,889 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 138 flow. Second operand 4 states and 470 transitions. [2023-01-27 18:16:05,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 360 flow [2023-01-27 18:16:05,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 345 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-27 18:16:05,902 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 144 flow [2023-01-27 18:16:05,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2023-01-27 18:16:05,903 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2023-01-27 18:16:05,903 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 144 flow [2023-01-27 18:16:05,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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) [2023-01-27 18:16:05,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:05,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:05,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:16:05,904 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 18:16:05,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:05,904 INFO L85 PathProgramCache]: Analyzing trace with hash 552522859, now seen corresponding path program 2 times [2023-01-27 18:16:05,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:05,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060310727] [2023-01-27 18:16:05,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:05,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:06,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:16:06,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:06,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060310727] [2023-01-27 18:16:06,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060310727] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:06,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:06,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:16:06,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338652148] [2023-01-27 18:16:06,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:06,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:16:06,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:06,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:16:06,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:16:06,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 216 [2023-01-27 18:16:06,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 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) [2023-01-27 18:16:06,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:06,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 216 [2023-01-27 18:16:06,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:07,213 INFO L130 PetriNetUnfolder]: 312/595 cut-off events. [2023-01-27 18:16:07,213 INFO L131 PetriNetUnfolder]: For 596/597 co-relation queries the response was YES. [2023-01-27 18:16:07,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1930 conditions, 595 events. 312/595 cut-off events. For 596/597 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2897 event pairs, 37 based on Foata normal form. 57/649 useless extension candidates. Maximal degree in co-relation 1910. Up to 252 conditions per place. [2023-01-27 18:16:07,216 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 54 selfloop transitions, 8 changer transitions 1/65 dead transitions. [2023-01-27 18:16:07,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 432 flow [2023-01-27 18:16:07,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:16:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:16:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2023-01-27 18:16:07,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.537962962962963 [2023-01-27 18:16:07,218 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 581 transitions. [2023-01-27 18:16:07,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 581 transitions. [2023-01-27 18:16:07,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:07,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 581 transitions. [2023-01-27 18:16:07,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 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) [2023-01-27 18:16:07,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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) [2023-01-27 18:16:07,220 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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) [2023-01-27 18:16:07,220 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 144 flow. Second operand 5 states and 581 transitions. [2023-01-27 18:16:07,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 432 flow [2023-01-27 18:16:07,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 425 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:16:07,224 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 188 flow [2023-01-27 18:16:07,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2023-01-27 18:16:07,224 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2023-01-27 18:16:07,224 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 188 flow [2023-01-27 18:16:07,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 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) [2023-01-27 18:16:07,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:07,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:07,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:16:07,225 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 18:16:07,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:07,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1731125736, now seen corresponding path program 1 times [2023-01-27 18:16:07,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:07,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926760895] [2023-01-27 18:16:07,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:07,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:16:07,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:07,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926760895] [2023-01-27 18:16:07,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926760895] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:07,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:07,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:16:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804986832] [2023-01-27 18:16:07,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:07,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:16:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:07,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:16:07,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:16:07,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 216 [2023-01-27 18:16:07,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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) [2023-01-27 18:16:07,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:07,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 216 [2023-01-27 18:16:07,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:08,444 INFO L130 PetriNetUnfolder]: 206/403 cut-off events. [2023-01-27 18:16:08,446 INFO L131 PetriNetUnfolder]: For 806/807 co-relation queries the response was YES. [2023-01-27 18:16:08,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 403 events. 206/403 cut-off events. For 806/807 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1856 event pairs, 36 based on Foata normal form. 18/418 useless extension candidates. Maximal degree in co-relation 1542. Up to 166 conditions per place. [2023-01-27 18:16:08,448 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 37 selfloop transitions, 11 changer transitions 6/56 dead transitions. [2023-01-27 18:16:08,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 409 flow [2023-01-27 18:16:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:16:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:16:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 679 transitions. [2023-01-27 18:16:08,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5239197530864198 [2023-01-27 18:16:08,450 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 679 transitions. [2023-01-27 18:16:08,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 679 transitions. [2023-01-27 18:16:08,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:08,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 679 transitions. [2023-01-27 18:16:08,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 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) [2023-01-27 18:16:08,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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) [2023-01-27 18:16:08,453 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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) [2023-01-27 18:16:08,453 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 188 flow. Second operand 6 states and 679 transitions. [2023-01-27 18:16:08,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 409 flow [2023-01-27 18:16:08,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 360 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-01-27 18:16:08,465 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 182 flow [2023-01-27 18:16:08,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2023-01-27 18:16:08,466 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2023-01-27 18:16:08,467 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 182 flow [2023-01-27 18:16:08,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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) [2023-01-27 18:16:08,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:08,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:08,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:16:08,467 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 18:16:08,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:08,468 INFO L85 PathProgramCache]: Analyzing trace with hash -275792742, now seen corresponding path program 1 times [2023-01-27 18:16:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:08,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061492619] [2023-01-27 18:16:08,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:08,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:16:08,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:16:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:16:08,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:16:08,983 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:16:08,986 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-27 18:16:08,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-27 18:16:08,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-27 18:16:08,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-27 18:16:08,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:16:08,988 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2023-01-27 18:16:09,003 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:16:09,003 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:16:09,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:16:09 BasicIcfg [2023-01-27 18:16:09,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:16:09,220 INFO L158 Benchmark]: Toolchain (without parser) took 26463.77ms. Allocated memory was 614.5MB in the beginning and 926.9MB in the end (delta: 312.5MB). Free memory was 560.6MB in the beginning and 689.0MB in the end (delta: -128.3MB). Peak memory consumption was 187.3MB. Max. memory is 16.0GB. [2023-01-27 18:16:09,221 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 614.5MB. Free memory is still 560.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:16:09,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 660.82ms. Allocated memory is still 614.5MB. Free memory was 560.4MB in the beginning and 535.8MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:16:09,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.79ms. Allocated memory is still 614.5MB. Free memory was 535.6MB in the beginning and 533.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-27 18:16:09,221 INFO L158 Benchmark]: Boogie Preprocessor took 58.33ms. Allocated memory is still 614.5MB. Free memory was 533.2MB in the beginning and 530.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:16:09,221 INFO L158 Benchmark]: RCFGBuilder took 1567.74ms. Allocated memory is still 614.5MB. Free memory was 530.9MB in the beginning and 517.8MB in the end (delta: 13.1MB). Peak memory consumption was 28.2MB. Max. memory is 16.0GB. [2023-01-27 18:16:09,221 INFO L158 Benchmark]: TraceAbstraction took 24069.39ms. Allocated memory was 614.5MB in the beginning and 926.9MB in the end (delta: 312.5MB). Free memory was 516.7MB in the beginning and 689.0MB in the end (delta: -172.3MB). Peak memory consumption was 140.2MB. Max. memory is 16.0GB. [2023-01-27 18:16:09,225 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.13ms. Allocated memory is still 614.5MB. Free memory is still 560.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 660.82ms. Allocated memory is still 614.5MB. Free memory was 560.4MB in the beginning and 535.8MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 100.79ms. Allocated memory is still 614.5MB. Free memory was 535.6MB in the beginning and 533.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 58.33ms. Allocated memory is still 614.5MB. Free memory was 533.2MB in the beginning and 530.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1567.74ms. Allocated memory is still 614.5MB. Free memory was 530.9MB in the beginning and 517.8MB in the end (delta: 13.1MB). Peak memory consumption was 28.2MB. Max. memory is 16.0GB. * TraceAbstraction took 24069.39ms. Allocated memory was 614.5MB in the beginning and 926.9MB in the end (delta: 312.5MB). Free memory was 516.7MB in the beginning and 689.0MB in the end (delta: -172.3MB). Peak memory consumption was 140.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.8s, 118 PlacesBefore, 31 PlacesAfterwards, 109 TransitionsBefore, 22 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 3277 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1336, independent: 1165, independent conditional: 0, independent unconditional: 1165, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 633, independent: 593, independent conditional: 0, independent unconditional: 593, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1336, independent: 572, independent conditional: 0, independent unconditional: 572, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 633, unknown conditional: 0, unknown unconditional: 633] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1681; [L849] FCALL, FORK 0 pthread_create(&t1681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1681, ((void *)0), P0, ((void *)0))=-2, t1681={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L850] 0 pthread_t t1682; [L851] FCALL, FORK 0 pthread_create(&t1682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1682, ((void *)0), P1, ((void *)0))=-1, t1681={6:0}, t1682={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L852] 0 pthread_t t1683; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L780] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L792] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=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=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __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=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __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$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L853] FCALL, FORK 0 pthread_create(&t1683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1683, ((void *)0), P2, ((void *)0))=0, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L823] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 851]: 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: 849]: 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: 853]: 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 7 procedures, 148 locations, 4 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: 23.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 635 IncrementalHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 4 mSDtfsCounter, 635 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=7, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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! [2023-01-27 18:16:09,285 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...