/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:31:53,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:31:53,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:31:53,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:31:53,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:31:53,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:31:53,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:31:53,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:31:53,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:31:53,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:31:53,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:31:53,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:31:53,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:31:53,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:31:53,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:31:53,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:31:53,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:31:53,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:31:53,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:31:53,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:31:53,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:31:53,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:31:53,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:31:53,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:31:53,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:31:53,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:31:53,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:31:53,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:31:53,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:31:53,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:31:53,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:31:53,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:31:53,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:31:53,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:31:53,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:31:53,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:31:53,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:31:53,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:31:53,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:31:53,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:31:53,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:31:53,082 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:31:53,112 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:31:53,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:31:53,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:31:53,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:31:53,113 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:31:53,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:31:53,114 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:31:53,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:31:53,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:31:53,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:31:53,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:31:53,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:31:53,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:31:53,114 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:31:53,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:31:53,114 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:31:53,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:31:53,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:31:53,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:31:53,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:31:53,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:31:53,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:31:53,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:31:53,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:31:53,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:31:53,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:31:53,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:31:53,118 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:31:53,118 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-06 04:31:53,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:31:53,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:31:53,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:31:53,418 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:31:53,419 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:31:53,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i [2022-12-06 04:31:54,472 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:31:54,761 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:31:54,762 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i [2022-12-06 04:31:54,798 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b2aa6ee/b48bd12a0c9249d08450d7f97300813c/FLAGc3fed5554 [2022-12-06 04:31:54,814 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b2aa6ee/b48bd12a0c9249d08450d7f97300813c [2022-12-06 04:31:54,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:31:54,818 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:31:54,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:31:54,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:31:54,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:31:54,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:31:54" (1/1) ... [2022-12-06 04:31:54,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b4e5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:54, skipping insertion in model container [2022-12-06 04:31:54,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:31:54" (1/1) ... [2022-12-06 04:31:54,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:31:54,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:31:55,055 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/safe021_power.opt_pso.opt.i[959,972] [2022-12-06 04:31:55,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:31:55,264 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:31:55,278 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/safe021_power.opt_pso.opt.i[959,972] [2022-12-06 04:31:55,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:55,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:55,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:31:55,373 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:31:55,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:55 WrapperNode [2022-12-06 04:31:55,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:31:55,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:31:55,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:31:55,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:31:55,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:55" (1/1) ... [2022-12-06 04:31:55,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:55" (1/1) ... [2022-12-06 04:31:55,442 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-06 04:31:55,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:31:55,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:31:55,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:31:55,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:31:55,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:55" (1/1) ... [2022-12-06 04:31:55,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:55" (1/1) ... [2022-12-06 04:31:55,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:55" (1/1) ... [2022-12-06 04:31:55,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:55" (1/1) ... [2022-12-06 04:31:55,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:55" (1/1) ... [2022-12-06 04:31:55,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:55" (1/1) ... [2022-12-06 04:31:55,480 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:55" (1/1) ... [2022-12-06 04:31:55,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:55" (1/1) ... [2022-12-06 04:31:55,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:31:55,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:31:55,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:31:55,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:31:55,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:55" (1/1) ... [2022-12-06 04:31:55,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:31:55,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:31:55,534 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-06 04:31:55,551 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-06 04:31:55,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:31:55,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:31:55,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:31:55,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:31:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:31:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:31:55,587 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:31:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:31:55,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:31:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:31:55,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:31:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:31:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:31:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:31:55,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:31:55,589 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:31:55,680 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:31:55,681 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:31:55,968 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:31:56,059 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:31:56,059 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:31:56,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:31:56 BoogieIcfgContainer [2022-12-06 04:31:56,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:31:56,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:31:56,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:31:56,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:31:56,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:31:54" (1/3) ... [2022-12-06 04:31:56,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f80129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:31:56, skipping insertion in model container [2022-12-06 04:31:56,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:55" (2/3) ... [2022-12-06 04:31:56,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f80129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:31:56, skipping insertion in model container [2022-12-06 04:31:56,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:31:56" (3/3) ... [2022-12-06 04:31:56,066 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.opt_pso.opt.i [2022-12-06 04:31:56,079 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:31:56,079 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:31:56,079 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:31:56,142 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:31:56,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 04:31:56,237 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 04:31:56,237 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:56,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:31:56,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 04:31:56,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-06 04:31:56,246 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:56,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 04:31:56,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-06 04:31:56,293 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 04:31:56,293 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:56,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:31:56,300 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 04:31:56,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-06 04:32:00,838 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-06 04:32:00,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:32:00,876 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;@3af28918, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:32:00,876 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:32:00,879 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 04:32:00,879 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:00,879 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:00,880 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:32:00,881 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:32:00,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:00,884 INFO L85 PathProgramCache]: Analyzing trace with hash 445801751, now seen corresponding path program 1 times [2022-12-06 04:32:00,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:00,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207431418] [2022-12-06 04:32:00,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:00,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:01,211 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-06 04:32:01,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:01,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207431418] [2022-12-06 04:32:01,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207431418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:01,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:01,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:32:01,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754175911] [2022-12-06 04:32:01,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:01,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:32:01,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:01,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:32:01,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:32:01,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:32:01,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-06 04:32:01,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:01,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:32:01,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:01,492 INFO L130 PetriNetUnfolder]: 879/1434 cut-off events. [2022-12-06 04:32:01,492 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 04:32:01,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 1434 events. 879/1434 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7517 event pairs, 144 based on Foata normal form. 0/1281 useless extension candidates. Maximal degree in co-relation 2790. Up to 1060 conditions per place. [2022-12-06 04:32:01,500 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2022-12-06 04:32:01,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2022-12-06 04:32:01,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:32:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:32:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 04:32:01,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-06 04:32:01,509 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 49 transitions. [2022-12-06 04:32:01,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2022-12-06 04:32:01,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:32:01,512 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 52 flow [2022-12-06 04:32:01,514 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-06 04:32:01,516 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 04:32:01,516 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:01,516 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 52 flow [2022-12-06 04:32:01,518 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:01,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:01,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 52 flow [2022-12-06 04:32:01,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 04:32:01,523 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:32:01,523 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:01,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:32:01,523 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 04:32:01,523 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 04:32:01,580 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:32:01,582 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 04:32:01,582 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 04:32:01,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-06 04:32:01,582 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:01,582 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:01,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:32:01,583 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:32:01,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:01,583 INFO L85 PathProgramCache]: Analyzing trace with hash 331213688, now seen corresponding path program 1 times [2022-12-06 04:32:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:01,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038086155] [2022-12-06 04:32:01,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:01,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:01,743 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-06 04:32:01,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:01,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038086155] [2022-12-06 04:32:01,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038086155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:01,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:01,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:32:01,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194634503] [2022-12-06 04:32:01,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:01,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:32:01,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:32:01,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:32:01,746 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 04:32:01,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 04:32:01,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:01,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 04:32:01,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:01,867 INFO L130 PetriNetUnfolder]: 527/861 cut-off events. [2022-12-06 04:32:01,867 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-06 04:32:01,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 861 events. 527/861 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3938 event pairs, 143 based on Foata normal form. 16/873 useless extension candidates. Maximal degree in co-relation 1773. Up to 609 conditions per place. [2022-12-06 04:32:01,872 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 24 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 04:32:01,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 122 flow [2022-12-06 04:32:01,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:32:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:32:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 04:32:01,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 04:32:01,873 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 36 transitions. [2022-12-06 04:32:01,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 122 flow [2022-12-06 04:32:01,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:32:01,876 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-12-06 04:32:01,876 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-06 04:32:01,876 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2022-12-06 04:32:01,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:01,876 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 04:32:01,877 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:01,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:01,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 04:32:01,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 04:32:01,881 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:32:01,882 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:01,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:32:01,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 04:32:01,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 04:32:01,892 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:32:01,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 04:32:01,894 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2022-12-06 04:32:01,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 04:32:01,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:01,894 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:01,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:32:01,894 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:32:01,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:01,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1677689435, now seen corresponding path program 1 times [2022-12-06 04:32:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:01,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603990735] [2022-12-06 04:32:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:02,198 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-06 04:32:02,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:02,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603990735] [2022-12-06 04:32:02,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603990735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:02,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:02,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:32:02,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891940394] [2022-12-06 04:32:02,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:02,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:32:02,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:02,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:32:02,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:32:02,200 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:32:02,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-06 04:32:02,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:02,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:32:02,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:02,468 INFO L130 PetriNetUnfolder]: 1192/1767 cut-off events. [2022-12-06 04:32:02,468 INFO L131 PetriNetUnfolder]: For 157/157 co-relation queries the response was YES. [2022-12-06 04:32:02,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3851 conditions, 1767 events. 1192/1767 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7603 event pairs, 124 based on Foata normal form. 15/1782 useless extension candidates. Maximal degree in co-relation 3840. Up to 1071 conditions per place. [2022-12-06 04:32:02,475 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 44 selfloop transitions, 12 changer transitions 0/56 dead transitions. [2022-12-06 04:32:02,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 56 transitions, 252 flow [2022-12-06 04:32:02,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:32:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:32:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 04:32:02,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2022-12-06 04:32:02,476 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 5 states and 58 transitions. [2022-12-06 04:32:02,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 56 transitions, 252 flow [2022-12-06 04:32:02,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 56 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:32:02,478 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 137 flow [2022-12-06 04:32:02,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-06 04:32:02,478 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-12-06 04:32:02,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:02,479 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 137 flow [2022-12-06 04:32:02,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:02,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:02,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 137 flow [2022-12-06 04:32:02,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 137 flow [2022-12-06 04:32:02,498 INFO L130 PetriNetUnfolder]: 90/211 cut-off events. [2022-12-06 04:32:02,498 INFO L131 PetriNetUnfolder]: For 91/94 co-relation queries the response was YES. [2022-12-06 04:32:02,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 211 events. 90/211 cut-off events. For 91/94 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1016 event pairs, 28 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 522. Up to 116 conditions per place. [2022-12-06 04:32:02,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 137 flow [2022-12-06 04:32:02,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-06 04:32:02,602 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [340] L793-->L796: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] [2022-12-06 04:32:02,611 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [417] L2-1-->L836: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_130 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_261 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_130 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_262 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_229 256) 0)) .cse4))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_262) v_~x$w_buff0_used~0_261) (= (ite .cse0 v_~x$w_buff0~0_155 (ite .cse1 v_~x$w_buff1~0_134 v_~x~0_197)) v_~x~0_196) (= (ite .cse2 0 v_~x$r_buff0_thd0~0_130) v_~x$r_buff0_thd0~0_129) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_229) v_~x$w_buff1_used~0_228) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_129 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_228 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_130) v_~x$r_buff1_thd0~0_129)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~x$w_buff1~0=v_~x$w_buff1~0_134, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_229, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_130, ~x~0=v_~x~0_197, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_262} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_129, ~x$w_buff1~0=v_~x$w_buff1~0_134, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_228, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_129, ~x~0=v_~x~0_196, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_261} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:32:02,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [326] L747-->L754: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_20 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_124 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_108 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_109)) (= (ite .cse2 0 v_~x$w_buff0_used~0_124) v_~x$w_buff0_used~0_123) (= v_~x~0_85 (ite .cse2 v_~x$w_buff0~0_53 (ite .cse1 v_~x$w_buff1~0_48 v_~x~0_86))) (= v_~x$r_buff1_thd1~0_17 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_19 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_108 256) 0)))) 0 v_~x$r_buff1_thd1~0_18)) (= (ite .cse0 0 v_~x$r_buff0_thd1~0_20) v_~x$r_buff0_thd1~0_19)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_48, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x~0=v_~x~0_86, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_48, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17, ~x~0=v_~x~0_85, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:32:02,744 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:32:02,745 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 266 [2022-12-06 04:32:02,745 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 145 flow [2022-12-06 04:32:02,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-06 04:32:02,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:02,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:02,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:32:02,746 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:32:02,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:02,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1677346265, now seen corresponding path program 2 times [2022-12-06 04:32:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:02,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423576916] [2022-12-06 04:32:02,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:02,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:02,994 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-06 04:32:02,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:02,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423576916] [2022-12-06 04:32:02,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423576916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:02,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:02,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:32:02,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032683403] [2022-12-06 04:32:02,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:02,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:32:02,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:02,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:32:02,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:32:02,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:32:02,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 145 flow. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-06 04:32:02,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:02,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:32:02,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:03,256 INFO L130 PetriNetUnfolder]: 1415/2115 cut-off events. [2022-12-06 04:32:03,256 INFO L131 PetriNetUnfolder]: For 1833/1833 co-relation queries the response was YES. [2022-12-06 04:32:03,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6227 conditions, 2115 events. 1415/2115 cut-off events. For 1833/1833 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9169 event pairs, 318 based on Foata normal form. 100/2215 useless extension candidates. Maximal degree in co-relation 6213. Up to 812 conditions per place. [2022-12-06 04:32:03,266 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 37 selfloop transitions, 3 changer transitions 13/53 dead transitions. [2022-12-06 04:32:03,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 53 transitions, 328 flow [2022-12-06 04:32:03,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:32:03,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:32:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 04:32:03,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:32:03,267 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 145 flow. Second operand 4 states and 50 transitions. [2022-12-06 04:32:03,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 53 transitions, 328 flow [2022-12-06 04:32:03,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 314 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 04:32:03,270 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 110 flow [2022-12-06 04:32:03,270 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2022-12-06 04:32:03,270 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-06 04:32:03,270 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:03,270 INFO L89 Accepts]: Start accepts. Operand has 39 places, 24 transitions, 110 flow [2022-12-06 04:32:03,271 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:03,271 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:03,271 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 110 flow [2022-12-06 04:32:03,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 24 transitions, 110 flow [2022-12-06 04:32:03,280 INFO L130 PetriNetUnfolder]: 33/83 cut-off events. [2022-12-06 04:32:03,280 INFO L131 PetriNetUnfolder]: For 55/61 co-relation queries the response was YES. [2022-12-06 04:32:03,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 83 events. 33/83 cut-off events. For 55/61 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 276 event pairs, 29 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 221. Up to 55 conditions per place. [2022-12-06 04:32:03,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 24 transitions, 110 flow [2022-12-06 04:32:03,281 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 04:32:03,283 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L2-1-->L836: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_130 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_261 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_130 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_262 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_229 256) 0)) .cse4))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_262) v_~x$w_buff0_used~0_261) (= (ite .cse0 v_~x$w_buff0~0_155 (ite .cse1 v_~x$w_buff1~0_134 v_~x~0_197)) v_~x~0_196) (= (ite .cse2 0 v_~x$r_buff0_thd0~0_130) v_~x$r_buff0_thd0~0_129) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_229) v_~x$w_buff1_used~0_228) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_129 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_228 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_130) v_~x$r_buff1_thd0~0_129)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~x$w_buff1~0=v_~x$w_buff1~0_134, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_229, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_130, ~x~0=v_~x~0_197, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_262} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_129, ~x$w_buff1~0=v_~x$w_buff1~0_134, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_228, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_129, ~x~0=v_~x~0_196, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_261} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [333] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] [2022-12-06 04:32:03,423 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [448] L2-1-->L776: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_260 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_262 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_505 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_506 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_456 256) 0))))) (and (= v_~y~0_40 1) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_456) v_~x$w_buff1_used~0_455) (= (ite .cse2 0 v_~x$w_buff0_used~0_506) v_~x$w_buff0_used~0_505) (= v_~x$r_buff0_thd0~0_261 (ite .cse0 0 v_~x$r_buff0_thd0~0_262)) (= (ite .cse2 v_~x$w_buff0~0_322 (ite .cse1 v_~x$w_buff1~0_286 v_~x~0_422)) v_~x~0_421) (= v_~x$r_buff1_thd0~0_259 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_455 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_261 256) 0)))) 0 v_~x$r_buff1_thd0~0_260))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_322, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_262, ~x$w_buff1~0=v_~x$w_buff1~0_286, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_456, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_260, ~x~0=v_~x~0_422, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_506} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_322, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_261, ~x$w_buff1~0=v_~x$w_buff1~0_286, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_455, ~y~0=v_~y~0_40, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_259, ~x~0=v_~x~0_421, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_505} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~y~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [389] $Ultimate##0-->L793: Formula: (and (= v_~__unbuffered_p2_EAX~0_20 v_~y~0_4) (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_4} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] [2022-12-06 04:32:03,593 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:32:03,594 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 324 [2022-12-06 04:32:03,595 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 106 flow [2022-12-06 04:32:03,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-06 04:32:03,595 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:03,595 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:03,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:32:03,595 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:32:03,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:03,596 INFO L85 PathProgramCache]: Analyzing trace with hash -983161044, now seen corresponding path program 1 times [2022-12-06 04:32:03,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:03,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530175251] [2022-12-06 04:32:03,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:04,030 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-06 04:32:04,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:04,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530175251] [2022-12-06 04:32:04,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530175251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:04,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:04,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:32:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661899249] [2022-12-06 04:32:04,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:04,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:32:04,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:04,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:32:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:32:04,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:32:04,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 22 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-06 04:32:04,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:04,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:32:04,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:04,184 INFO L130 PetriNetUnfolder]: 623/972 cut-off events. [2022-12-06 04:32:04,184 INFO L131 PetriNetUnfolder]: For 1332/1335 co-relation queries the response was YES. [2022-12-06 04:32:04,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3066 conditions, 972 events. 623/972 cut-off events. For 1332/1335 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3799 event pairs, 268 based on Foata normal form. 10/972 useless extension candidates. Maximal degree in co-relation 3049. Up to 838 conditions per place. [2022-12-06 04:32:04,189 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 37 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2022-12-06 04:32:04,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 302 flow [2022-12-06 04:32:04,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:32:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:32:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 04:32:04,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 04:32:04,191 INFO L175 Difference]: Start difference. First operand has 38 places, 22 transitions, 106 flow. Second operand 5 states and 54 transitions. [2022-12-06 04:32:04,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 302 flow [2022-12-06 04:32:04,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 268 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 04:32:04,193 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 157 flow [2022-12-06 04:32:04,193 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2022-12-06 04:32:04,194 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-06 04:32:04,194 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:04,194 INFO L89 Accepts]: Start accepts. Operand has 39 places, 30 transitions, 157 flow [2022-12-06 04:32:04,196 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:04,196 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:04,196 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 157 flow [2022-12-06 04:32:04,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 157 flow [2022-12-06 04:32:04,210 INFO L130 PetriNetUnfolder]: 62/152 cut-off events. [2022-12-06 04:32:04,210 INFO L131 PetriNetUnfolder]: For 136/151 co-relation queries the response was YES. [2022-12-06 04:32:04,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 152 events. 62/152 cut-off events. For 136/151 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 631 event pairs, 40 based on Foata normal form. 5/147 useless extension candidates. Maximal degree in co-relation 436. Up to 89 conditions per place. [2022-12-06 04:32:04,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 157 flow [2022-12-06 04:32:04,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-06 04:32:04,213 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:32:04,214 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 04:32:04,214 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 157 flow [2022-12-06 04:32:04,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-06 04:32:04,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:04,215 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:04,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:32:04,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:32:04,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1676379278, now seen corresponding path program 1 times [2022-12-06 04:32:04,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:04,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564028424] [2022-12-06 04:32:04,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:04,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:04,359 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-06 04:32:04,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:04,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564028424] [2022-12-06 04:32:04,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564028424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:04,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:04,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:32:04,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28070166] [2022-12-06 04:32:04,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:04,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:32:04,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:04,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:32:04,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:32:04,361 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:32:04,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 04:32:04,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:04,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:32:04,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:04,454 INFO L130 PetriNetUnfolder]: 340/585 cut-off events. [2022-12-06 04:32:04,455 INFO L131 PetriNetUnfolder]: For 875/895 co-relation queries the response was YES. [2022-12-06 04:32:04,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 585 events. 340/585 cut-off events. For 875/895 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2295 event pairs, 117 based on Foata normal form. 30/602 useless extension candidates. Maximal degree in co-relation 1940. Up to 429 conditions per place. [2022-12-06 04:32:04,458 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 35 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2022-12-06 04:32:04,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 283 flow [2022-12-06 04:32:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:32:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:32:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 04:32:04,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-06 04:32:04,460 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 157 flow. Second operand 3 states and 39 transitions. [2022-12-06 04:32:04,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 283 flow [2022-12-06 04:32:04,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 277 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 04:32:04,462 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 177 flow [2022-12-06 04:32:04,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-12-06 04:32:04,463 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-06 04:32:04,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:04,463 INFO L89 Accepts]: Start accepts. Operand has 41 places, 33 transitions, 177 flow [2022-12-06 04:32:04,463 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:04,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:04,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 177 flow [2022-12-06 04:32:04,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 177 flow [2022-12-06 04:32:04,482 INFO L130 PetriNetUnfolder]: 82/200 cut-off events. [2022-12-06 04:32:04,482 INFO L131 PetriNetUnfolder]: For 100/102 co-relation queries the response was YES. [2022-12-06 04:32:04,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 200 events. 82/200 cut-off events. For 100/102 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 907 event pairs, 42 based on Foata normal form. 1/187 useless extension candidates. Maximal degree in co-relation 560. Up to 92 conditions per place. [2022-12-06 04:32:04,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 177 flow [2022-12-06 04:32:04,483 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 04:32:04,484 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:32:04,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 04:32:04,485 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 177 flow [2022-12-06 04:32:04,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 04:32:04,485 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:04,485 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:04,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:32:04,485 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:32:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:04,486 INFO L85 PathProgramCache]: Analyzing trace with hash 684074512, now seen corresponding path program 1 times [2022-12-06 04:32:04,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:04,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777905162] [2022-12-06 04:32:04,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:04,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:04,625 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-06 04:32:04,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:04,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777905162] [2022-12-06 04:32:04,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777905162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:04,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:04,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:32:04,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965586395] [2022-12-06 04:32:04,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:04,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:32:04,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:04,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:32:04,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:32:04,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:32:04,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-06 04:32:04,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:04,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:32:04,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:04,701 INFO L130 PetriNetUnfolder]: 178/335 cut-off events. [2022-12-06 04:32:04,702 INFO L131 PetriNetUnfolder]: For 388/394 co-relation queries the response was YES. [2022-12-06 04:32:04,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 335 events. 178/335 cut-off events. For 388/394 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1211 event pairs, 49 based on Foata normal form. 32/362 useless extension candidates. Maximal degree in co-relation 1205. Up to 125 conditions per place. [2022-12-06 04:32:04,703 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 42 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2022-12-06 04:32:04,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 359 flow [2022-12-06 04:32:04,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:32:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:32:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 04:32:04,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 04:32:04,705 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 177 flow. Second operand 4 states and 51 transitions. [2022-12-06 04:32:04,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 359 flow [2022-12-06 04:32:04,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 351 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:32:04,706 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 211 flow [2022-12-06 04:32:04,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2022-12-06 04:32:04,707 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-06 04:32:04,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:04,707 INFO L89 Accepts]: Start accepts. Operand has 44 places, 36 transitions, 211 flow [2022-12-06 04:32:04,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:04,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:04,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 211 flow [2022-12-06 04:32:04,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 211 flow [2022-12-06 04:32:04,718 INFO L130 PetriNetUnfolder]: 37/113 cut-off events. [2022-12-06 04:32:04,718 INFO L131 PetriNetUnfolder]: For 94/104 co-relation queries the response was YES. [2022-12-06 04:32:04,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 113 events. 37/113 cut-off events. For 94/104 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 392 event pairs, 10 based on Foata normal form. 7/116 useless extension candidates. Maximal degree in co-relation 358. Up to 46 conditions per place. [2022-12-06 04:32:04,719 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 211 flow [2022-12-06 04:32:04,719 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 04:32:04,720 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:32:04,720 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 04:32:04,721 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 211 flow [2022-12-06 04:32:04,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-06 04:32:04,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:04,721 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:04,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:32:04,721 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:32:04,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:04,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1052109919, now seen corresponding path program 1 times [2022-12-06 04:32:04,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:04,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693454035] [2022-12-06 04:32:04,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:04,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:04,903 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-06 04:32:04,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:04,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693454035] [2022-12-06 04:32:04,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693454035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:04,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:04,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:32:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102063371] [2022-12-06 04:32:04,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:04,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:32:04,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:04,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:32:04,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:32:04,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:32:04,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-06 04:32:04,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:04,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:32:04,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:04,977 INFO L130 PetriNetUnfolder]: 152/280 cut-off events. [2022-12-06 04:32:04,977 INFO L131 PetriNetUnfolder]: For 502/506 co-relation queries the response was YES. [2022-12-06 04:32:04,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 280 events. 152/280 cut-off events. For 502/506 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 974 event pairs, 44 based on Foata normal form. 13/289 useless extension candidates. Maximal degree in co-relation 1041. Up to 125 conditions per place. [2022-12-06 04:32:04,979 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 39 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2022-12-06 04:32:04,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 379 flow [2022-12-06 04:32:04,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:32:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:32:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-12-06 04:32:04,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-06 04:32:04,980 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 211 flow. Second operand 5 states and 53 transitions. [2022-12-06 04:32:04,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 379 flow [2022-12-06 04:32:04,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 349 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 04:32:04,981 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 211 flow [2022-12-06 04:32:04,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2022-12-06 04:32:04,982 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2022-12-06 04:32:04,982 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:04,982 INFO L89 Accepts]: Start accepts. Operand has 46 places, 36 transitions, 211 flow [2022-12-06 04:32:04,983 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:04,983 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:04,983 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 36 transitions, 211 flow [2022-12-06 04:32:04,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 211 flow [2022-12-06 04:32:04,990 INFO L130 PetriNetUnfolder]: 28/83 cut-off events. [2022-12-06 04:32:04,990 INFO L131 PetriNetUnfolder]: For 99/102 co-relation queries the response was YES. [2022-12-06 04:32:04,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 83 events. 28/83 cut-off events. For 99/102 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 255 event pairs, 5 based on Foata normal form. 1/80 useless extension candidates. Maximal degree in co-relation 249. Up to 27 conditions per place. [2022-12-06 04:32:04,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 36 transitions, 211 flow [2022-12-06 04:32:04,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 04:32:05,780 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:32:05,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 799 [2022-12-06 04:32:05,781 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 205 flow [2022-12-06 04:32:05,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-06 04:32:05,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:05,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:05,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:32:05,782 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:32:05,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash 692378575, now seen corresponding path program 1 times [2022-12-06 04:32:05,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:05,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358700839] [2022-12-06 04:32:05,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:05,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:05,958 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-06 04:32:05,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:05,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358700839] [2022-12-06 04:32:05,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358700839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:05,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:05,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:32:05,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108808537] [2022-12-06 04:32:05,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:05,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:32:05,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:05,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:32:05,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:32:05,960 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 04:32:05,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-06 04:32:05,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:05,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 04:32:05,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:06,078 INFO L130 PetriNetUnfolder]: 178/334 cut-off events. [2022-12-06 04:32:06,078 INFO L131 PetriNetUnfolder]: For 695/696 co-relation queries the response was YES. [2022-12-06 04:32:06,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 334 events. 178/334 cut-off events. For 695/696 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1270 event pairs, 16 based on Foata normal form. 2/336 useless extension candidates. Maximal degree in co-relation 1284. Up to 191 conditions per place. [2022-12-06 04:32:06,080 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 34 selfloop transitions, 1 changer transitions 27/64 dead transitions. [2022-12-06 04:32:06,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 524 flow [2022-12-06 04:32:06,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:32:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:32:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 04:32:06,081 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-06 04:32:06,082 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 205 flow. Second operand 4 states and 38 transitions. [2022-12-06 04:32:06,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 64 transitions, 524 flow [2022-12-06 04:32:06,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 64 transitions, 468 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 04:32:06,084 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 161 flow [2022-12-06 04:32:06,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2022-12-06 04:32:06,085 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-06 04:32:06,085 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:06,085 INFO L89 Accepts]: Start accepts. Operand has 45 places, 29 transitions, 161 flow [2022-12-06 04:32:06,086 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:06,086 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:06,086 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 29 transitions, 161 flow [2022-12-06 04:32:06,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 29 transitions, 161 flow [2022-12-06 04:32:06,092 INFO L130 PetriNetUnfolder]: 23/71 cut-off events. [2022-12-06 04:32:06,093 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 04:32:06,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 71 events. 23/71 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 203 event pairs, 2 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 201. Up to 21 conditions per place. [2022-12-06 04:32:06,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 29 transitions, 161 flow [2022-12-06 04:32:06,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 04:32:06,251 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] $Ultimate##0-->L747: Formula: (and (= v_~z~0_44 1) (= v_P0Thread1of1ForFork2_~arg.base_17 |v_P0Thread1of1ForFork2_#in~arg.base_17|) (= v_~x~0_439 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_17)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_17, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~z~0=v_~z~0_44, ~x~0=v_~x~0_439, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_17} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] and [334] L776-->L783: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_135 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_136 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_117 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= v_~x~0_89 (ite .cse0 v_~x$w_buff0~0_61 (ite .cse1 v_~x$w_buff1~0_52 v_~x~0_90))) (= v_~x$w_buff0_used~0_135 (ite .cse0 0 v_~x$w_buff0_used~0_136)) (= v_~x$w_buff1_used~0_116 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_117)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_116 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_27) v_~x$r_buff0_thd2~0_26)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_61, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_117, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_90, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_61, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_116, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:32:06,324 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] $Ultimate##0-->L747: Formula: (and (= v_~z~0_44 1) (= v_P0Thread1of1ForFork2_~arg.base_17 |v_P0Thread1of1ForFork2_#in~arg.base_17|) (= v_~x~0_439 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_17)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_17, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~z~0=v_~z~0_44, ~x~0=v_~x~0_439, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_17} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] and [341] L796-->L803: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_110) v_~x$w_buff0_used~0_109) (= v_~x$w_buff1_used~0_96 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_97)) (= v_~x$r_buff0_thd3~0_23 (ite .cse2 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_20)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:32:06,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [449] $Ultimate##0-->L776: Formula: (and (= v_~x$r_buff0_thd3~0_169 v_~x$r_buff1_thd3~0_161) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_29| |v_P1Thread1of1ForFork0_~arg#1.offset_29|) (= v_~x$w_buff0~0_325 v_~x$w_buff1~0_288) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_509 256) 0)) (not (= (mod v_~x$w_buff1_used~0_459 256) 0)))) 1 0)) (= v_~x$w_buff0_used~0_509 1) (= 2 v_~x$w_buff0~0_324) (= v_~x$r_buff1_thd1~0_100 v_~x$r_buff0_thd1~0_99) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| 0)) (= v_~x$r_buff0_thd0~0_265 v_~x$r_buff1_thd0~0_263) (= |v_P1Thread1of1ForFork0_~arg#1.base_29| |v_P1Thread1of1ForFork0_#in~arg#1.base_29|) (= v_~x$r_buff0_thd2~0_144 1) (= v_~y~0_42 1) (= v_~x$w_buff0_used~0_510 v_~x$w_buff1_used~0_459) (= v_~x$r_buff0_thd2~0_145 v_~x$r_buff1_thd2~0_111) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_325, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_265, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_145, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_510} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_324, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_265, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_99, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_29|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_288, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_161, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_111, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_459, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_100, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_144, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_263, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_509, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~y~0=v_~y~0_42} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [457] $Ultimate##0-->L803: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_531 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd3~0_166 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_174 256) 0)))) (let ((.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_532 256) 0)))) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_478 256) 0)))) (.cse0 (and .cse4 .cse5))) (and (= v_P2Thread1of1ForFork1_~arg.offset_29 |v_P2Thread1of1ForFork1_#in~arg.offset_29|) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_174) v_~x$r_buff0_thd3~0_173) (= (ite .cse1 v_~x$w_buff0~0_340 (ite .cse2 v_~x$w_buff1~0_300 v_~x~0_444)) v_~x~0_443) (= v_~y~0_54 v_~__unbuffered_p2_EAX~0_103) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_477 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd3~0_173 256) 0)))) 0 v_~x$r_buff1_thd3~0_166) v_~x$r_buff1_thd3~0_165) (= v_~x$w_buff0_used~0_531 (ite .cse1 0 v_~x$w_buff0_used~0_532)) (= v_~x$w_buff1_used~0_477 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_478)) (= v_~__unbuffered_p2_EBX~0_101 v_~z~0_48) (= v_P2Thread1of1ForFork1_~arg.base_29 |v_P2Thread1of1ForFork1_#in~arg.base_29|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_340, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_300, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_166, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_478, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_29|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_174, ~z~0=v_~z~0_48, ~y~0=v_~y~0_54, ~x~0=v_~x~0_444, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_532} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_340, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_29|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_101, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_29, ~x$w_buff1~0=v_~x$w_buff1~0_300, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_165, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_477, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_173, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_531, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_103, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_29|, ~z~0=v_~z~0_48, ~y~0=v_~y~0_54, ~x~0=v_~x~0_443} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:32:06,680 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] $Ultimate##0-->L796: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_~__unbuffered_p2_EBX~0_93 v_~z~0_36) (= v_~y~0_48 v_~__unbuffered_p2_EAX~0_95) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_36, ~y~0=v_~y~0_48} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_93, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_95, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_36, ~y~0=v_~y~0_48} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] and [459] $Ultimate##0-->L803: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_170 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_539 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_178 256) 0)))) (let ((.cse0 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_540 256) 0)) .cse5)) (.cse3 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_486 256) 0))))) (and (= v_~x$r_buff0_thd3~0_177 (ite .cse0 0 v_~x$r_buff0_thd3~0_178)) (= (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd3~0_177 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_485 256) 0)))) 0 v_~x$r_buff1_thd3~0_170) v_~x$r_buff1_thd3~0_169) (= v_P0Thread1of1ForFork2_~arg.base_23 |v_P0Thread1of1ForFork2_#in~arg.base_23|) (= v_~x$w_buff1_used~0_485 (ite (or .cse0 .cse3) 0 v_~x$w_buff1_used~0_486)) (= |v_P0Thread1of1ForFork2_#in~arg.offset_23| v_P0Thread1of1ForFork2_~arg.offset_23) (= (ite .cse4 0 v_~x$w_buff0_used~0_540) v_~x$w_buff0_used~0_539) (= v_~z~0_52 1) (= (ite .cse4 v_~x$w_buff0~0_344 (ite .cse3 v_~x$w_buff1~0_304 1)) v_~x~0_451)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_344, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_170, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_486, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_178, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_540} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_344, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, ~x$w_buff1~0=v_~x$w_buff1~0_304, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_23, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_169, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_485, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_177, ~z~0=v_~z~0_52, ~x~0=v_~x~0_451, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_539, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_23} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0, P0Thread1of1ForFork2_~arg.base] [2022-12-06 04:32:06,788 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [449] $Ultimate##0-->L776: Formula: (and (= v_~x$r_buff0_thd3~0_169 v_~x$r_buff1_thd3~0_161) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_29| |v_P1Thread1of1ForFork0_~arg#1.offset_29|) (= v_~x$w_buff0~0_325 v_~x$w_buff1~0_288) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_509 256) 0)) (not (= (mod v_~x$w_buff1_used~0_459 256) 0)))) 1 0)) (= v_~x$w_buff0_used~0_509 1) (= 2 v_~x$w_buff0~0_324) (= v_~x$r_buff1_thd1~0_100 v_~x$r_buff0_thd1~0_99) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| 0)) (= v_~x$r_buff0_thd0~0_265 v_~x$r_buff1_thd0~0_263) (= |v_P1Thread1of1ForFork0_~arg#1.base_29| |v_P1Thread1of1ForFork0_#in~arg#1.base_29|) (= v_~x$r_buff0_thd2~0_144 1) (= v_~y~0_42 1) (= v_~x$w_buff0_used~0_510 v_~x$w_buff1_used~0_459) (= v_~x$r_buff0_thd2~0_145 v_~x$r_buff1_thd2~0_111) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_325, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_265, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_145, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_510} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_324, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_265, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_99, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_29|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_288, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_161, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_111, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_459, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_100, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_144, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_263, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_509, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~y~0=v_~y~0_42} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [462] $Ultimate##0-->L803: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_182 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_559 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_190 256) 0)))) (let ((.cse2 (and .cse3 .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_504 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_560 256) 0)) .cse5))) (and (= v_P2Thread1of1ForFork1_~arg.offset_33 |v_P2Thread1of1ForFork1_#in~arg.offset_33|) (= (ite .cse0 v_~x$w_buff0~0_354 (ite .cse1 v_~x$w_buff1~0_312 1)) v_~x~0_469) (= v_P0Thread1of1ForFork2_~arg.base_27 |v_P0Thread1of1ForFork2_#in~arg.base_27|) (= v_~y~0_58 v_~__unbuffered_p2_EAX~0_107) (= v_P2Thread1of1ForFork1_~arg.base_33 |v_P2Thread1of1ForFork1_#in~arg.base_33|) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_190) v_~x$r_buff0_thd3~0_189) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_504) v_~x$w_buff1_used~0_503) (= v_~x$w_buff0_used~0_559 (ite .cse0 0 v_~x$w_buff0_used~0_560)) (= v_~z~0_58 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_27| v_P0Thread1of1ForFork2_~arg.offset_27) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_189 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_503 256) 0)))) 0 v_~x$r_buff1_thd3~0_182) v_~x$r_buff1_thd3~0_181) (= v_~__unbuffered_p2_EBX~0_105 v_~z~0_59)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_354, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_33|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_312, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_182, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_27|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_33|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_190, ~z~0=v_~z~0_59, ~y~0=v_~y~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_560} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_354, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_33|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_105, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_33, ~x$w_buff1~0=v_~x$w_buff1~0_312, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_181, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_503, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_27|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_189, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_559, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_27, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_27|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_33, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_33|, ~z~0=v_~z~0_58, ~y~0=v_~y~0_58, ~x~0=v_~x~0_469} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork2_~arg.offset, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0, P0Thread1of1ForFork2_~arg.base] [2022-12-06 04:32:07,003 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 04:32:07,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 919 [2022-12-06 04:32:07,004 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 184 flow [2022-12-06 04:32:07,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-06 04:32:07,004 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:07,004 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:07,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:32:07,004 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:32:07,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:07,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1162963065, now seen corresponding path program 1 times [2022-12-06 04:32:07,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:07,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843592963] [2022-12-06 04:32:07,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:07,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:07,560 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-06 04:32:07,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:07,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843592963] [2022-12-06 04:32:07,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843592963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:07,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:07,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:32:07,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120335610] [2022-12-06 04:32:07,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:07,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:32:07,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:07,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:32:07,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:32:07,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:32:07,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 184 flow. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-06 04:32:07,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:07,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:32:07,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:07,688 INFO L130 PetriNetUnfolder]: 119/236 cut-off events. [2022-12-06 04:32:07,688 INFO L131 PetriNetUnfolder]: For 502/502 co-relation queries the response was YES. [2022-12-06 04:32:07,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 236 events. 119/236 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 947 event pairs, 10 based on Foata normal form. 1/237 useless extension candidates. Maximal degree in co-relation 947. Up to 131 conditions per place. [2022-12-06 04:32:07,690 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 33 selfloop transitions, 12 changer transitions 7/52 dead transitions. [2022-12-06 04:32:07,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 415 flow [2022-12-06 04:32:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:32:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:32:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-12-06 04:32:07,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2022-12-06 04:32:07,691 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 184 flow. Second operand 6 states and 38 transitions. [2022-12-06 04:32:07,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 415 flow [2022-12-06 04:32:07,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 381 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-06 04:32:07,694 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 220 flow [2022-12-06 04:32:07,694 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-06 04:32:07,694 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-12-06 04:32:07,694 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:07,694 INFO L89 Accepts]: Start accepts. Operand has 43 places, 32 transitions, 220 flow [2022-12-06 04:32:07,695 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:07,695 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:07,695 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 220 flow [2022-12-06 04:32:07,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 220 flow [2022-12-06 04:32:07,703 INFO L130 PetriNetUnfolder]: 28/91 cut-off events. [2022-12-06 04:32:07,703 INFO L131 PetriNetUnfolder]: For 118/124 co-relation queries the response was YES. [2022-12-06 04:32:07,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 91 events. 28/91 cut-off events. For 118/124 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 378 event pairs, 2 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 307. Up to 26 conditions per place. [2022-12-06 04:32:07,704 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 220 flow [2022-12-06 04:32:07,704 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 04:32:07,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [456] $Ultimate##0-->L747: Formula: (and (= v_~x~0_441 1) (= v_~z~0_46 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_19| v_P0Thread1of1ForFork2_~arg.offset_19) (= v_P0Thread1of1ForFork2_~arg.base_19 |v_P0Thread1of1ForFork2_#in~arg.base_19|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_19|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_19|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_19|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_19, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_19|, ~z~0=v_~z~0_46, ~x~0=v_~x~0_441, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_19} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] and [341] L796-->L803: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_110) v_~x$w_buff0_used~0_109) (= v_~x$w_buff1_used~0_96 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_97)) (= v_~x$r_buff0_thd3~0_23 (ite .cse2 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_20)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:32:07,817 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [456] $Ultimate##0-->L747: Formula: (and (= v_~x~0_441 1) (= v_~z~0_46 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_19| v_P0Thread1of1ForFork2_~arg.offset_19) (= v_P0Thread1of1ForFork2_~arg.base_19 |v_P0Thread1of1ForFork2_#in~arg.base_19|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_19|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_19|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_19|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_19, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_19|, ~z~0=v_~z~0_46, ~x~0=v_~x~0_441, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_19} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] and [334] L776-->L783: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_135 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_136 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_117 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= v_~x~0_89 (ite .cse0 v_~x$w_buff0~0_61 (ite .cse1 v_~x$w_buff1~0_52 v_~x~0_90))) (= v_~x$w_buff0_used~0_135 (ite .cse0 0 v_~x$w_buff0_used~0_136)) (= v_~x$w_buff1_used~0_116 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_117)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_116 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_27) v_~x$r_buff0_thd2~0_26)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_61, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_117, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_90, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_61, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_116, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:32:07,978 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:32:07,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 285 [2022-12-06 04:32:07,979 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 226 flow [2022-12-06 04:32:07,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-06 04:32:07,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:07,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:07,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:32:07,979 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:32:07,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:07,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1229435124, now seen corresponding path program 1 times [2022-12-06 04:32:07,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:07,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068054650] [2022-12-06 04:32:07,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:07,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:32:08,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:32:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:32:08,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:32:08,100 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:32:08,101 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:32:08,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:32:08,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:32:08,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:32:08,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:32:08,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:32:08,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:32:08,104 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:08,109 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:32:08,109 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:32:08,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:32:08 BasicIcfg [2022-12-06 04:32:08,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:32:08,169 INFO L158 Benchmark]: Toolchain (without parser) took 13351.49ms. Allocated memory was 177.2MB in the beginning and 459.3MB in the end (delta: 282.1MB). Free memory was 150.6MB in the beginning and 405.7MB in the end (delta: -255.1MB). Peak memory consumption was 26.7MB. Max. memory is 8.0GB. [2022-12-06 04:32:08,169 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:32:08,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.46ms. Allocated memory is still 177.2MB. Free memory was 150.6MB in the beginning and 124.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 04:32:08,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.52ms. Allocated memory is still 177.2MB. Free memory was 124.2MB in the beginning and 121.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:32:08,170 INFO L158 Benchmark]: Boogie Preprocessor took 39.62ms. Allocated memory is still 177.2MB. Free memory was 121.7MB in the beginning and 119.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:32:08,170 INFO L158 Benchmark]: RCFGBuilder took 577.01ms. Allocated memory is still 177.2MB. Free memory was 119.6MB in the beginning and 127.4MB in the end (delta: -7.9MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-12-06 04:32:08,170 INFO L158 Benchmark]: TraceAbstraction took 12106.07ms. Allocated memory was 177.2MB in the beginning and 459.3MB in the end (delta: 282.1MB). Free memory was 126.9MB in the beginning and 405.7MB in the end (delta: -278.8MB). Peak memory consumption was 2.7MB. Max. memory is 8.0GB. [2022-12-06 04:32:08,171 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.10ms. Allocated memory is still 127.9MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 554.46ms. Allocated memory is still 177.2MB. Free memory was 150.6MB in the beginning and 124.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.52ms. Allocated memory is still 177.2MB. Free memory was 124.2MB in the beginning and 121.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.62ms. Allocated memory is still 177.2MB. Free memory was 121.7MB in the beginning and 119.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 577.01ms. Allocated memory is still 177.2MB. Free memory was 119.6MB in the beginning and 127.4MB in the end (delta: -7.9MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * TraceAbstraction took 12106.07ms. Allocated memory was 177.2MB in the beginning and 459.3MB in the end (delta: 282.1MB). Free memory was 126.9MB in the beginning and 405.7MB in the end (delta: -278.8MB). Peak memory consumption was 2.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 113 PlacesBefore, 36 PlacesAfterwards, 105 TransitionsBefore, 27 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1332, independent: 1274, independent conditional: 1274, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1332, independent: 1274, independent conditional: 0, independent unconditional: 1274, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1332, independent: 1274, independent conditional: 0, independent unconditional: 1274, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1332, independent: 1274, independent conditional: 0, independent unconditional: 1274, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1117, independent: 1077, independent conditional: 0, independent unconditional: 1077, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1117, independent: 1063, independent conditional: 0, independent unconditional: 1063, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 329, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 315, dependent conditional: 0, dependent unconditional: 315, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1332, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 1117, unknown conditional: 0, unknown unconditional: 1117] , Statistics on independence cache: Total cache size (in pairs): 1664, Positive cache size: 1624, Positive conditional cache size: 0, Positive unconditional cache size: 1624, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, 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, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 103, independent: 81, independent conditional: 8, independent unconditional: 73, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103, independent: 81, independent conditional: 8, independent unconditional: 73, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103, independent: 81, independent conditional: 8, independent unconditional: 73, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 89, independent: 74, independent conditional: 7, independent unconditional: 67, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 89, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 53, dependent conditional: 11, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 103, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 89, unknown conditional: 9, unknown unconditional: 80] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 74, Positive conditional cache size: 7, Positive unconditional cache size: 67, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, 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, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 94, independent: 74, independent conditional: 3, independent unconditional: 71, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 94, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 94, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 86, Positive conditional cache size: 7, Positive unconditional cache size: 79, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 36 PlacesBefore, 35 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 199, independent: 173, independent conditional: 173, 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: 199, independent: 173, independent conditional: 63, independent unconditional: 110, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 199, independent: 173, independent conditional: 29, independent unconditional: 144, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 199, independent: 173, independent conditional: 29, independent unconditional: 144, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 4, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 199, independent: 159, independent conditional: 26, independent unconditional: 133, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 18, unknown conditional: 4, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 108, Positive conditional cache size: 10, Positive unconditional cache size: 98, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 39 PlacesBefore, 38 PlacesAfterwards, 24 TransitionsBefore, 22 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 141, independent: 124, independent conditional: 47, independent unconditional: 77, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 141, independent: 124, independent conditional: 3, independent unconditional: 121, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 141, independent: 124, independent conditional: 3, independent unconditional: 121, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 141, independent: 113, independent conditional: 3, independent unconditional: 110, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 138, Positive conditional cache size: 10, Positive unconditional cache size: 128, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 56, independent conditional: 16, independent unconditional: 40, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 56, independent conditional: 11, independent unconditional: 45, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 56, independent conditional: 11, independent unconditional: 45, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 54, independent conditional: 11, independent unconditional: 43, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 140, Positive conditional cache size: 10, Positive unconditional cache size: 130, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 12, independent unconditional: 23, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 35, independent conditional: 9, independent unconditional: 26, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 9, independent unconditional: 26, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 40, independent: 35, independent conditional: 9, independent unconditional: 26, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 140, Positive conditional cache size: 10, Positive unconditional cache size: 130, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 40, independent conditional: 12, independent unconditional: 28, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 40, independent conditional: 9, independent unconditional: 31, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 40, independent conditional: 9, independent unconditional: 31, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 45, independent: 38, independent conditional: 9, independent unconditional: 29, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 142, Positive conditional cache size: 10, Positive unconditional cache size: 132, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 46 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 33 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 28, independent conditional: 16, independent unconditional: 12, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 38, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 156, Positive conditional cache size: 10, Positive unconditional cache size: 146, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 43 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 38, independent conditional: 26, independent unconditional: 12, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 38, independent conditional: 18, independent unconditional: 20, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 38, independent conditional: 18, independent unconditional: 20, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 37, independent conditional: 17, independent unconditional: 20, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 221, Positive conditional cache size: 15, Positive unconditional cache size: 206, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 43 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 38, independent conditional: 30, independent unconditional: 8, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 38, independent conditional: 12, independent unconditional: 26, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 38, independent conditional: 12, independent unconditional: 26, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, 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: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 34, independent conditional: 9, independent unconditional: 25, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 242, Positive conditional cache size: 18, Positive unconditional cache size: 224, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t2284; [L821] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2284, ((void *)0), P0, ((void *)0))=-2, t2284={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2285; [L823] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2285, ((void *)0), P1, ((void *)0))=-1, t2284={5:0}, t2285={6: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t2286; [L825] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2286, ((void *)0), P2, ((void *)0))=0, t2284={5:0}, t2285={6:0}, t2286={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 [L775] 2 y = 1 [L792] 2 __unbuffered_p2_EAX = y [L795] 2 __unbuffered_p2_EBX = z [L743] 2 z = 1 [L746] 2 x = 1 [L798] 2 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 2 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 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) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 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 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 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_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] 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) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 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_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: 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: 823]: 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: 821]: 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: 825]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 locations, 6 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.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 225 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 555 IncrementalHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 9 mSDtfsCounter, 555 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=10, InterpolantAutomatonStates: 42, 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, 2.4s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-06 04:32:08,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...