/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:58:05,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:58:05,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:58:05,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:58:05,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:58:05,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:58:05,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:58:05,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:58:05,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:58:05,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:58:05,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:58:05,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:58:05,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:58:05,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:58:05,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:58:05,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:58:05,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:58:05,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:58:05,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:58:05,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:58:05,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:58:05,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:58:05,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:58:05,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:58:05,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:58:05,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:58:05,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:58:05,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:58:05,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:58:05,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:58:05,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:58:05,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:58:05,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:58:05,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:58:05,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:58:05,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:58:05,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:58:05,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:58:05,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:58:05,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:58:05,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:58:05,345 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:58:05,360 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:58:05,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:58:05,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:58:05,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:58:05,361 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:58:05,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:58:05,362 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:58:05,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:58:05,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:58:05,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:58:05,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:58:05,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:58:05,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:58:05,363 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:58:05,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:58:05,363 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:58:05,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:58:05,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:58:05,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:58:05,363 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:58:05,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:58:05,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:58:05,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:58:05,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:58:05,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:58:05,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:58:05,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:58:05,365 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:58:05,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:58:05,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:58:05,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:58:05,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:58:05,609 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:58:05,609 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:58:05,610 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i [2022-12-13 11:58:06,606 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:58:06,831 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:58:06,832 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i [2022-12-13 11:58:06,868 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96ccc6313/5e544f933baa4862af7a4c8b5482a341/FLAG9f7d1c18b [2022-12-13 11:58:06,881 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96ccc6313/5e544f933baa4862af7a4c8b5482a341 [2022-12-13 11:58:06,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:58:06,884 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:58:06,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:58:06,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:58:06,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:58:06,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:58:06" (1/1) ... [2022-12-13 11:58:06,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5c2cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:06, skipping insertion in model container [2022-12-13 11:58:06,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:58:06" (1/1) ... [2022-12-13 11:58:06,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:58:06,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:58:07,079 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i[988,1001] [2022-12-13 11:58:07,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:58:07,266 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:58:07,274 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i[988,1001] [2022-12-13 11:58:07,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:07,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:07,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:58:07,363 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:58:07,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:07 WrapperNode [2022-12-13 11:58:07,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:58:07,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:58:07,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:58:07,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:58:07,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:07" (1/1) ... [2022-12-13 11:58:07,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:07" (1/1) ... [2022-12-13 11:58:07,396 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-12-13 11:58:07,396 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:58:07,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:58:07,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:58:07,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:58:07,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:07" (1/1) ... [2022-12-13 11:58:07,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:07" (1/1) ... [2022-12-13 11:58:07,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:07" (1/1) ... [2022-12-13 11:58:07,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:07" (1/1) ... [2022-12-13 11:58:07,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:07" (1/1) ... [2022-12-13 11:58:07,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:07" (1/1) ... [2022-12-13 11:58:07,413 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:07" (1/1) ... [2022-12-13 11:58:07,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:07" (1/1) ... [2022-12-13 11:58:07,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:58:07,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:58:07,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:58:07,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:58:07,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:07" (1/1) ... [2022-12-13 11:58:07,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:58:07,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:58:07,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:58:07,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:58:07,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:58:07,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:58:07,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:58:07,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:58:07,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:58:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:58:07,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:58:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:58:07,500 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:58:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:58:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:58:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:58:07,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:58:07,502 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:58:07,607 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:58:07,608 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:58:07,953 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:58:08,063 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:58:08,064 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:58:08,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:58:08 BoogieIcfgContainer [2022-12-13 11:58:08,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:58:08,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:58:08,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:58:08,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:58:08,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:58:06" (1/3) ... [2022-12-13 11:58:08,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3faf1632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:58:08, skipping insertion in model container [2022-12-13 11:58:08,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:07" (2/3) ... [2022-12-13 11:58:08,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3faf1632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:58:08, skipping insertion in model container [2022-12-13 11:58:08,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:58:08" (3/3) ... [2022-12-13 11:58:08,073 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.oepc.i [2022-12-13 11:58:08,086 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:58:08,086 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:58:08,086 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:58:08,123 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:58:08,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2022-12-13 11:58:08,187 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-13 11:58:08,187 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:08,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-13 11:58:08,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2022-12-13 11:58:08,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2022-12-13 11:58:08,194 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:08,215 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-13 11:58:08,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2022-12-13 11:58:08,234 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-13 11:58:08,234 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:08,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-13 11:58:08,236 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-13 11:58:08,237 INFO L226 LiptonReduction]: Number of co-enabled transitions 1188 [2022-12-13 11:58:12,069 INFO L241 LiptonReduction]: Total number of compositions: 73 [2022-12-13 11:58:12,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:58:12,091 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=REPEATED_LIPTON_PN, 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;@7444fd5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:58:12,091 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 11:58:12,095 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 11:58:12,095 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:12,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:12,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 11:58:12,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:12,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:12,099 INFO L85 PathProgramCache]: Analyzing trace with hash 478609, now seen corresponding path program 1 times [2022-12-13 11:58:12,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:12,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708002151] [2022-12-13 11:58:12,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:12,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:58:12,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:12,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708002151] [2022-12-13 11:58:12,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708002151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:12,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:12,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:58:12,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891504424] [2022-12-13 11:58:12,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:12,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:58:12,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:12,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:58:12,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:58:12,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52 [2022-12-13 11:58:12,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:12,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:12,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52 [2022-12-13 11:58:12,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:12,685 INFO L130 PetriNetUnfolder]: 1375/2490 cut-off events. [2022-12-13 11:58:12,685 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 11:58:12,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4748 conditions, 2490 events. 1375/2490 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 16059 event pairs, 478 based on Foata normal form. 0/1492 useless extension candidates. Maximal degree in co-relation 4738. Up to 1986 conditions per place. [2022-12-13 11:58:12,696 INFO L137 encePairwiseOnDemand]: 47/52 looper letters, 25 selfloop transitions, 2 changer transitions 47/82 dead transitions. [2022-12-13 11:58:12,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 319 flow [2022-12-13 11:58:12,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-12-13 11:58:12,706 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2022-12-13 11:58:12,708 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 110 flow. Second operand 3 states and 105 transitions. [2022-12-13 11:58:12,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 319 flow [2022-12-13 11:58:12,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:12,711 INFO L231 Difference]: Finished difference. Result has 56 places, 25 transitions, 58 flow [2022-12-13 11:58:12,712 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=56, PETRI_TRANSITIONS=25} [2022-12-13 11:58:12,716 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2022-12-13 11:58:12,716 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:12,717 INFO L89 Accepts]: Start accepts. Operand has 56 places, 25 transitions, 58 flow [2022-12-13 11:58:12,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:12,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:12,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 25 transitions, 58 flow [2022-12-13 11:58:12,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 58 flow [2022-12-13 11:58:12,729 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 11:58:12,729 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:12,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 49 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:58:12,732 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 58 flow [2022-12-13 11:58:12,732 INFO L226 LiptonReduction]: Number of co-enabled transitions 320 [2022-12-13 11:58:12,844 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:12,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 11:58:12,846 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 58 flow [2022-12-13 11:58:12,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:12,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:12,847 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:12,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:58:12,848 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:12,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:12,849 INFO L85 PathProgramCache]: Analyzing trace with hash -366768743, now seen corresponding path program 1 times [2022-12-13 11:58:12,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:12,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547521437] [2022-12-13 11:58:12,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:12,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:58:13,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:13,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547521437] [2022-12-13 11:58:13,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547521437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:13,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:13,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:58:13,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91138216] [2022-12-13 11:58:13,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:13,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:58:13,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:13,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:58:13,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:58:13,112 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 11:58:13,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:13,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:13,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 11:58:13,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:13,188 INFO L130 PetriNetUnfolder]: 376/675 cut-off events. [2022-12-13 11:58:13,188 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 11:58:13,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 675 events. 376/675 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 156 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 1352. Up to 597 conditions per place. [2022-12-13 11:58:13,190 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 24 selfloop transitions, 3 changer transitions 2/34 dead transitions. [2022-12-13 11:58:13,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 138 flow [2022-12-13 11:58:13,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-13 11:58:13,191 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 11:58:13,192 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 58 flow. Second operand 3 states and 45 transitions. [2022-12-13 11:58:13,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 138 flow [2022-12-13 11:58:13,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:13,192 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 71 flow [2022-12-13 11:58:13,193 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-13 11:58:13,193 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -25 predicate places. [2022-12-13 11:58:13,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:13,193 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 71 flow [2022-12-13 11:58:13,194 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:13,194 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:13,194 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 71 flow [2022-12-13 11:58:13,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 71 flow [2022-12-13 11:58:13,198 INFO L130 PetriNetUnfolder]: 3/40 cut-off events. [2022-12-13 11:58:13,198 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:13,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 40 events. 3/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 51. Up to 10 conditions per place. [2022-12-13 11:58:13,198 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 71 flow [2022-12-13 11:58:13,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-13 11:58:13,244 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:13,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 11:58:13,245 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 71 flow [2022-12-13 11:58:13,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:13,245 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:13,245 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:13,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:58:13,245 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:13,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:13,246 INFO L85 PathProgramCache]: Analyzing trace with hash 799927227, now seen corresponding path program 1 times [2022-12-13 11:58:13,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:13,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506453586] [2022-12-13 11:58:13,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:58:13,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:13,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506453586] [2022-12-13 11:58:13,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506453586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:13,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:13,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:58:13,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161613707] [2022-12-13 11:58:13,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:13,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:58:13,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:13,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:58:13,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:58:13,399 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 11:58:13,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:13,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:13,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 11:58:13,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:13,487 INFO L130 PetriNetUnfolder]: 231/431 cut-off events. [2022-12-13 11:58:13,488 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-13 11:58:13,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 431 events. 231/431 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1747 event pairs, 71 based on Foata normal form. 8/386 useless extension candidates. Maximal degree in co-relation 929. Up to 305 conditions per place. [2022-12-13 11:58:13,490 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 23 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-13 11:58:13,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 135 flow [2022-12-13 11:58:13,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 11:58:13,491 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-13 11:58:13,491 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 71 flow. Second operand 3 states and 44 transitions. [2022-12-13 11:58:13,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 135 flow [2022-12-13 11:58:13,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:58:13,492 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 79 flow [2022-12-13 11:58:13,492 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2022-12-13 11:58:13,493 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -24 predicate places. [2022-12-13 11:58:13,493 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:13,493 INFO L89 Accepts]: Start accepts. Operand has 34 places, 26 transitions, 79 flow [2022-12-13 11:58:13,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:13,493 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:13,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 79 flow [2022-12-13 11:58:13,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 79 flow [2022-12-13 11:58:13,497 INFO L130 PetriNetUnfolder]: 2/33 cut-off events. [2022-12-13 11:58:13,497 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-12-13 11:58:13,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 33 events. 2/33 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 84 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 46. Up to 8 conditions per place. [2022-12-13 11:58:13,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 79 flow [2022-12-13 11:58:13,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-13 11:58:13,519 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:13,519 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 11:58:13,520 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 79 flow [2022-12-13 11:58:13,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:13,520 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:13,520 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:13,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:58:13,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:13,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:13,520 INFO L85 PathProgramCache]: Analyzing trace with hash -321227019, now seen corresponding path program 1 times [2022-12-13 11:58:13,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:13,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132694216] [2022-12-13 11:58:13,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:13,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:58:13,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:13,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132694216] [2022-12-13 11:58:13,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132694216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:13,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:13,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:58:13,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212211530] [2022-12-13 11:58:13,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:13,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:58:13,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:13,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:58:13,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:58:13,597 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2022-12-13 11:58:13,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:13,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:13,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2022-12-13 11:58:13,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:13,670 INFO L130 PetriNetUnfolder]: 256/477 cut-off events. [2022-12-13 11:58:13,671 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-13 11:58:13,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 477 events. 256/477 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1934 event pairs, 146 based on Foata normal form. 10/433 useless extension candidates. Maximal degree in co-relation 1066. Up to 351 conditions per place. [2022-12-13 11:58:13,673 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 27 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-13 11:58:13,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 159 flow [2022-12-13 11:58:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-13 11:58:13,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 11:58:13,682 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 79 flow. Second operand 3 states and 45 transitions. [2022-12-13 11:58:13,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 159 flow [2022-12-13 11:58:13,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 153 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:13,684 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 84 flow [2022-12-13 11:58:13,685 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-13 11:58:13,686 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -23 predicate places. [2022-12-13 11:58:13,686 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:13,686 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 84 flow [2022-12-13 11:58:13,687 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:13,687 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:13,687 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 84 flow [2022-12-13 11:58:13,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 84 flow [2022-12-13 11:58:13,693 INFO L130 PetriNetUnfolder]: 1/31 cut-off events. [2022-12-13 11:58:13,693 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-12-13 11:58:13,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 31 events. 1/31 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 69 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 44. Up to 6 conditions per place. [2022-12-13 11:58:13,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 84 flow [2022-12-13 11:58:13,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-13 11:58:13,698 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:13,703 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 11:58:13,703 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 84 flow [2022-12-13 11:58:13,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:13,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:13,704 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:13,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:58:13,704 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:13,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash 66621011, now seen corresponding path program 1 times [2022-12-13 11:58:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:13,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863163875] [2022-12-13 11:58:13,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:13,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:58:13,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:13,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863163875] [2022-12-13 11:58:13,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863163875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:13,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:13,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:58:13,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411580080] [2022-12-13 11:58:13,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:13,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:58:13,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:13,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:58:13,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:58:13,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2022-12-13 11:58:13,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:13,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:13,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2022-12-13 11:58:13,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:13,963 INFO L130 PetriNetUnfolder]: 204/428 cut-off events. [2022-12-13 11:58:13,964 INFO L131 PetriNetUnfolder]: For 142/145 co-relation queries the response was YES. [2022-12-13 11:58:13,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 428 events. 204/428 cut-off events. For 142/145 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2065 event pairs, 35 based on Foata normal form. 54/376 useless extension candidates. Maximal degree in co-relation 1002. Up to 190 conditions per place. [2022-12-13 11:58:13,965 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 38 selfloop transitions, 8 changer transitions 2/53 dead transitions. [2022-12-13 11:58:13,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 53 transitions, 244 flow [2022-12-13 11:58:13,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:58:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:58:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-13 11:58:13,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2022-12-13 11:58:13,969 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 84 flow. Second operand 4 states and 68 transitions. [2022-12-13 11:58:13,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 53 transitions, 244 flow [2022-12-13 11:58:13,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 53 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:13,972 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 134 flow [2022-12-13 11:58:13,972 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2022-12-13 11:58:13,974 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -20 predicate places. [2022-12-13 11:58:13,974 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:13,974 INFO L89 Accepts]: Start accepts. Operand has 38 places, 31 transitions, 134 flow [2022-12-13 11:58:13,976 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:13,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:13,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 31 transitions, 134 flow [2022-12-13 11:58:13,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 134 flow [2022-12-13 11:58:13,987 INFO L130 PetriNetUnfolder]: 28/105 cut-off events. [2022-12-13 11:58:13,987 INFO L131 PetriNetUnfolder]: For 57/63 co-relation queries the response was YES. [2022-12-13 11:58:13,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 105 events. 28/105 cut-off events. For 57/63 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 476 event pairs, 9 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 266. Up to 64 conditions per place. [2022-12-13 11:58:13,988 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 134 flow [2022-12-13 11:58:13,988 INFO L226 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-13 11:58:14,006 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:14,006 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 11:58:14,006 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 134 flow [2022-12-13 11:58:14,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:14,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:14,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:14,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:58:14,007 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:14,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:14,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1520957553, now seen corresponding path program 1 times [2022-12-13 11:58:14,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:14,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067101193] [2022-12-13 11:58:14,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:14,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:58:14,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:14,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067101193] [2022-12-13 11:58:14,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067101193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:14,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:14,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:58:14,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678824307] [2022-12-13 11:58:14,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:14,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:58:14,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:14,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:58:14,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:58:14,203 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-13 11:58:14,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:14,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:14,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-13 11:58:14,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:14,268 INFO L130 PetriNetUnfolder]: 76/214 cut-off events. [2022-12-13 11:58:14,269 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-13 11:58:14,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 214 events. 76/214 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 948 event pairs, 13 based on Foata normal form. 33/200 useless extension candidates. Maximal degree in co-relation 665. Up to 96 conditions per place. [2022-12-13 11:58:14,270 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 20 selfloop transitions, 14 changer transitions 1/40 dead transitions. [2022-12-13 11:58:14,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 230 flow [2022-12-13 11:58:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:58:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:58:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-13 11:58:14,270 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48695652173913045 [2022-12-13 11:58:14,270 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 134 flow. Second operand 5 states and 56 transitions. [2022-12-13 11:58:14,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 230 flow [2022-12-13 11:58:14,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 204 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 11:58:14,273 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 162 flow [2022-12-13 11:58:14,274 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 11:58:14,275 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -19 predicate places. [2022-12-13 11:58:14,275 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:14,276 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 162 flow [2022-12-13 11:58:14,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:14,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:14,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 162 flow [2022-12-13 11:58:14,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 162 flow [2022-12-13 11:58:14,284 INFO L130 PetriNetUnfolder]: 10/72 cut-off events. [2022-12-13 11:58:14,284 INFO L131 PetriNetUnfolder]: For 39/45 co-relation queries the response was YES. [2022-12-13 11:58:14,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 72 events. 10/72 cut-off events. For 39/45 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 242 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 202. Up to 37 conditions per place. [2022-12-13 11:58:14,284 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 162 flow [2022-12-13 11:58:14,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-13 11:58:14,847 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L814-->L817: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [468] L834-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_485 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_155 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_159 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_449 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_486 256) 0)))) (.cse1 (and .cse3 .cse5))) (and (= v_~x$w_buff1_used~0_448 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_449)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_155|) (= (ite .cse2 v_~x$w_buff0~0_295 (ite .cse0 v_~x$w_buff1~0_272 v_~x~0_383)) v_~x~0_382) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_155| 0)) (= (mod v_~main$tmp_guard1~0_90 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_154 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_448 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_159) v_~x$r_buff1_thd0~0_158) (= (ite (= (ite (= v_~__unbuffered_cnt~0_301 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_140) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_119 0) (= v_~__unbuffered_p1_EAX~0_96 1) (= v_~__unbuffered_p0_EBX~0_104 0) (= v_~__unbuffered_p0_EAX~0_115 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_486) v_~x$w_buff0_used~0_485) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_140 256)) (= v_~x$r_buff0_thd0~0_154 (ite .cse1 0 v_~x$r_buff0_thd0~0_155))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_295, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_155, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_119, ~x$w_buff1~0=v_~x$w_buff1~0_272, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_449, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_486, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, ~x~0=v_~x~0_383} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_295, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_154, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_119, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_67|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_79|, ~x$w_buff1~0=v_~x$w_buff1~0_272, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_448, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_90, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_140, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_158, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_485, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_155|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, ~x~0=v_~x~0_382, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:58:15,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L814-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] and [468] L834-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_485 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_155 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_159 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_449 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_486 256) 0)))) (.cse1 (and .cse3 .cse5))) (and (= v_~x$w_buff1_used~0_448 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_449)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_155|) (= (ite .cse2 v_~x$w_buff0~0_295 (ite .cse0 v_~x$w_buff1~0_272 v_~x~0_383)) v_~x~0_382) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_155| 0)) (= (mod v_~main$tmp_guard1~0_90 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_154 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_448 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_159) v_~x$r_buff1_thd0~0_158) (= (ite (= (ite (= v_~__unbuffered_cnt~0_301 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_140) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_119 0) (= v_~__unbuffered_p1_EAX~0_96 1) (= v_~__unbuffered_p0_EBX~0_104 0) (= v_~__unbuffered_p0_EAX~0_115 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_486) v_~x$w_buff0_used~0_485) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_140 256)) (= v_~x$r_buff0_thd0~0_154 (ite .cse1 0 v_~x$r_buff0_thd0~0_155))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_295, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_155, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_119, ~x$w_buff1~0=v_~x$w_buff1~0_272, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_449, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_486, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, ~x~0=v_~x~0_383} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_295, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_154, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_119, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_67|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_79|, ~x$w_buff1~0=v_~x$w_buff1~0_272, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_448, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_90, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_140, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_158, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_485, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_155|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, ~x~0=v_~x~0_382, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:58:15,182 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [427] L814-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P1Thread1of1ForFork1_#res.base_9| 0) (= |v_P1Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] and [468] L834-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_485 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_155 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_159 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_449 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_486 256) 0)))) (.cse1 (and .cse3 .cse5))) (and (= v_~x$w_buff1_used~0_448 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_449)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_155|) (= (ite .cse2 v_~x$w_buff0~0_295 (ite .cse0 v_~x$w_buff1~0_272 v_~x~0_383)) v_~x~0_382) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_155| 0)) (= (mod v_~main$tmp_guard1~0_90 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_154 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_448 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_159) v_~x$r_buff1_thd0~0_158) (= (ite (= (ite (= v_~__unbuffered_cnt~0_301 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_140) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_119 0) (= v_~__unbuffered_p1_EAX~0_96 1) (= v_~__unbuffered_p0_EBX~0_104 0) (= v_~__unbuffered_p0_EAX~0_115 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_486) v_~x$w_buff0_used~0_485) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_140 256)) (= v_~x$r_buff0_thd0~0_154 (ite .cse1 0 v_~x$r_buff0_thd0~0_155))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_295, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_155, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_119, ~x$w_buff1~0=v_~x$w_buff1~0_272, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_449, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_486, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, ~x~0=v_~x~0_383} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_295, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_154, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_119, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_67|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_79|, ~x$w_buff1~0=v_~x$w_buff1~0_272, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_448, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_90, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_140, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_158, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_485, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_155|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, ~x~0=v_~x~0_382, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:58:15,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [429] L778-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P0Thread1of1ForFork0_#res#1.base_9| 0) (= |v_P0Thread1of1ForFork0_#res#1.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_9|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] and [468] L834-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_485 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_155 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_159 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_449 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_486 256) 0)))) (.cse1 (and .cse3 .cse5))) (and (= v_~x$w_buff1_used~0_448 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_449)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_155|) (= (ite .cse2 v_~x$w_buff0~0_295 (ite .cse0 v_~x$w_buff1~0_272 v_~x~0_383)) v_~x~0_382) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_155| 0)) (= (mod v_~main$tmp_guard1~0_90 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_154 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_448 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_159) v_~x$r_buff1_thd0~0_158) (= (ite (= (ite (= v_~__unbuffered_cnt~0_301 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_140) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_119 0) (= v_~__unbuffered_p1_EAX~0_96 1) (= v_~__unbuffered_p0_EBX~0_104 0) (= v_~__unbuffered_p0_EAX~0_115 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_486) v_~x$w_buff0_used~0_485) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_140 256)) (= v_~x$r_buff0_thd0~0_154 (ite .cse1 0 v_~x$r_buff0_thd0~0_155))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_295, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_155, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_119, ~x$w_buff1~0=v_~x$w_buff1~0_272, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_449, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_486, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, ~x~0=v_~x~0_383} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_295, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_154, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_119, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_67|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_79|, ~x$w_buff1~0=v_~x$w_buff1~0_272, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_448, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_90, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_140, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_158, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_485, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_155|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, ~x~0=v_~x~0_382, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:58:15,559 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] L778-->L781: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [468] L834-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_485 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_155 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_159 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_449 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_486 256) 0)))) (.cse1 (and .cse3 .cse5))) (and (= v_~x$w_buff1_used~0_448 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_449)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_155|) (= (ite .cse2 v_~x$w_buff0~0_295 (ite .cse0 v_~x$w_buff1~0_272 v_~x~0_383)) v_~x~0_382) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_155| 0)) (= (mod v_~main$tmp_guard1~0_90 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_154 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_448 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_159) v_~x$r_buff1_thd0~0_158) (= (ite (= (ite (= v_~__unbuffered_cnt~0_301 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_140) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_119 0) (= v_~__unbuffered_p1_EAX~0_96 1) (= v_~__unbuffered_p0_EBX~0_104 0) (= v_~__unbuffered_p0_EAX~0_115 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_486) v_~x$w_buff0_used~0_485) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_140 256)) (= v_~x$r_buff0_thd0~0_154 (ite .cse1 0 v_~x$r_buff0_thd0~0_155))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_295, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_155, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_119, ~x$w_buff1~0=v_~x$w_buff1~0_272, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_449, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_486, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, ~x~0=v_~x~0_383} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_295, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_154, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_119, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_67|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_79|, ~x$w_buff1~0=v_~x$w_buff1~0_272, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_448, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_90, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_140, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_158, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_485, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_155|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, ~x~0=v_~x~0_382, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:58:15,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [407] L778-->P0FINAL: Formula: (and (= v_~__unbuffered_cnt~0_29 (+ v_~__unbuffered_cnt~0_30 1)) (= |v_P0Thread1of1ForFork0_#res#1.base_5| 0) (= |v_P0Thread1of1ForFork0_#res#1.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_5|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] and [468] L834-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_485 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_155 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_159 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_449 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_486 256) 0)))) (.cse1 (and .cse3 .cse5))) (and (= v_~x$w_buff1_used~0_448 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_449)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_155|) (= (ite .cse2 v_~x$w_buff0~0_295 (ite .cse0 v_~x$w_buff1~0_272 v_~x~0_383)) v_~x~0_382) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_155| 0)) (= (mod v_~main$tmp_guard1~0_90 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_154 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_448 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_159) v_~x$r_buff1_thd0~0_158) (= (ite (= (ite (= v_~__unbuffered_cnt~0_301 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_140) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_119 0) (= v_~__unbuffered_p1_EAX~0_96 1) (= v_~__unbuffered_p0_EBX~0_104 0) (= v_~__unbuffered_p0_EAX~0_115 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_486) v_~x$w_buff0_used~0_485) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (mod v_~main$tmp_guard0~0_140 256)) (= v_~x$r_buff0_thd0~0_154 (ite .cse1 0 v_~x$r_buff0_thd0~0_155))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_295, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_155, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_119, ~x$w_buff1~0=v_~x$w_buff1~0_272, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_449, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_486, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, ~x~0=v_~x~0_383} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_295, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_154, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_119, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_67|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_79|, ~x$w_buff1~0=v_~x$w_buff1~0_272, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_448, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_90, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_140, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_158, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_485, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_155|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, ~x~0=v_~x~0_382, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:58:15,981 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:58:15,982 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1707 [2022-12-13 11:58:15,982 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 170 flow [2022-12-13 11:58:15,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:15,982 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:15,983 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:15,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:58:15,983 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:15,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:15,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1601989209, now seen corresponding path program 1 times [2022-12-13 11:58:15,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:15,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850187004] [2022-12-13 11:58:15,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:15,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:58:16,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:16,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850187004] [2022-12-13 11:58:16,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850187004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:16,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:16,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:58:16,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723090420] [2022-12-13 11:58:16,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:16,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:58:16,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:16,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:58:16,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:58:16,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 11:58:16,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 170 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:16,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:16,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 11:58:16,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:16,886 INFO L130 PetriNetUnfolder]: 42/122 cut-off events. [2022-12-13 11:58:16,887 INFO L131 PetriNetUnfolder]: For 193/197 co-relation queries the response was YES. [2022-12-13 11:58:16,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 122 events. 42/122 cut-off events. For 193/197 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 441 event pairs, 5 based on Foata normal form. 10/107 useless extension candidates. Maximal degree in co-relation 443. Up to 55 conditions per place. [2022-12-13 11:58:16,887 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 24 selfloop transitions, 7 changer transitions 13/50 dead transitions. [2022-12-13 11:58:16,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 344 flow [2022-12-13 11:58:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:58:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:58:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2022-12-13 11:58:16,889 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4945054945054945 [2022-12-13 11:58:16,889 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 170 flow. Second operand 7 states and 90 transitions. [2022-12-13 11:58:16,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 344 flow [2022-12-13 11:58:16,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 50 transitions, 251 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-13 11:58:16,891 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 151 flow [2022-12-13 11:58:16,891 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=151, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-12-13 11:58:16,892 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -18 predicate places. [2022-12-13 11:58:16,892 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:16,892 INFO L89 Accepts]: Start accepts. Operand has 40 places, 31 transitions, 151 flow [2022-12-13 11:58:16,892 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:16,892 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:16,893 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 151 flow [2022-12-13 11:58:16,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 151 flow [2022-12-13 11:58:16,900 INFO L130 PetriNetUnfolder]: 12/51 cut-off events. [2022-12-13 11:58:16,900 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-13 11:58:16,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 51 events. 12/51 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 155 event pairs, 0 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 119. Up to 19 conditions per place. [2022-12-13 11:58:16,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 151 flow [2022-12-13 11:58:16,901 INFO L226 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-13 11:58:17,168 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [373] $Ultimate##0-->L752: Formula: (and (= v_~x$w_buff0_used~0_197 1) (= |v_P0Thread1of1ForFork0_~arg#1.offset_7| |v_P0Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$w_buff0~0_100 v_~x$w_buff1~0_96) (= v_~x$r_buff0_thd1~0_86 1) (= v_~x$w_buff0~0_99 1) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_197 256) 0)) (not (= (mod v_~x$w_buff1_used~0_182 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$w_buff0_used~0_198 v_~x$w_buff1_used~0_182) (= v_~x$r_buff1_thd2~0_79 v_~x$r_buff0_thd2~0_83) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= |v_P0Thread1of1ForFork0_~arg#1.base_7| |v_P0Thread1of1ForFork0_#in~arg#1.base_7|) (= v_~x$r_buff1_thd1~0_81 v_~x$r_buff0_thd1~0_87) (= v_~x$r_buff1_thd0~0_49 v_~x$r_buff0_thd0~0_51) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_100, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_83, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_198} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_99, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff1~0=v_~x$w_buff1~0_96, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_79, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_182, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_81, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_83, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_49, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_197, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_9|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$w_buff1~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork0_~arg#1.base, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg#1.offset, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0] and [324] L791-->L807: Formula: (let ((.cse5 (= (mod v_~x$r_buff1_thd2~0_56 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd2~0_62 256) 0))) (let ((.cse11 (not .cse10)) (.cse8 (and .cse10 .cse5)) (.cse9 (and .cse10 (= (mod v_~x$w_buff1_used~0_133 256) 0))) (.cse12 (= (mod v_~x$w_buff0_used~0_142 256) 0))) (let ((.cse1 (or .cse8 .cse9 .cse12)) (.cse2 (and .cse11 (not .cse12)))) (let ((.cse3 (ite .cse1 v_~x~0_96 (ite .cse2 v_~x$w_buff0~0_58 v_~x$w_buff1~0_63))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse6 (= (mod v_~x$w_buff1_used~0_132 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_141 256) 0))) (and (= (ite .cse0 v_~x$w_buff0_used~0_142 (ite .cse1 v_~x$w_buff0_used~0_142 (ite .cse2 0 v_~x$w_buff0_used~0_142))) v_~x$w_buff0_used~0_141) (= .cse3 v_~__unbuffered_p1_EBX~0_8) (= v_~weak$$choice0~0_16 |v_P1Thread1of1ForFork1_#t~nondet5_1|) (= v_~x~0_94 (ite .cse0 v_~x$mem_tmp~0_34 .cse3)) (= v_~x$r_buff1_thd2~0_55 (ite .cse0 v_~x$r_buff1_thd2~0_56 (ite (let ((.cse4 (= (mod v_~x$r_buff0_thd2~0_61 256) 0))) (or (and .cse4 .cse5) (and .cse6 .cse4) .cse7)) v_~x$r_buff1_thd2~0_56 0))) (= v_~x$w_buff1_used~0_132 (ite .cse0 v_~x$w_buff1_used~0_133 (ite (or .cse8 .cse7 .cse9) v_~x$w_buff1_used~0_133 0))) (= v_~x$flush_delayed~0_44 0) (= v_~x$w_buff1~0_63 v_~x$w_buff1~0_62) (= (ite .cse0 v_~x$r_buff0_thd2~0_62 (ite (or .cse8 .cse7 (and .cse10 .cse6)) v_~x$r_buff0_thd2~0_62 (ite (and .cse11 (not .cse7)) 0 v_~x$r_buff0_thd2~0_62))) v_~x$r_buff0_thd2~0_61) (= v_~x$w_buff0~0_58 v_~x$w_buff0~0_57) (= v_~x~0_96 v_~x$mem_tmp~0_34) (= v_~weak$$choice2~0_64 |v_P1Thread1of1ForFork1_#t~nondet6_1|)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_1|, P1Thread1of1ForFork1_#t~nondet5=|v_P1Thread1of1ForFork1_#t~nondet5_1|, ~x$w_buff1~0=v_~x$w_buff1~0_63, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_56, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_62, ~x~0=v_~x~0_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_142} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_62, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$mem_tmp~0=v_~x$mem_tmp~0_34, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_141, ~weak$$choice0~0=v_~weak$$choice0~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~x~0=v_~x~0_94} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet6, ~x$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet5, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, ~x~0] [2022-12-13 11:58:17,991 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] $Ultimate##0-->L768: Formula: (let ((.cse1 (= (mod v_~x$w_buff0_used~0_543 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_148 256) 0)))) (and (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_59| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_59|) (= v_~x$r_buff0_thd0~0_186 v_~x$r_buff1_thd0~0_190) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_59| (ite (= (mod v_~x$w_buff0_used~0_545 256) 0) 1 0)) (= v_~x$r_buff0_thd1~0_262 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_59| 0)) (= v_~x~0_437 v_~x$mem_tmp~0_114) (= v_~x$flush_delayed~0_128 0) (= (ite .cse0 v_~x$w_buff0_used~0_545 (ite .cse1 v_~x$w_buff0_used~0_545 0)) v_~x$w_buff1_used~0_502) (= |v_P0Thread1of1ForFork0_#t~nondet3#1_66| v_~weak$$choice0~0_102) (= (ite .cse0 v_~x$r_buff0_thd1~0_264 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_262 256) 0))) (or (and .cse2 (= (mod v_~x$w_buff1_used~0_502 256) 0)) .cse1 (and .cse2 (= (mod v_~x$r_buff0_thd1~0_264 256) 0)))) v_~x$r_buff0_thd1~0_264 0)) v_~x$r_buff1_thd1~0_215) (= (ite .cse0 v_~x$mem_tmp~0_114 v_~__unbuffered_p0_EAX~0_137) v_~x~0_436) (= v_~x$w_buff0~0_337 v_~__unbuffered_p0_EAX~0_137) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_57| |v_P0Thread1of1ForFork0_~arg#1.offset_57|) (= (ite .cse0 1 0) v_~x$w_buff0_used~0_543) (= v_~x$w_buff0~0_339 v_~x$w_buff1~0_310) (= |v_P0Thread1of1ForFork0_~arg#1.base_57| |v_P0Thread1of1ForFork0_#in~arg#1.base_57|) (= v_~x$r_buff0_thd2~0_245 v_~x$r_buff1_thd2~0_246) (= v_~weak$$choice2~0_148 |v_P0Thread1of1ForFork0_#t~nondet4#1_66|) (= v_~x$w_buff0~0_337 1))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_339, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_264, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_57|, P0Thread1of1ForFork0_#t~nondet4#1=|v_P0Thread1of1ForFork0_#t~nondet4#1_66|, P0Thread1of1ForFork0_#t~nondet3#1=|v_P0Thread1of1ForFork0_#t~nondet3#1_66|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_57|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_245, ~x~0=v_~x~0_437, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_545} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_337, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_262, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_57|, ~x$flush_delayed~0=v_~x$flush_delayed~0_128, ~x$w_buff1~0=v_~x$w_buff1~0_310, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_57|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_502, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_246, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_57|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_215, ~x$mem_tmp~0=v_~x$mem_tmp~0_114, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_245, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_190, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_57|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_543, ~weak$$choice0~0=v_~weak$$choice0~0_102, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_59|, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~x~0=v_~x~0_436, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_59|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, P0Thread1of1ForFork0_#t~nondet4#1, ~x$w_buff1~0, P0Thread1of1ForFork0_~arg#1.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg#1.offset, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork0_#t~nondet3#1, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] and [324] L791-->L807: Formula: (let ((.cse5 (= (mod v_~x$r_buff1_thd2~0_56 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd2~0_62 256) 0))) (let ((.cse11 (not .cse10)) (.cse8 (and .cse10 .cse5)) (.cse9 (and .cse10 (= (mod v_~x$w_buff1_used~0_133 256) 0))) (.cse12 (= (mod v_~x$w_buff0_used~0_142 256) 0))) (let ((.cse1 (or .cse8 .cse9 .cse12)) (.cse2 (and .cse11 (not .cse12)))) (let ((.cse3 (ite .cse1 v_~x~0_96 (ite .cse2 v_~x$w_buff0~0_58 v_~x$w_buff1~0_63))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse6 (= (mod v_~x$w_buff1_used~0_132 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_141 256) 0))) (and (= (ite .cse0 v_~x$w_buff0_used~0_142 (ite .cse1 v_~x$w_buff0_used~0_142 (ite .cse2 0 v_~x$w_buff0_used~0_142))) v_~x$w_buff0_used~0_141) (= .cse3 v_~__unbuffered_p1_EBX~0_8) (= v_~weak$$choice0~0_16 |v_P1Thread1of1ForFork1_#t~nondet5_1|) (= v_~x~0_94 (ite .cse0 v_~x$mem_tmp~0_34 .cse3)) (= v_~x$r_buff1_thd2~0_55 (ite .cse0 v_~x$r_buff1_thd2~0_56 (ite (let ((.cse4 (= (mod v_~x$r_buff0_thd2~0_61 256) 0))) (or (and .cse4 .cse5) (and .cse6 .cse4) .cse7)) v_~x$r_buff1_thd2~0_56 0))) (= v_~x$w_buff1_used~0_132 (ite .cse0 v_~x$w_buff1_used~0_133 (ite (or .cse8 .cse7 .cse9) v_~x$w_buff1_used~0_133 0))) (= v_~x$flush_delayed~0_44 0) (= v_~x$w_buff1~0_63 v_~x$w_buff1~0_62) (= (ite .cse0 v_~x$r_buff0_thd2~0_62 (ite (or .cse8 .cse7 (and .cse10 .cse6)) v_~x$r_buff0_thd2~0_62 (ite (and .cse11 (not .cse7)) 0 v_~x$r_buff0_thd2~0_62))) v_~x$r_buff0_thd2~0_61) (= v_~x$w_buff0~0_58 v_~x$w_buff0~0_57) (= v_~x~0_96 v_~x$mem_tmp~0_34) (= v_~weak$$choice2~0_64 |v_P1Thread1of1ForFork1_#t~nondet6_1|)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_1|, P1Thread1of1ForFork1_#t~nondet5=|v_P1Thread1of1ForFork1_#t~nondet5_1|, ~x$w_buff1~0=v_~x$w_buff1~0_63, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_56, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_62, ~x~0=v_~x~0_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_142} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_62, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$mem_tmp~0=v_~x$mem_tmp~0_34, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_141, ~weak$$choice0~0=v_~weak$$choice0~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~x~0=v_~x~0_94} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet6, ~x$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet5, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, ~x~0] [2022-12-13 11:58:18,395 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:58:18,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1503 [2022-12-13 11:58:18,395 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 156 flow [2022-12-13 11:58:18,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:18,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:18,396 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:18,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:58:18,396 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:18,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:18,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1451874461, now seen corresponding path program 1 times [2022-12-13 11:58:18,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:18,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141727271] [2022-12-13 11:58:18,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:18,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:58:18,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:18,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141727271] [2022-12-13 11:58:18,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141727271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:18,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:18,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:58:18,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048090150] [2022-12-13 11:58:18,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:18,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:58:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:18,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:58:18,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:58:18,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-13 11:58:18,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:18,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:18,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-13 11:58:18,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:18,569 INFO L130 PetriNetUnfolder]: 38/111 cut-off events. [2022-12-13 11:58:18,569 INFO L131 PetriNetUnfolder]: For 115/117 co-relation queries the response was YES. [2022-12-13 11:58:18,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 111 events. 38/111 cut-off events. For 115/117 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 406 event pairs, 9 based on Foata normal form. 8/96 useless extension candidates. Maximal degree in co-relation 338. Up to 63 conditions per place. [2022-12-13 11:58:18,569 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 20 selfloop transitions, 1 changer transitions 16/40 dead transitions. [2022-12-13 11:58:18,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 273 flow [2022-12-13 11:58:18,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:58:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:58:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 11:58:18,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2022-12-13 11:58:18,571 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 156 flow. Second operand 4 states and 53 transitions. [2022-12-13 11:58:18,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 273 flow [2022-12-13 11:58:18,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 239 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-13 11:58:18,572 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 116 flow [2022-12-13 11:58:18,572 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2022-12-13 11:58:18,573 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -20 predicate places. [2022-12-13 11:58:18,573 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:18,573 INFO L89 Accepts]: Start accepts. Operand has 38 places, 24 transitions, 116 flow [2022-12-13 11:58:18,573 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:18,573 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:18,574 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 24 transitions, 116 flow [2022-12-13 11:58:18,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 24 transitions, 116 flow [2022-12-13 11:58:18,579 INFO L130 PetriNetUnfolder]: 9/43 cut-off events. [2022-12-13 11:58:18,579 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 11:58:18,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 43 events. 9/43 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 112 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 99. Up to 19 conditions per place. [2022-12-13 11:58:18,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 116 flow [2022-12-13 11:58:18,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 11:58:19,077 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] $Ultimate##0-->L771: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_154 256) 0))) (.cse1 (= 0 (mod v_~x$w_buff0_used~0_555 256)))) (and (= (ite .cse0 1 0) v_~x$w_buff0_used~0_555) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_63| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_63|) (= v_~x$w_buff1_used~0_510 (ite .cse0 v_~x$w_buff0_used~0_556 (ite .cse1 v_~x$w_buff0_used~0_556 0))) (= v_~x$w_buff0~0_349 v_~__unbuffered_p0_EAX~0_141) (= v_~weak$$choice2~0_154 |v_P0Thread1of1ForFork0_#t~nondet4#1_74|) (= |v_P0Thread1of1ForFork0_#t~nondet3#1_74| v_~weak$$choice0~0_108) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_63| (ite (= (mod v_~x$w_buff0_used~0_556 256) 0) 1 0)) (= v_~x$r_buff0_thd1~0_272 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (= (ite .cse0 v_~x$mem_tmp~0_120 v_~__unbuffered_p0_EAX~0_141) v_~x~0_446) (= v_~x~0_447 v_~x$mem_tmp~0_120) (= v_~x$w_buff0~0_349 1) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_61| |v_P0Thread1of1ForFork0_~arg#1.offset_61|) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_63| 0)) (= v_~x$r_buff0_thd2~0_251 v_~x$r_buff1_thd2~0_252) (= v_~x$flush_delayed~0_134 0) (= v_~x$r_buff0_thd0~0_190 v_~x$r_buff1_thd0~0_194) (= v_~__unbuffered_p0_EBX~0_118 v_~y~0_63) (= (ite .cse0 v_~x$r_buff0_thd1~0_273 (ite (let ((.cse2 (= 0 (mod v_~x$r_buff0_thd1~0_272 256)))) (or .cse1 (and .cse2 (= (mod v_~x$w_buff1_used~0_510 256) 0)) (and (= (mod v_~x$r_buff0_thd1~0_273 256) 0) .cse2))) v_~x$r_buff0_thd1~0_273 0)) v_~x$r_buff1_thd1~0_221) (= |v_P0Thread1of1ForFork0_~arg#1.base_61| |v_P0Thread1of1ForFork0_#in~arg#1.base_61|) (= v_~x$w_buff0~0_350 v_~x$w_buff1~0_318))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_350, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_273, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_61|, P0Thread1of1ForFork0_#t~nondet4#1=|v_P0Thread1of1ForFork0_#t~nondet4#1_74|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_61|, P0Thread1of1ForFork0_#t~nondet3#1=|v_P0Thread1of1ForFork0_#t~nondet3#1_74|, ~y~0=v_~y~0_63, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_251, ~x~0=v_~x~0_447, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_556} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_349, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_272, ~x$flush_delayed~0=v_~x$flush_delayed~0_134, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_61|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_221, ~x$mem_tmp~0=v_~x$mem_tmp~0_120, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_61|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_141, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_63|, ~y~0=v_~y~0_63, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_63|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_118, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_61|, ~x$w_buff1~0=v_~x$w_buff1~0_318, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_61|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_510, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_252, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_251, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_194, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_555, ~weak$$choice0~0=v_~weak$$choice0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_154, ~x~0=v_~x~0_446} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, P0Thread1of1ForFork0_#t~nondet4#1, ~x$w_buff1~0, P0Thread1of1ForFork0_~arg#1.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg#1.offset, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork0_#t~nondet3#1, ~weak$$choice2~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x~0] and [481] $Ultimate##0-->L807: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd2~0_255 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd2~0_254 256) 0))) (let ((.cse11 (not .cse10)) (.cse8 (and .cse10 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_560 256) 0)) (.cse9 (and (= (mod v_~x$w_buff1_used~0_513 256) 0) .cse10))) (let ((.cse5 (or .cse8 .cse12 .cse9)) (.cse6 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse5 v_~x~0_451 (ite .cse6 v_~x$w_buff0~0_354 v_~x$w_buff1~0_321))) (.cse0 (not (= (mod v_~weak$$choice2~0_156 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_512 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_559 256) 0))) (and (= v_~x~0_451 v_~x$mem_tmp~0_122) (= v_~x$flush_delayed~0_136 0) (= v_~y~0_65 v_~__unbuffered_p1_EAX~0_112) (= v_~x$w_buff0~0_354 v_~x$w_buff0~0_353) (= v_~y~0_65 1) (= (ite .cse0 v_~x$r_buff1_thd2~0_255 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd2~0_253 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~x$r_buff1_thd2~0_255 0)) v_~x$r_buff1_thd2~0_254) (= (ite .cse0 v_~x$w_buff0_used~0_560 (ite .cse5 v_~x$w_buff0_used~0_560 (ite .cse6 0 v_~x$w_buff0_used~0_560))) v_~x$w_buff0_used~0_559) (= |v_P1Thread1of1ForFork1_#in~arg.offset_15| v_P1Thread1of1ForFork1_~arg.offset_15) (= v_~x~0_450 (ite .cse0 v_~x$mem_tmp~0_122 .cse7)) (= v_~weak$$choice0~0_110 |v_P1Thread1of1ForFork1_#t~nondet5_78|) (= v_P1Thread1of1ForFork1_~arg.base_15 |v_P1Thread1of1ForFork1_#in~arg.base_15|) (= v_~__unbuffered_p1_EBX~0_141 .cse7) (= v_~x$w_buff1_used~0_512 (ite .cse0 v_~x$w_buff1_used~0_513 (ite (or .cse8 .cse9 .cse3) v_~x$w_buff1_used~0_513 0))) (= (ite .cse0 v_~x$r_buff0_thd2~0_254 (ite (or .cse8 (and .cse10 .cse2) .cse3) v_~x$r_buff0_thd2~0_254 (ite (and (not .cse3) .cse11) 0 v_~x$r_buff0_thd2~0_254))) v_~x$r_buff0_thd2~0_253) (= v_~x$w_buff1~0_321 v_~x$w_buff1~0_320) (= v_~weak$$choice2~0_156 |v_P1Thread1of1ForFork1_#t~nondet6_78|)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_354, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_78|, P1Thread1of1ForFork1_#t~nondet5=|v_P1Thread1of1ForFork1_#t~nondet5_78|, ~x$w_buff1~0=v_~x$w_buff1~0_321, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_15|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_255, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_513, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_15|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_254, ~x~0=v_~x~0_451, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_560} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_353, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_141, ~x$flush_delayed~0=v_~x$flush_delayed~0_136, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_15, ~x$w_buff1~0=v_~x$w_buff1~0_320, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_254, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_512, ~x$mem_tmp~0=v_~x$mem_tmp~0_122, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_253, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_559, ~weak$$choice0~0=v_~weak$$choice0~0_110, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_112, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_15|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_15|, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y~0=v_~y~0_65, ~x~0=v_~x~0_450} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet6, ~x$flush_delayed~0, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~nondet5, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, ~weak$$choice2~0, ~y~0, ~x~0] [2022-12-13 11:58:19,464 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:58:19,464 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 891 [2022-12-13 11:58:19,464 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 104 flow [2022-12-13 11:58:19,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:19,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:19,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:19,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:58:19,465 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:58:19,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:19,465 INFO L85 PathProgramCache]: Analyzing trace with hash -238773355, now seen corresponding path program 1 times [2022-12-13 11:58:19,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:19,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214788854] [2022-12-13 11:58:19,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:19,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:58:19,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:58:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:58:19,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:58:19,526 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:58:19,527 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 11:58:19,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 11:58:19,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 11:58:19,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 11:58:19,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 11:58:19,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:58:19,538 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:19,542 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:58:19,542 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:58:19,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:58:19 BasicIcfg [2022-12-13 11:58:19,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:58:19,578 INFO L158 Benchmark]: Toolchain (without parser) took 12694.22ms. Allocated memory was 199.2MB in the beginning and 449.8MB in the end (delta: 250.6MB). Free memory was 174.2MB in the beginning and 416.7MB in the end (delta: -242.5MB). Peak memory consumption was 224.3MB. Max. memory is 8.0GB. [2022-12-13 11:58:19,578 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory is still 176.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:58:19,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.67ms. Allocated memory is still 199.2MB. Free memory was 174.2MB in the beginning and 147.7MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 11:58:19,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.31ms. Allocated memory is still 199.2MB. Free memory was 147.7MB in the beginning and 145.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:58:19,578 INFO L158 Benchmark]: Boogie Preprocessor took 23.47ms. Allocated memory is still 199.2MB. Free memory was 145.1MB in the beginning and 143.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:58:19,579 INFO L158 Benchmark]: RCFGBuilder took 646.16ms. Allocated memory is still 199.2MB. Free memory was 143.0MB in the beginning and 106.3MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-13 11:58:19,579 INFO L158 Benchmark]: TraceAbstraction took 11508.86ms. Allocated memory was 199.2MB in the beginning and 449.8MB in the end (delta: 250.6MB). Free memory was 105.2MB in the beginning and 416.7MB in the end (delta: -311.5MB). Peak memory consumption was 155.1MB. Max. memory is 8.0GB. [2022-12-13 11:58:19,580 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.09ms. Allocated memory is still 199.2MB. Free memory is still 176.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 476.67ms. Allocated memory is still 199.2MB. Free memory was 174.2MB in the beginning and 147.7MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.31ms. Allocated memory is still 199.2MB. Free memory was 147.7MB in the beginning and 145.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.47ms. Allocated memory is still 199.2MB. Free memory was 145.1MB in the beginning and 143.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 646.16ms. Allocated memory is still 199.2MB. Free memory was 143.0MB in the beginning and 106.3MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11508.86ms. Allocated memory was 199.2MB in the beginning and 449.8MB in the end (delta: 250.6MB). Free memory was 105.2MB in the beginning and 416.7MB in the end (delta: -311.5MB). Peak memory consumption was 155.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 95 PlacesBefore, 58 PlacesAfterwards, 90 TransitionsBefore, 52 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 32 ConcurrentYvCompositions, 3 ChoiceCompositions, 73 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2518, independent: 2414, independent conditional: 2414, independent unconditional: 0, dependent: 104, dependent conditional: 104, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2518, independent: 2414, independent conditional: 0, independent unconditional: 2414, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2518, independent: 2414, independent conditional: 0, independent unconditional: 2414, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2518, independent: 2414, independent conditional: 0, independent unconditional: 2414, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1154, independent: 1111, independent conditional: 0, independent unconditional: 1111, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1154, independent: 1087, independent conditional: 0, independent unconditional: 1087, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 205, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2518, independent: 1303, independent conditional: 0, independent unconditional: 1303, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 1154, unknown conditional: 0, unknown unconditional: 1154] , Statistics on independence cache: Total cache size (in pairs): 2581, Positive cache size: 2538, Positive conditional cache size: 0, Positive unconditional cache size: 2538, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 32 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 161, independent: 131, independent conditional: 131, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 161, independent: 131, independent conditional: 16, independent unconditional: 115, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 161, independent: 131, independent conditional: 16, independent unconditional: 115, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 161, independent: 131, independent conditional: 16, independent unconditional: 115, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 127, independent: 105, independent conditional: 15, independent unconditional: 90, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 127, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 108, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 108, dependent conditional: 36, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 161, independent: 26, independent conditional: 1, independent unconditional: 25, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 127, unknown conditional: 21, unknown unconditional: 106] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 105, Positive conditional cache size: 15, Positive unconditional cache size: 90, Negative cache size: 22, Negative conditional cache size: 6, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 151, independent: 126, independent conditional: 6, independent unconditional: 120, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 151, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 36, unknown conditional: 0, unknown unconditional: 36] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 136, Positive conditional cache size: 15, Positive unconditional cache size: 121, Negative cache size: 27, Negative conditional cache size: 6, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 150, independent: 124, independent conditional: 6, independent unconditional: 118, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, independent: 116, independent conditional: 0, independent unconditional: 116, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 144, Positive conditional cache size: 15, Positive unconditional cache size: 129, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 150, independent: 124, independent conditional: 9, independent unconditional: 115, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 144, Positive conditional cache size: 15, Positive unconditional cache size: 129, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 109, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 109, independent: 85, independent conditional: 29, independent unconditional: 56, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 109, independent: 85, independent conditional: 11, independent unconditional: 74, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 109, independent: 85, independent conditional: 11, independent unconditional: 74, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, independent: 81, independent conditional: 7, independent unconditional: 74, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 148, Positive conditional cache size: 19, Positive unconditional cache size: 129, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 122, independent: 76, independent conditional: 76, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 122, independent: 76, independent conditional: 28, independent unconditional: 48, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 122, independent: 76, independent conditional: 24, independent unconditional: 52, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 122, independent: 76, independent conditional: 24, independent unconditional: 52, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, independent: 65, independent conditional: 15, independent unconditional: 50, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 15, unknown conditional: 9, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 160, Positive conditional cache size: 28, Positive unconditional cache size: 132, Negative cache size: 36, Negative conditional cache size: 6, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 37 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 122, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 122, independent: 77, independent conditional: 45, independent unconditional: 32, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 122, independent: 77, independent conditional: 45, independent unconditional: 32, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 122, independent: 77, independent conditional: 45, independent unconditional: 32, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, independent: 72, independent conditional: 40, independent unconditional: 32, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 191, Positive conditional cache size: 33, Positive unconditional cache size: 158, Negative cache size: 36, Negative conditional cache size: 6, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 36 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 20 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 91, independent: 64, independent conditional: 35, independent unconditional: 29, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 64, independent conditional: 35, independent unconditional: 29, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 64, independent conditional: 35, independent unconditional: 29, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 61, independent conditional: 34, independent unconditional: 27, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 223, Positive conditional cache size: 36, Positive unconditional cache size: 187, Negative cache size: 36, Negative conditional cache size: 6, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1721; [L832] FCALL, FORK 0 pthread_create(&t1721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1721, ((void *)0), P0, ((void *)0))=-1, t1721={5:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L833] 0 pthread_t t1722; [L834] FCALL, FORK 0 pthread_create(&t1722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1722, ((void *)0), P1, ((void *)0))=0, t1721={5:0}, t1722={3:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L743] 1 x$w_buff1 = x$w_buff0 [L744] 1 x$w_buff0 = 1 [L745] 1 x$w_buff1_used = x$w_buff0_used [L746] 1 x$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L748] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 1 x$r_buff0_thd1 = (_Bool)1 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 x$flush_delayed = weak$$choice2 [L757] 1 x$mem_tmp = x [L758] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L759] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L760] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L761] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L762] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L764] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = x [L766] 1 x = x$flush_delayed ? x$mem_tmp : x [L767] 1 x$flush_delayed = (_Bool)0 [L770] 1 __unbuffered_p0_EBX = y [L787] 1 y = 1 [L790] 1 __unbuffered_p1_EAX = y [L793] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 1 x$flush_delayed = weak$$choice2 [L796] 1 x$mem_tmp = x [L797] 1 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) [L798] 1 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)) [L799] 1 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)) [L800] 1 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)) [L801] 1 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)) [L802] 1 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)) [L803] 1 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)) [L804] 1 __unbuffered_p1_EBX = x [L805] 1 x = x$flush_delayed ? x$mem_tmp : x [L806] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L773] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L775] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L776] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L777] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 2 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 2 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 2 !(!cond) [L838] RET 2 assume_abort_if_not(main$tmp_guard0) [L840] 2 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 2 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 [L843] 2 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 2 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 [L847] 2 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 477 IncrementalHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 6 mSDtfsCounter, 477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=6, InterpolantAutomatonStates: 32, 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.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 523 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! [2022-12-13 11:58:19,610 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...