/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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:19:17,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:19:17,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:19:17,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:19:17,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:19:17,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:19:17,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:19:17,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:19:17,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:19:17,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:19:17,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:19:17,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:19:17,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:19:17,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:19:17,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:19:17,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:19:17,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:19:17,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:19:17,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:19:17,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:19:17,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:19:17,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:19:17,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:19:17,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:19:17,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:19:17,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:19:17,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:19:17,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:19:17,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:19:17,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:19:17,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:19:17,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:19:17,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:19:17,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:19:17,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:19:17,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:19:17,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:19:17,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:19:17,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:19:17,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:19:17,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:19:17,380 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-13 09:19:17,415 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:19:17,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:19:17,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:19:17,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:19:17,418 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:19:17,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:19:17,419 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:19:17,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:19:17,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:19:17,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:19:17,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:19:17,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:19:17,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:19:17,420 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:19:17,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:19:17,420 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:19:17,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:19:17,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:19:17,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:19:17,421 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:19:17,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:19:17,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:19:17,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:19:17,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:19:17,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:19:17,422 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:19:17,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:19:17,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:19:17,422 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:19:17,422 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:19:17,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:19:17,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:19:17,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:19:17,736 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:19:17,736 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:19:17,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-13 09:19:18,797 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:19:19,082 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:19:19,083 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-13 09:19:19,100 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1df6951c/2744d252f7134671a6e8cf90495092de/FLAG2b4b3ec96 [2022-12-13 09:19:19,112 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1df6951c/2744d252f7134671a6e8cf90495092de [2022-12-13 09:19:19,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:19:19,115 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:19:19,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:19:19,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:19:19,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:19:19,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:19:19" (1/1) ... [2022-12-13 09:19:19,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8dd20b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:19, skipping insertion in model container [2022-12-13 09:19:19,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:19:19" (1/1) ... [2022-12-13 09:19:19,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:19:19,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:19:19,322 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-12-13 09:19:19,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:19:19,558 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:19:19,570 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-12-13 09:19:19,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:19,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:19,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:19:19,675 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:19:19,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:19 WrapperNode [2022-12-13 09:19:19,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:19:19,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:19:19,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:19:19,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:19:19,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:19" (1/1) ... [2022-12-13 09:19:19,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:19" (1/1) ... [2022-12-13 09:19:19,745 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2022-12-13 09:19:19,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:19:19,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:19:19,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:19:19,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:19:19,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:19" (1/1) ... [2022-12-13 09:19:19,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:19" (1/1) ... [2022-12-13 09:19:19,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:19" (1/1) ... [2022-12-13 09:19:19,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:19" (1/1) ... [2022-12-13 09:19:19,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:19" (1/1) ... [2022-12-13 09:19:19,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:19" (1/1) ... [2022-12-13 09:19:19,781 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:19" (1/1) ... [2022-12-13 09:19:19,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:19" (1/1) ... [2022-12-13 09:19:19,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:19:19,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:19:19,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:19:19,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:19:19,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:19" (1/1) ... [2022-12-13 09:19:19,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:19:19,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:19:19,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:19:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:19:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:19:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:19:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:19:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:19:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:19:19,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:19:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:19:19,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:19:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:19:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:19:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:19:19,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:19:19,863 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:19:19,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:19:20,020 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:19:20,022 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:19:20,308 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:19:20,440 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:19:20,440 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:19:20,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:19:20 BoogieIcfgContainer [2022-12-13 09:19:20,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:19:20,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:19:20,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:19:20,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:19:20,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:19:19" (1/3) ... [2022-12-13 09:19:20,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ee5d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:19:20, skipping insertion in model container [2022-12-13 09:19:20,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:19" (2/3) ... [2022-12-13 09:19:20,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ee5d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:19:20, skipping insertion in model container [2022-12-13 09:19:20,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:19:20" (3/3) ... [2022-12-13 09:19:20,449 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-13 09:19:20,465 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:19:20,465 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:19:20,465 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:19:20,516 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:19:20,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2022-12-13 09:19:20,609 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-13 09:19:20,610 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:20,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 09:19:20,615 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2022-12-13 09:19:20,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2022-12-13 09:19:20,620 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:20,646 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-13 09:19:20,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2022-12-13 09:19:20,685 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-13 09:19:20,685 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:20,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 09:19:20,688 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-13 09:19:20,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 1104 [2022-12-13 09:19:24,915 INFO L241 LiptonReduction]: Total number of compositions: 72 [2022-12-13 09:19:24,930 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:19:24,936 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;@4351d4ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:19:24,936 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 09:19:24,938 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 09:19:24,938 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:24,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:24,939 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 09:19:24,939 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:19:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:24,943 INFO L85 PathProgramCache]: Analyzing trace with hash 425621, now seen corresponding path program 1 times [2022-12-13 09:19:24,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:24,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249366990] [2022-12-13 09:19:24,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:24,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:25,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:25,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249366990] [2022-12-13 09:19:25,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249366990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:25,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:25,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:19:25,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866933109] [2022-12-13 09:19:25,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:25,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:19:25,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:25,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:19:25,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:19:25,319 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 51 [2022-12-13 09:19:25,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:25,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:25,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 51 [2022-12-13 09:19:25,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:25,666 INFO L130 PetriNetUnfolder]: 1122/2078 cut-off events. [2022-12-13 09:19:25,666 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 09:19:25,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3937 conditions, 2078 events. 1122/2078 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 13249 event pairs, 386 based on Foata normal form. 0/1228 useless extension candidates. Maximal degree in co-relation 3927. Up to 1589 conditions per place. [2022-12-13 09:19:25,679 INFO L137 encePairwiseOnDemand]: 46/51 looper letters, 24 selfloop transitions, 2 changer transitions 47/81 dead transitions. [2022-12-13 09:19:25,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 315 flow [2022-12-13 09:19:25,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2022-12-13 09:19:25,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6797385620915033 [2022-12-13 09:19:25,694 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 108 flow. Second operand 3 states and 104 transitions. [2022-12-13 09:19:25,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 315 flow [2022-12-13 09:19:25,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 81 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:25,699 INFO L231 Difference]: Finished difference. Result has 55 places, 24 transitions, 56 flow [2022-12-13 09:19:25,701 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=55, PETRI_TRANSITIONS=24} [2022-12-13 09:19:25,706 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2022-12-13 09:19:25,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:25,707 INFO L89 Accepts]: Start accepts. Operand has 55 places, 24 transitions, 56 flow [2022-12-13 09:19:25,710 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:25,710 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:25,710 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 24 transitions, 56 flow [2022-12-13 09:19:25,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 56 flow [2022-12-13 09:19:25,722 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-13 09:19:25,722 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:25,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:19:25,725 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 56 flow [2022-12-13 09:19:25,725 INFO L226 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-13 09:19:25,846 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:25,847 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 09:19:25,848 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 56 flow [2022-12-13 09:19:25,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:25,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:25,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:25,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:19:25,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:19:25,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:25,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2001480668, now seen corresponding path program 1 times [2022-12-13 09:19:25,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:25,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113201963] [2022-12-13 09:19:25,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:25,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:26,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113201963] [2022-12-13 09:19:26,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113201963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:26,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:26,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:19:26,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958910743] [2022-12-13 09:19:26,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:26,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:19:26,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:26,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:19:26,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:19:26,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 09:19:26,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-13 09:19:26,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:26,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 09:19:26,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:26,097 INFO L130 PetriNetUnfolder]: 246/453 cut-off events. [2022-12-13 09:19:26,097 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 09:19:26,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 453 events. 246/453 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1908 event pairs, 71 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 916. Up to 321 conditions per place. [2022-12-13 09:19:26,100 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 21 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2022-12-13 09:19:26,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 122 flow [2022-12-13 09:19:26,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 09:19:26,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-13 09:19:26,101 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 56 flow. Second operand 3 states and 44 transitions. [2022-12-13 09:19:26,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 122 flow [2022-12-13 09:19:26,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:26,103 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 58 flow [2022-12-13 09:19:26,103 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, 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=58, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2022-12-13 09:19:26,104 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -25 predicate places. [2022-12-13 09:19:26,104 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:26,104 INFO L89 Accepts]: Start accepts. Operand has 32 places, 23 transitions, 58 flow [2022-12-13 09:19:26,104 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:26,104 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:26,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 58 flow [2022-12-13 09:19:26,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 23 transitions, 58 flow [2022-12-13 09:19:26,108 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-13 09:19:26,108 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:26,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:19:26,109 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 23 transitions, 58 flow [2022-12-13 09:19:26,109 INFO L226 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-13 09:19:26,202 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:19:26,203 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 09:19:26,203 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 56 flow [2022-12-13 09:19:26,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-13 09:19:26,203 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:26,203 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:26,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:19:26,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:19:26,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1916318160, now seen corresponding path program 1 times [2022-12-13 09:19:26,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:26,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965020534] [2022-12-13 09:19:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:26,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:26,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:26,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965020534] [2022-12-13 09:19:26,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965020534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:26,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:26,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:19:26,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695416641] [2022-12-13 09:19:26,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:26,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:26,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:26,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:26,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:26,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2022-12-13 09:19:26,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:26,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:26,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2022-12-13 09:19:26,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:26,535 INFO L130 PetriNetUnfolder]: 177/370 cut-off events. [2022-12-13 09:19:26,536 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 09:19:26,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 370 events. 177/370 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1709 event pairs, 37 based on Foata normal form. 42/319 useless extension candidates. Maximal degree in co-relation 802. Up to 250 conditions per place. [2022-12-13 09:19:26,537 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 24 selfloop transitions, 7 changer transitions 23/58 dead transitions. [2022-12-13 09:19:26,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 58 transitions, 247 flow [2022-12-13 09:19:26,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:19:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:19:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-13 09:19:26,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2022-12-13 09:19:26,539 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 56 flow. Second operand 5 states and 76 transitions. [2022-12-13 09:19:26,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 58 transitions, 247 flow [2022-12-13 09:19:26,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 58 transitions, 237 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:26,541 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 115 flow [2022-12-13 09:19:26,541 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-13 09:19:26,542 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -22 predicate places. [2022-12-13 09:19:26,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:26,542 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 115 flow [2022-12-13 09:19:26,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:26,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:26,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 115 flow [2022-12-13 09:19:26,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 28 transitions, 115 flow [2022-12-13 09:19:26,554 INFO L130 PetriNetUnfolder]: 45/118 cut-off events. [2022-12-13 09:19:26,554 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 09:19:26,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 118 events. 45/118 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 540 event pairs, 18 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 299. Up to 76 conditions per place. [2022-12-13 09:19:26,555 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 28 transitions, 115 flow [2022-12-13 09:19:26,555 INFO L226 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-13 09:19:26,574 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:26,575 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 09:19:26,575 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 115 flow [2022-12-13 09:19:26,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:26,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:26,576 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:26,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:19:26,576 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:19:26,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:26,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1621756767, now seen corresponding path program 1 times [2022-12-13 09:19:26,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:26,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442120364] [2022-12-13 09:19:26,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:26,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:26,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:26,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442120364] [2022-12-13 09:19:26,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442120364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:26,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:26,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:19:26,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665899034] [2022-12-13 09:19:26,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:26,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:19:26,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:26,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:19:26,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:19:26,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2022-12-13 09:19:26,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:26,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:26,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2022-12-13 09:19:26,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:26,909 INFO L130 PetriNetUnfolder]: 64/185 cut-off events. [2022-12-13 09:19:26,909 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-12-13 09:19:26,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 185 events. 64/185 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 801 event pairs, 10 based on Foata normal form. 30/172 useless extension candidates. Maximal degree in co-relation 561. Up to 94 conditions per place. [2022-12-13 09:19:26,910 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 18 selfloop transitions, 13 changer transitions 13/47 dead transitions. [2022-12-13 09:19:26,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 269 flow [2022-12-13 09:19:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:19:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:19:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-13 09:19:26,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-12-13 09:19:26,912 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 115 flow. Second operand 6 states and 69 transitions. [2022-12-13 09:19:26,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 269 flow [2022-12-13 09:19:26,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 230 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-13 09:19:26,915 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 132 flow [2022-12-13 09:19:26,915 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-13 09:19:26,916 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -19 predicate places. [2022-12-13 09:19:26,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:26,916 INFO L89 Accepts]: Start accepts. Operand has 38 places, 27 transitions, 132 flow [2022-12-13 09:19:26,917 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:26,917 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:26,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 132 flow [2022-12-13 09:19:26,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 132 flow [2022-12-13 09:19:26,924 INFO L130 PetriNetUnfolder]: 9/63 cut-off events. [2022-12-13 09:19:26,924 INFO L131 PetriNetUnfolder]: For 36/42 co-relation queries the response was YES. [2022-12-13 09:19:26,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 63 events. 9/63 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 226 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 174. Up to 34 conditions per place. [2022-12-13 09:19:26,925 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 132 flow [2022-12-13 09:19:26,925 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 09:19:27,364 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:19:27,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 449 [2022-12-13 09:19:27,365 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 128 flow [2022-12-13 09:19:27,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:27,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:27,366 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:27,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:19:27,366 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:19:27,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:27,366 INFO L85 PathProgramCache]: Analyzing trace with hash 938099410, now seen corresponding path program 1 times [2022-12-13 09:19:27,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:27,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296024324] [2022-12-13 09:19:27,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:27,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:27,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:27,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296024324] [2022-12-13 09:19:27,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296024324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:27,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:27,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:19:27,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880017413] [2022-12-13 09:19:27,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:27,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:19:27,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:27,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:19:27,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:19:27,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2022-12-13 09:19:27,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:27,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:27,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2022-12-13 09:19:27,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:28,031 INFO L130 PetriNetUnfolder]: 75/195 cut-off events. [2022-12-13 09:19:28,031 INFO L131 PetriNetUnfolder]: For 358/365 co-relation queries the response was YES. [2022-12-13 09:19:28,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 195 events. 75/195 cut-off events. For 358/365 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 873 event pairs, 11 based on Foata normal form. 16/175 useless extension candidates. Maximal degree in co-relation 715. Up to 122 conditions per place. [2022-12-13 09:19:28,033 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 35 selfloop transitions, 9 changer transitions 14/63 dead transitions. [2022-12-13 09:19:28,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 63 transitions, 424 flow [2022-12-13 09:19:28,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:19:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 09:19:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-12-13 09:19:28,034 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2022-12-13 09:19:28,034 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 128 flow. Second operand 8 states and 78 transitions. [2022-12-13 09:19:28,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 63 transitions, 424 flow [2022-12-13 09:19:28,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 63 transitions, 352 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-13 09:19:28,038 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 160 flow [2022-12-13 09:19:28,038 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=160, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2022-12-13 09:19:28,039 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -17 predicate places. [2022-12-13 09:19:28,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:28,039 INFO L89 Accepts]: Start accepts. Operand has 40 places, 32 transitions, 160 flow [2022-12-13 09:19:28,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:28,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:28,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 160 flow [2022-12-13 09:19:28,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 160 flow [2022-12-13 09:19:28,069 INFO L130 PetriNetUnfolder]: 29/94 cut-off events. [2022-12-13 09:19:28,070 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-12-13 09:19:28,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 94 events. 29/94 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 419 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 261. Up to 55 conditions per place. [2022-12-13 09:19:28,071 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 32 transitions, 160 flow [2022-12-13 09:19:28,071 INFO L226 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-13 09:19:28,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] $Ultimate##0-->L749: Formula: (and (= v_~y$r_buff0_thd2~0_71 v_~y$r_buff1_thd2~0_74) (= |v_P0Thread1of1ForFork0_~arg#1.offset_7| |v_P0Thread1of1ForFork0_#in~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_132 256) 0)) (not (= (mod v_~y$w_buff0_used~0_161 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~y$w_buff0_used~0_162 v_~y$w_buff1_used~0_132) (= v_~y$r_buff0_thd0~0_37 v_~y$r_buff1_thd0~0_35) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~y$w_buff0~0_86 1) (= v_~y$w_buff0~0_87 v_~y$w_buff1~0_67) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= |v_P0Thread1of1ForFork0_~arg#1.base_7| |v_P0Thread1of1ForFork0_#in~arg#1.base_7|) (= v_~y$r_buff0_thd1~0_48 1) (= v_~y$w_buff0_used~0_161 1) (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff1_thd1~0_35)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_37, ~y$w_buff0~0=v_~y$w_buff0~0_87, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_71, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_7|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_74, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_35, ~y$w_buff1~0=v_~y$w_buff1~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_37, ~y$w_buff0~0=v_~y$w_buff0~0_86, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_48, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_71, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_132} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [414] $Ultimate##0-->L772: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_13| v_P1Thread1of1ForFork1_~arg.offset_13) (= v_P1Thread1of1ForFork1_~arg.base_13 |v_P1Thread1of1ForFork1_#in~arg.base_13|) (= v_~x~0_57 1) (= v_~x~0_57 v_~__unbuffered_p1_EAX~0_93)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_13|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_13|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_13, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_13|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_13|, ~x~0=v_~x~0_57} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~x~0] [2022-12-13 09:19:28,485 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] $Ultimate##0-->L772: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_13| v_P1Thread1of1ForFork1_~arg.offset_13) (= v_P1Thread1of1ForFork1_~arg.base_13 |v_P1Thread1of1ForFork1_#in~arg.base_13|) (= v_~x~0_57 1) (= v_~x~0_57 v_~__unbuffered_p1_EAX~0_93)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_13|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_13|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_13, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_13|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_13|, ~x~0=v_~x~0_57} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~x~0] and [333] $Ultimate##0-->L749: Formula: (and (= v_~y$r_buff0_thd2~0_71 v_~y$r_buff1_thd2~0_74) (= |v_P0Thread1of1ForFork0_~arg#1.offset_7| |v_P0Thread1of1ForFork0_#in~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_132 256) 0)) (not (= (mod v_~y$w_buff0_used~0_161 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~y$w_buff0_used~0_162 v_~y$w_buff1_used~0_132) (= v_~y$r_buff0_thd0~0_37 v_~y$r_buff1_thd0~0_35) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~y$w_buff0~0_86 1) (= v_~y$w_buff0~0_87 v_~y$w_buff1~0_67) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= |v_P0Thread1of1ForFork0_~arg#1.base_7| |v_P0Thread1of1ForFork0_#in~arg#1.base_7|) (= v_~y$r_buff0_thd1~0_48 1) (= v_~y$w_buff0_used~0_161 1) (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff1_thd1~0_35)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_37, ~y$w_buff0~0=v_~y$w_buff0~0_87, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_71, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_7|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_74, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_35, ~y$w_buff1~0=v_~y$w_buff1~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_37, ~y$w_buff0~0=v_~y$w_buff0~0_86, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_48, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_71, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_132} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 09:19:28,807 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [418] $Ultimate##0-->L772: Formula: (and (= v_~x~0_71 1) (= |v_P0Thread1of1ForFork0_~arg#1.base_48| |v_P0Thread1of1ForFork0_#in~arg#1.base_48|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_19| v_P1Thread1of1ForFork1_~arg.offset_19) (= v_P1Thread1of1ForFork1_~arg.base_19 |v_P1Thread1of1ForFork1_#in~arg.base_19|) (= v_~y$r_buff0_thd0~0_129 v_~y$r_buff1_thd0~0_129) (= v_~y$w_buff0~0_236 1) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_54| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_54|) (= v_~y$r_buff0_thd1~0_157 v_~y$r_buff1_thd1~0_112) (= v_~y$w_buff0_used~0_374 v_~y$w_buff1_used~0_320) (= v_~y$r_buff0_thd1~0_156 1) (= v_~y$w_buff1~0_184 v_~y$w_buff0~0_237) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_48| |v_P0Thread1of1ForFork0_~arg#1.offset_48|) (= v_~y$r_buff0_thd2~0_183 v_~y$r_buff1_thd2~0_189) (= v_~y$w_buff0_used~0_373 1) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_320 256) 0)) (not (= (mod v_~y$w_buff0_used~0_373 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_54|) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_54| 0)) (= v_~x~0_71 v_~__unbuffered_p1_EAX~0_107)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_48|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_374, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_237, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_157, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_183, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_48|} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_48|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_373, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_19, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_48|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_48|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_48|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_189, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_112, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_107, ~y$w_buff1~0=v_~y$w_buff1~0_184, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_236, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_54|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_156, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_183, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~x~0=v_~x~0_71, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_54|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_320} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [282] L749-->L752: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-13 09:19:29,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] $Ultimate##0-->L752: Formula: (and (= v_~y$w_buff0_used~0_397 1) (= v_~x~0_77 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_25| v_P1Thread1of1ForFork1_~arg.offset_25) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_56| |v_P0Thread1of1ForFork0_~arg#1.offset_56|) (= v_~y$w_buff0_used~0_398 v_~y$w_buff1_used~0_338) (= v_~y$w_buff0~0_256 1) (= v_~y$w_buff1~0_198 v_~y$w_buff0~0_257) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_338 256) 0)) (not (= (mod v_~y$w_buff0_used~0_397 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_62|) (= v_~x~0_77 v_~__unbuffered_p0_EAX~0_109) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_62| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_62|) (= |v_P0Thread1of1ForFork0_~arg#1.base_56| |v_P0Thread1of1ForFork0_#in~arg#1.base_56|) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_62| 0)) (= v_~y$r_buff0_thd0~0_137 v_~y$r_buff1_thd0~0_137) (= v_~x~0_77 v_~__unbuffered_p1_EAX~0_113) (= v_~y$r_buff0_thd1~0_173 v_~y$r_buff1_thd1~0_120) (= v_P1Thread1of1ForFork1_~arg.base_25 |v_P1Thread1of1ForFork1_#in~arg.base_25|) (= v_~y$r_buff0_thd2~0_199 v_~y$r_buff1_thd2~0_207) (= v_~y$r_buff0_thd1~0_172 1)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_56|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_398, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_257, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_25|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_173, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_199, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_56|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_25|} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_56|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_397, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_25, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_56|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_56|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_56|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_207, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_120, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_109, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_198, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_256, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_25|, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_62|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_172, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_199, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_25|, ~x~0=v_~x~0_77, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_62|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_137, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_338} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [290] L772-->L788: Formula: (let ((.cse1 (= (mod v_~y$r_buff1_thd2~0_48 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd2~0_52 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and (= (mod v_~y$w_buff1_used~0_91 256) 0) .cse9)) (.cse8 (and .cse1 .cse9)) (.cse11 (= (mod v_~y$w_buff0_used~0_104 256) 0))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_90 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_103 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (or .cse7 .cse8 .cse11)) (.cse6 (and (not .cse11) .cse10))) (and (= v_~y$w_buff0~0_39 v_~y$w_buff0~0_38) (= (ite .cse0 v_~y$r_buff1_thd2~0_48 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_51 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~y$r_buff1_thd2~0_48 0)) v_~y$r_buff1_thd2~0_47) (= (ite .cse5 v_~y~0_58 (ite .cse6 v_~y$w_buff0~0_39 v_~y$w_buff1~0_34)) v_~__unbuffered_p1_EBX~0_8) (= v_~y$w_buff1~0_34 v_~y$w_buff1~0_33) (= v_~y$w_buff1_used~0_90 (ite .cse0 v_~y$w_buff1_used~0_91 (ite (or .cse7 .cse8 .cse3) v_~y$w_buff1_used~0_91 0))) (= v_~y$r_buff0_thd2~0_51 (ite .cse0 v_~y$r_buff0_thd2~0_52 (ite (or .cse8 (and .cse4 .cse9) .cse3) v_~y$r_buff0_thd2~0_52 (ite (and (not .cse3) .cse10) 0 v_~y$r_buff0_thd2~0_52)))) (= 0 v_~y$flush_delayed~0_21) (= v_~weak$$choice2~0_32 |v_P1Thread1of1ForFork1_#t~nondet4_1|) (= v_~y~0_56 (ite .cse0 v_~y$mem_tmp~0_14 v_~__unbuffered_p1_EBX~0_8)) (= |v_P1Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~y~0_58 v_~y$mem_tmp~0_14) (= (ite .cse0 v_~y$w_buff0_used~0_104 (ite .cse5 v_~y$w_buff0_used~0_104 (ite .cse6 0 v_~y$w_buff0_used~0_104))) v_~y$w_buff0_used~0_103))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_48, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_1|, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_47, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_14, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$w_buff0~0=v_~y$w_buff0~0_38, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$flush_delayed~0=v_~y$flush_delayed~0_21, ~y~0=v_~y~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet4, P1Thread1of1ForFork1_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 09:19:29,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [422] $Ultimate##0-->L752: Formula: (and (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_58| |v_P0Thread1of1ForFork0_~arg#1.offset_58|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_27| v_P1Thread1of1ForFork1_~arg.offset_27) (= v_~y$w_buff0~0_260 1) (= v_~x~0_79 v_~__unbuffered_p0_EAX~0_111) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_64| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_64|) (= v_~y$w_buff0_used~0_401 1) (= |v_P0Thread1of1ForFork0_~arg#1.base_58| |v_P0Thread1of1ForFork0_#in~arg#1.base_58|) (= v_~y$w_buff0_used~0_402 v_~y$w_buff1_used~0_340) (= v_~y$r_buff0_thd1~0_177 v_~y$r_buff1_thd1~0_122) (= v_~y$w_buff1~0_200 v_~y$w_buff0~0_261) (= v_~x~0_79 1) (= v_P1Thread1of1ForFork1_~arg.base_27 |v_P1Thread1of1ForFork1_#in~arg.base_27|) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_64| 0)) (= v_~y$r_buff0_thd1~0_176 1) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_64| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_340 256) 0)) (not (= (mod v_~y$w_buff0_used~0_401 256) 0)))) 1 0)) (= v_~x~0_79 v_~__unbuffered_p1_EAX~0_115) (= v_~y$r_buff0_thd0~0_139 v_~y$r_buff1_thd0~0_139) (= v_~y$r_buff0_thd2~0_201 v_~y$r_buff1_thd2~0_209)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_58|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_402, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_139, ~y$w_buff0~0=v_~y$w_buff0~0_261, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_201, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_27|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_58|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_27|} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_58|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_401, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_27, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_58|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_58|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_58|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_209, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_122, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_27, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_115, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_139, ~y$w_buff0~0=v_~y$w_buff0~0_260, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_64|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_176, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_201, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_27|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_27|, ~x~0=v_~x~0_79, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_64|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_139, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_340} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [290] L772-->L788: Formula: (let ((.cse1 (= (mod v_~y$r_buff1_thd2~0_48 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd2~0_52 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and (= (mod v_~y$w_buff1_used~0_91 256) 0) .cse9)) (.cse8 (and .cse1 .cse9)) (.cse11 (= (mod v_~y$w_buff0_used~0_104 256) 0))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_90 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_103 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (or .cse7 .cse8 .cse11)) (.cse6 (and (not .cse11) .cse10))) (and (= v_~y$w_buff0~0_39 v_~y$w_buff0~0_38) (= (ite .cse0 v_~y$r_buff1_thd2~0_48 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_51 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~y$r_buff1_thd2~0_48 0)) v_~y$r_buff1_thd2~0_47) (= (ite .cse5 v_~y~0_58 (ite .cse6 v_~y$w_buff0~0_39 v_~y$w_buff1~0_34)) v_~__unbuffered_p1_EBX~0_8) (= v_~y$w_buff1~0_34 v_~y$w_buff1~0_33) (= v_~y$w_buff1_used~0_90 (ite .cse0 v_~y$w_buff1_used~0_91 (ite (or .cse7 .cse8 .cse3) v_~y$w_buff1_used~0_91 0))) (= v_~y$r_buff0_thd2~0_51 (ite .cse0 v_~y$r_buff0_thd2~0_52 (ite (or .cse8 (and .cse4 .cse9) .cse3) v_~y$r_buff0_thd2~0_52 (ite (and (not .cse3) .cse10) 0 v_~y$r_buff0_thd2~0_52)))) (= 0 v_~y$flush_delayed~0_21) (= v_~weak$$choice2~0_32 |v_P1Thread1of1ForFork1_#t~nondet4_1|) (= v_~y~0_56 (ite .cse0 v_~y$mem_tmp~0_14 v_~__unbuffered_p1_EBX~0_8)) (= |v_P1Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~y~0_58 v_~y$mem_tmp~0_14) (= (ite .cse0 v_~y$w_buff0_used~0_104 (ite .cse5 v_~y$w_buff0_used~0_104 (ite .cse6 0 v_~y$w_buff0_used~0_104))) v_~y$w_buff0_used~0_103))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_48, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_1|, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_47, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_14, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$w_buff0~0=v_~y$w_buff0~0_38, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$flush_delayed~0=v_~y$flush_delayed~0_21, ~y~0=v_~y~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet4, P1Thread1of1ForFork1_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 09:19:30,100 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 09:19:30,101 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2062 [2022-12-13 09:19:30,102 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 162 flow [2022-12-13 09:19:30,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:30,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:30,102 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:30,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:19:30,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:19:30,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:30,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2130798203, now seen corresponding path program 1 times [2022-12-13 09:19:30,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:30,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356643530] [2022-12-13 09:19:30,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:30,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:30,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:30,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356643530] [2022-12-13 09:19:30,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356643530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:30,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:30,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:19:30,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327761949] [2022-12-13 09:19:30,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:30,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:30,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:30,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:30,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:30,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2022-12-13 09:19:30,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 162 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-13 09:19:30,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:30,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2022-12-13 09:19:30,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:30,354 INFO L130 PetriNetUnfolder]: 54/159 cut-off events. [2022-12-13 09:19:30,355 INFO L131 PetriNetUnfolder]: For 230/235 co-relation queries the response was YES. [2022-12-13 09:19:30,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 159 events. 54/159 cut-off events. For 230/235 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 766 event pairs, 10 based on Foata normal form. 22/146 useless extension candidates. Maximal degree in co-relation 534. Up to 64 conditions per place. [2022-12-13 09:19:30,356 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 16 selfloop transitions, 3 changer transitions 18/42 dead transitions. [2022-12-13 09:19:30,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 298 flow [2022-12-13 09:19:30,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:19:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:19:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 09:19:30,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-13 09:19:30,358 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 162 flow. Second operand 5 states and 44 transitions. [2022-12-13 09:19:30,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 298 flow [2022-12-13 09:19:30,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 272 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 09:19:30,362 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 110 flow [2022-12-13 09:19:30,362 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2022-12-13 09:19:30,364 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -21 predicate places. [2022-12-13 09:19:30,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:30,364 INFO L89 Accepts]: Start accepts. Operand has 36 places, 22 transitions, 110 flow [2022-12-13 09:19:30,365 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:30,365 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:30,365 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 22 transitions, 110 flow [2022-12-13 09:19:30,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 22 transitions, 110 flow [2022-12-13 09:19:30,373 INFO L130 PetriNetUnfolder]: 9/46 cut-off events. [2022-12-13 09:19:30,373 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-13 09:19:30,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 46 events. 9/46 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 136 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 126. Up to 28 conditions per place. [2022-12-13 09:19:30,374 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 22 transitions, 110 flow [2022-12-13 09:19:30,374 INFO L226 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-13 09:19:33,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:19:33,018 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: failed to undo transition, perhaps due to illegal composition at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.undoTransition(SequenceRule.java:886) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.adaptRun(SequenceRule.java:839) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:161) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:82) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:290) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:237) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:119) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetNot1SafeException: Petri net not 1-safe The following places may contain more than one token.[195#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 0) (= ~y$r_buff0_thd1~0 1) (not (= ~y~0 ~y$w_buff0~0)) (= ~y$w_buff0_used~0 1))] at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.undoTransition(SequenceRule.java:887) ... 29 more [2022-12-13 09:19:33,020 INFO L158 Benchmark]: Toolchain (without parser) took 13904.83ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 147.9MB in the beginning and 241.6MB in the end (delta: -93.7MB). Peak memory consumption was 178.8MB. Max. memory is 8.0GB. [2022-12-13 09:19:33,021 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:19:33,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.82ms. Allocated memory is still 174.1MB. Free memory was 147.5MB in the beginning and 122.7MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 09:19:33,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.48ms. Allocated memory is still 174.1MB. Free memory was 122.7MB in the beginning and 120.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:19:33,022 INFO L158 Benchmark]: Boogie Preprocessor took 38.39ms. Allocated memory is still 174.1MB. Free memory was 120.2MB in the beginning and 118.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:19:33,022 INFO L158 Benchmark]: RCFGBuilder took 656.75ms. Allocated memory is still 174.1MB. Free memory was 118.5MB in the beginning and 128.4MB in the end (delta: -9.9MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-12-13 09:19:33,022 INFO L158 Benchmark]: TraceAbstraction took 12575.52ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 127.4MB in the beginning and 241.6MB in the end (delta: -114.2MB). Peak memory consumption was 157.4MB. Max. memory is 8.0GB. [2022-12-13 09:19:33,024 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.15ms. Allocated memory is still 127.9MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 560.82ms. Allocated memory is still 174.1MB. Free memory was 147.5MB in the beginning and 122.7MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.48ms. Allocated memory is still 174.1MB. Free memory was 122.7MB in the beginning and 120.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.39ms. Allocated memory is still 174.1MB. Free memory was 120.2MB in the beginning and 118.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 656.75ms. Allocated memory is still 174.1MB. Free memory was 118.5MB in the beginning and 128.4MB in the end (delta: -9.9MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * TraceAbstraction took 12575.52ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 127.4MB in the beginning and 241.6MB in the end (delta: -114.2MB). Peak memory consumption was 157.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 93 PlacesBefore, 57 PlacesAfterwards, 88 TransitionsBefore, 51 TransitionsAfterwards, 1104 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 32 ConcurrentYvCompositions, 3 ChoiceCompositions, 72 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1967, independent: 1863, independent conditional: 1863, independent unconditional: 0, dependent: 104, dependent conditional: 104, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1186, independent: 1146, independent conditional: 0, independent unconditional: 1146, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1186, independent: 1146, independent conditional: 0, independent unconditional: 1146, 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: 1186, independent: 1126, independent conditional: 0, independent unconditional: 1126, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 190, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1967, independent: 717, independent conditional: 717, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 1186, unknown conditional: 1186, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1191, Positive cache size: 1151, Positive conditional cache size: 1151, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 127, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 91, independent conditional: 9, independent unconditional: 82, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, independent: 91, independent conditional: 9, independent unconditional: 82, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 115, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 94, dependent conditional: 19, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 127, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 110, unknown conditional: 110, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 91, Positive conditional cache size: 91, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 30 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 240, independent: 195, independent conditional: 195, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 53, independent conditional: 10, independent unconditional: 43, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 63, independent: 53, independent conditional: 10, independent unconditional: 43, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 63, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 240, independent: 142, independent conditional: 142, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 63, unknown conditional: 63, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 144, Positive conditional cache size: 144, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 76, independent conditional: 76, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 156, Positive conditional cache size: 156, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 35 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 178, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 10, independent unconditional: 1, 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: 178, independent: 127, independent conditional: 127, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 167, Positive conditional cache size: 167, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 38 PlacesBefore, 34 PlacesAfterwards, 32 TransitionsBefore, 28 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 133, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 19, independent conditional: 16, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 19, independent conditional: 16, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 133, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 186, Positive conditional cache size: 186, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: AssertionError: failed to undo transition, perhaps due to illegal composition de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: failed to undo transition, perhaps due to illegal composition: de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.undoTransition(SequenceRule.java:886) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-13 09:19:33,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...