/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:19:38,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:19:38,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:19:38,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:19:38,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:19:38,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:19:38,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:19:38,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:19:38,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:19:38,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:19:38,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:19:38,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:19:38,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:19:38,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:19:38,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:19:38,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:19:38,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:19:38,345 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:19:38,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:19:38,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:19:38,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:19:38,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:19:38,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:19:38,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:19:38,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:19:38,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:19:38,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:19:38,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:19:38,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:19:38,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:19:38,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:19:38,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:19:38,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:19:38,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:19:38,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:19:38,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:19:38,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:19:38,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:19:38,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:19:38,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:19:38,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:19:38,377 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-RepeatedSemanticLbe.epf [2022-12-05 23:19:38,417 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:19:38,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:19:38,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:19:38,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:19:38,420 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:19:38,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:19:38,420 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:19:38,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:19:38,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:19:38,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:19:38,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:19:38,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:19:38,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:19:38,422 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:19:38,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:19:38,422 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:19:38,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:19:38,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:19:38,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:19:38,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:19:38,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:19:38,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:19:38,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:19:38,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:19:38,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:19:38,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:19:38,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:19:38,424 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:19:38,424 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-05 23:19:38,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:19:38,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:19:38,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:19:38,754 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:19:38,754 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:19:38,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:19:39,800 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:19:40,074 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:19:40,075 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:19:40,091 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9802d29a/df9961006899486fae6008d511c3e90f/FLAG34e42a3d1 [2022-12-05 23:19:40,104 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9802d29a/df9961006899486fae6008d511c3e90f [2022-12-05 23:19:40,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:19:40,107 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:19:40,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:19:40,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:19:40,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:19:40,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:19:40" (1/1) ... [2022-12-05 23:19:40,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528b9f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:40, skipping insertion in model container [2022-12-05 23:19:40,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:19:40" (1/1) ... [2022-12-05 23:19:40,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:19:40,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:19:40,341 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/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-05 23:19:40,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:19:40,580 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:19:40,591 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/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-05 23:19:40,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:40,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:40,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:19:40,694 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:19:40,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:40 WrapperNode [2022-12-05 23:19:40,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:19:40,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:19:40,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:19:40,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:19:40,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:40" (1/1) ... [2022-12-05 23:19:40,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:40" (1/1) ... [2022-12-05 23:19:40,762 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2022-12-05 23:19:40,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:19:40,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:19:40,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:19:40,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:19:40,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:40" (1/1) ... [2022-12-05 23:19:40,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:40" (1/1) ... [2022-12-05 23:19:40,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:40" (1/1) ... [2022-12-05 23:19:40,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:40" (1/1) ... [2022-12-05 23:19:40,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:40" (1/1) ... [2022-12-05 23:19:40,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:40" (1/1) ... [2022-12-05 23:19:40,800 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:40" (1/1) ... [2022-12-05 23:19:40,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:40" (1/1) ... [2022-12-05 23:19:40,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:19:40,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:19:40,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:19:40,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:19:40,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:40" (1/1) ... [2022-12-05 23:19:40,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:19:40,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:19:40,850 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-05 23:19:40,855 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-05 23:19:40,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:19:40,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:19:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:19:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:19:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:19:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:19:40,891 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:19:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:19:40,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:19:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:19:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:19:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:19:40,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:19:40,894 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:19:40,999 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:19:41,001 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:19:41,282 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:19:41,382 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:19:41,382 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:19:41,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:19:41 BoogieIcfgContainer [2022-12-05 23:19:41,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:19:41,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:19:41,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:19:41,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:19:41,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:19:40" (1/3) ... [2022-12-05 23:19:41,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a399f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:19:41, skipping insertion in model container [2022-12-05 23:19:41,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:40" (2/3) ... [2022-12-05 23:19:41,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a399f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:19:41, skipping insertion in model container [2022-12-05 23:19:41,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:19:41" (3/3) ... [2022-12-05 23:19:41,391 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:19:41,407 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:19:41,407 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:19:41,407 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:19:41,447 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:19:41,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2022-12-05 23:19:41,509 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-05 23:19:41,509 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:41,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 23:19:41,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2022-12-05 23:19:41,519 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2022-12-05 23:19:41,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:41,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-05 23:19:41,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 174 flow [2022-12-05 23:19:41,567 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-05 23:19:41,568 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:41,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 23:19:41,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-05 23:19:41,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 1034 [2022-12-05 23:19:45,951 INFO L203 LiptonReduction]: Total number of compositions: 67 [2022-12-05 23:19:45,964 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:19:45,970 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;@3d71f2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:19:45,970 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:19:45,972 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 23:19:45,972 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:45,972 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:45,973 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:19:45,973 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-05 23:19:45,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:45,977 INFO L85 PathProgramCache]: Analyzing trace with hash 396561, now seen corresponding path program 1 times [2022-12-05 23:19:45,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:45,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318142284] [2022-12-05 23:19:45,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:45,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:46,311 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-05 23:19:46,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:46,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318142284] [2022-12-05 23:19:46,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318142284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:46,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:46,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:19:46,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656990474] [2022-12-05 23:19:46,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:46,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:19:46,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:46,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:19:46,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:19:46,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:19:46,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-05 23:19:46,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:46,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:19:46,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:46,509 INFO L130 PetriNetUnfolder]: 138/275 cut-off events. [2022-12-05 23:19:46,509 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:19:46,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 275 events. 138/275 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1214 event pairs, 15 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 526. Up to 205 conditions per place. [2022-12-05 23:19:46,514 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 19 selfloop transitions, 2 changer transitions 6/29 dead transitions. [2022-12-05 23:19:46,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 121 flow [2022-12-05 23:19:46,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:19:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:19:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 23:19:46,531 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2022-12-05 23:19:46,533 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 38 transitions. [2022-12-05 23:19:46,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 121 flow [2022-12-05 23:19:46,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:19:46,537 INFO L231 Difference]: Finished difference. Result has 25 places, 15 transitions, 38 flow [2022-12-05 23:19:46,539 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=25, PETRI_TRANSITIONS=15} [2022-12-05 23:19:46,543 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-05 23:19:46,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:46,543 INFO L89 Accepts]: Start accepts. Operand has 25 places, 15 transitions, 38 flow [2022-12-05 23:19:46,546 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:46,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:46,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 15 transitions, 38 flow [2022-12-05 23:19:46,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 15 transitions, 38 flow [2022-12-05 23:19:46,554 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-05 23:19:46,554 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:46,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:19:46,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 15 transitions, 38 flow [2022-12-05 23:19:46,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 23:19:46,599 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:46,602 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-05 23:19:46,602 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 38 flow [2022-12-05 23:19:46,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-05 23:19:46,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:46,603 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:46,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:19:46,606 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-05 23:19:46,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:46,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1212493294, now seen corresponding path program 1 times [2022-12-05 23:19:46,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:46,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178354851] [2022-12-05 23:19:46,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:46,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:46,856 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-05 23:19:46,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:46,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178354851] [2022-12-05 23:19:46,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178354851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:46,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:46,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:19:46,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138988154] [2022-12-05 23:19:46,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:46,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:19:46,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:46,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:19:46,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:19:46,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 23:19:46,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:46,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:46,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 23:19:46,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:46,929 INFO L130 PetriNetUnfolder]: 109/213 cut-off events. [2022-12-05 23:19:46,929 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 23:19:46,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 213 events. 109/213 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 748 event pairs, 43 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 434. Up to 184 conditions per place. [2022-12-05 23:19:46,931 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 18 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2022-12-05 23:19:46,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 98 flow [2022-12-05 23:19:46,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:19:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:19:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-05 23:19:46,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 23:19:46,933 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 38 flow. Second operand 3 states and 25 transitions. [2022-12-05 23:19:46,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 98 flow [2022-12-05 23:19:46,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:19:46,934 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2022-12-05 23:19:46,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2022-12-05 23:19:46,935 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -4 predicate places. [2022-12-05 23:19:46,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:46,935 INFO L89 Accepts]: Start accepts. Operand has 23 places, 17 transitions, 53 flow [2022-12-05 23:19:46,935 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:46,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:46,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 17 transitions, 53 flow [2022-12-05 23:19:46,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 17 transitions, 53 flow [2022-12-05 23:19:46,940 INFO L130 PetriNetUnfolder]: 3/27 cut-off events. [2022-12-05 23:19:46,941 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:46,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 27 events. 3/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 38. Up to 10 conditions per place. [2022-12-05 23:19:46,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 17 transitions, 53 flow [2022-12-05 23:19:46,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-05 23:19:46,962 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:46,964 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-05 23:19:46,964 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2022-12-05 23:19:46,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:46,964 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:46,964 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:46,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:19:46,964 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-05 23:19:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:46,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1067414174, now seen corresponding path program 1 times [2022-12-05 23:19:46,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:46,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572907801] [2022-12-05 23:19:46,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:46,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:47,497 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-05 23:19:47,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:47,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572907801] [2022-12-05 23:19:47,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572907801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:47,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:47,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:19:47,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105195310] [2022-12-05 23:19:47,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:47,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:19:47,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:47,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:19:47,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:19:47,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 23:19:47,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-05 23:19:47,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:47,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 23:19:47,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:47,577 INFO L130 PetriNetUnfolder]: 125/233 cut-off events. [2022-12-05 23:19:47,577 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-05 23:19:47,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 233 events. 125/233 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 783 event pairs, 53 based on Foata normal form. 1/234 useless extension candidates. Maximal degree in co-relation 521. Up to 211 conditions per place. [2022-12-05 23:19:47,581 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 19 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2022-12-05 23:19:47,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 116 flow [2022-12-05 23:19:47,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:19:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:19:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-05 23:19:47,583 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 23:19:47,583 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 3 states and 25 transitions. [2022-12-05 23:19:47,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 116 flow [2022-12-05 23:19:47,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 112 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:19:47,584 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 69 flow [2022-12-05 23:19:47,584 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2022-12-05 23:19:47,585 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-05 23:19:47,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:47,590 INFO L89 Accepts]: Start accepts. Operand has 25 places, 19 transitions, 69 flow [2022-12-05 23:19:47,590 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:47,591 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:47,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 19 transitions, 69 flow [2022-12-05 23:19:47,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 19 transitions, 69 flow [2022-12-05 23:19:47,598 INFO L130 PetriNetUnfolder]: 7/38 cut-off events. [2022-12-05 23:19:47,598 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-12-05 23:19:47,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 38 events. 7/38 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 106 event pairs, 3 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 66. Up to 15 conditions per place. [2022-12-05 23:19:47,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 19 transitions, 69 flow [2022-12-05 23:19:47,599 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-05 23:19:47,669 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:47,671 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-05 23:19:47,671 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 69 flow [2022-12-05 23:19:47,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-05 23:19:47,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:47,671 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:47,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:19:47,672 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-05 23:19:47,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:47,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1269881052, now seen corresponding path program 1 times [2022-12-05 23:19:47,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:47,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65267026] [2022-12-05 23:19:47,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:47,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:48,205 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-05 23:19:48,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:48,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65267026] [2022-12-05 23:19:48,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65267026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:48,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:48,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:19:48,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108933374] [2022-12-05 23:19:48,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:48,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:19:48,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:48,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:19:48,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:19:48,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 23:19:48,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 69 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-05 23:19:48,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:48,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 23:19:48,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:48,299 INFO L130 PetriNetUnfolder]: 159/284 cut-off events. [2022-12-05 23:19:48,299 INFO L131 PetriNetUnfolder]: For 91/91 co-relation queries the response was YES. [2022-12-05 23:19:48,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 284 events. 159/284 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 994 event pairs, 58 based on Foata normal form. 5/289 useless extension candidates. Maximal degree in co-relation 712. Up to 244 conditions per place. [2022-12-05 23:19:48,302 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 21 selfloop transitions, 9 changer transitions 0/30 dead transitions. [2022-12-05 23:19:48,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 30 transitions, 162 flow [2022-12-05 23:19:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:19:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:19:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-05 23:19:48,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2022-12-05 23:19:48,304 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 69 flow. Second operand 3 states and 26 transitions. [2022-12-05 23:19:48,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 30 transitions, 162 flow [2022-12-05 23:19:48,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:19:48,306 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 125 flow [2022-12-05 23:19:48,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-05 23:19:48,307 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2022-12-05 23:19:48,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:48,308 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 125 flow [2022-12-05 23:19:48,309 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:48,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:48,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 125 flow [2022-12-05 23:19:48,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 125 flow [2022-12-05 23:19:48,326 INFO L130 PetriNetUnfolder]: 46/111 cut-off events. [2022-12-05 23:19:48,326 INFO L131 PetriNetUnfolder]: For 54/58 co-relation queries the response was YES. [2022-12-05 23:19:48,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 111 events. 46/111 cut-off events. For 54/58 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 412 event pairs, 15 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 278. Up to 76 conditions per place. [2022-12-05 23:19:48,328 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 125 flow [2022-12-05 23:19:48,328 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-05 23:19:48,332 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:48,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-05 23:19:48,336 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 125 flow [2022-12-05 23:19:48,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-05 23:19:48,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:48,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:48,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:19:48,337 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-05 23:19:48,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1258967844, now seen corresponding path program 2 times [2022-12-05 23:19:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:48,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247797720] [2022-12-05 23:19:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:48,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:48,483 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-05 23:19:48,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:48,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247797720] [2022-12-05 23:19:48,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247797720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:48,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:48,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:19:48,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255975096] [2022-12-05 23:19:48,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:48,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:19:48,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:48,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:19:48,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:19:48,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 23:19:48,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05 23:19:48,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:48,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 23:19:48,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:48,562 INFO L130 PetriNetUnfolder]: 155/301 cut-off events. [2022-12-05 23:19:48,563 INFO L131 PetriNetUnfolder]: For 279/295 co-relation queries the response was YES. [2022-12-05 23:19:48,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 301 events. 155/301 cut-off events. For 279/295 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1301 event pairs, 46 based on Foata normal form. 21/313 useless extension candidates. Maximal degree in co-relation 909. Up to 162 conditions per place. [2022-12-05 23:19:48,565 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 28 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-05 23:19:48,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 218 flow [2022-12-05 23:19:48,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:19:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:19:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-05 23:19:48,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-05 23:19:48,566 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 125 flow. Second operand 3 states and 27 transitions. [2022-12-05 23:19:48,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 218 flow [2022-12-05 23:19:48,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 34 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:19:48,568 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 130 flow [2022-12-05 23:19:48,569 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2022-12-05 23:19:48,569 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2022-12-05 23:19:48,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:48,569 INFO L89 Accepts]: Start accepts. Operand has 29 places, 25 transitions, 130 flow [2022-12-05 23:19:48,570 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:48,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:48,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 130 flow [2022-12-05 23:19:48,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 130 flow [2022-12-05 23:19:48,587 INFO L130 PetriNetUnfolder]: 43/126 cut-off events. [2022-12-05 23:19:48,587 INFO L131 PetriNetUnfolder]: For 98/102 co-relation queries the response was YES. [2022-12-05 23:19:48,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 126 events. 43/126 cut-off events. For 98/102 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 553 event pairs, 19 based on Foata normal form. 1/124 useless extension candidates. Maximal degree in co-relation 303. Up to 82 conditions per place. [2022-12-05 23:19:48,588 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 130 flow [2022-12-05 23:19:48,588 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-05 23:19:48,589 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:48,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-05 23:19:48,590 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 130 flow [2022-12-05 23:19:48,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05 23:19:48,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:48,591 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:48,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:19:48,591 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-05 23:19:48,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:48,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1303819268, now seen corresponding path program 1 times [2022-12-05 23:19:48,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:48,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050971069] [2022-12-05 23:19:48,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:48,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:49,131 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-05 23:19:49,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:49,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050971069] [2022-12-05 23:19:49,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050971069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:49,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:49,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:19:49,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884615051] [2022-12-05 23:19:49,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:49,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:19:49,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:49,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:19:49,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:19:49,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 23:19:49,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:49,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:49,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 23:19:49,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:49,272 INFO L130 PetriNetUnfolder]: 186/356 cut-off events. [2022-12-05 23:19:49,273 INFO L131 PetriNetUnfolder]: For 340/347 co-relation queries the response was YES. [2022-12-05 23:19:49,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 356 events. 186/356 cut-off events. For 340/347 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1476 event pairs, 40 based on Foata normal form. 8/360 useless extension candidates. Maximal degree in co-relation 1080. Up to 286 conditions per place. [2022-12-05 23:19:49,275 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 34 selfloop transitions, 12 changer transitions 2/50 dead transitions. [2022-12-05 23:19:49,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 50 transitions, 332 flow [2022-12-05 23:19:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:19:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:19:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-05 23:19:49,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-05 23:19:49,277 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 130 flow. Second operand 5 states and 42 transitions. [2022-12-05 23:19:49,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 50 transitions, 332 flow [2022-12-05 23:19:49,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 50 transitions, 318 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 23:19:49,280 INFO L231 Difference]: Finished difference. Result has 35 places, 34 transitions, 221 flow [2022-12-05 23:19:49,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=35, PETRI_TRANSITIONS=34} [2022-12-05 23:19:49,280 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2022-12-05 23:19:49,281 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:49,281 INFO L89 Accepts]: Start accepts. Operand has 35 places, 34 transitions, 221 flow [2022-12-05 23:19:49,281 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:49,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:49,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 34 transitions, 221 flow [2022-12-05 23:19:49,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 221 flow [2022-12-05 23:19:49,302 INFO L130 PetriNetUnfolder]: 56/154 cut-off events. [2022-12-05 23:19:49,302 INFO L131 PetriNetUnfolder]: For 232/241 co-relation queries the response was YES. [2022-12-05 23:19:49,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 154 events. 56/154 cut-off events. For 232/241 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 701 event pairs, 14 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 485. Up to 100 conditions per place. [2022-12-05 23:19:49,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 34 transitions, 221 flow [2022-12-05 23:19:49,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-05 23:19:49,306 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:49,307 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-05 23:19:49,307 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 34 transitions, 221 flow [2022-12-05 23:19:49,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:49,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:49,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:49,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:19:49,308 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:19:49,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:49,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1257818084, now seen corresponding path program 2 times [2022-12-05 23:19:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:49,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358786397] [2022-12-05 23:19:49,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:49,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:49,731 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-05 23:19:49,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:49,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358786397] [2022-12-05 23:19:49,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358786397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:49,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:49,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:19:49,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938147229] [2022-12-05 23:19:49,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:49,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:19:49,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:49,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:19:49,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:19:49,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 23:19:49,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:49,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:49,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 23:19:49,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:49,858 INFO L130 PetriNetUnfolder]: 178/343 cut-off events. [2022-12-05 23:19:49,859 INFO L131 PetriNetUnfolder]: For 626/631 co-relation queries the response was YES. [2022-12-05 23:19:49,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 343 events. 178/343 cut-off events. For 626/631 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1393 event pairs, 58 based on Foata normal form. 6/349 useless extension candidates. Maximal degree in co-relation 1244. Up to 295 conditions per place. [2022-12-05 23:19:49,861 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 34 selfloop transitions, 13 changer transitions 1/50 dead transitions. [2022-12-05 23:19:49,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 50 transitions, 393 flow [2022-12-05 23:19:49,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:19:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:19:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-05 23:19:49,863 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-05 23:19:49,863 INFO L175 Difference]: Start difference. First operand has 35 places, 34 transitions, 221 flow. Second operand 4 states and 33 transitions. [2022-12-05 23:19:49,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 50 transitions, 393 flow [2022-12-05 23:19:49,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 393 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:19:49,866 INFO L231 Difference]: Finished difference. Result has 39 places, 40 transitions, 307 flow [2022-12-05 23:19:49,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=39, PETRI_TRANSITIONS=40} [2022-12-05 23:19:49,867 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2022-12-05 23:19:49,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:49,867 INFO L89 Accepts]: Start accepts. Operand has 39 places, 40 transitions, 307 flow [2022-12-05 23:19:49,868 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:49,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:49,868 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 40 transitions, 307 flow [2022-12-05 23:19:49,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 40 transitions, 307 flow [2022-12-05 23:19:49,889 INFO L130 PetriNetUnfolder]: 60/151 cut-off events. [2022-12-05 23:19:49,889 INFO L131 PetriNetUnfolder]: For 353/359 co-relation queries the response was YES. [2022-12-05 23:19:49,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 151 events. 60/151 cut-off events. For 353/359 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 650 event pairs, 10 based on Foata normal form. 1/151 useless extension candidates. Maximal degree in co-relation 569. Up to 100 conditions per place. [2022-12-05 23:19:49,891 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 40 transitions, 307 flow [2022-12-05 23:19:49,891 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-05 23:19:49,893 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:49,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-05 23:19:49,894 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 40 transitions, 307 flow [2022-12-05 23:19:49,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:49,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:49,894 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:49,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:19:49,894 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:19:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:49,895 INFO L85 PathProgramCache]: Analyzing trace with hash 336425693, now seen corresponding path program 1 times [2022-12-05 23:19:49,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:49,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882811421] [2022-12-05 23:19:49,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:49,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:50,347 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-05 23:19:50,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:50,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882811421] [2022-12-05 23:19:50,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882811421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:50,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:50,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:19:50,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185784582] [2022-12-05 23:19:50,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:50,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:19:50,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:50,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:19:50,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:19:50,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 23:19:50,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 40 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:50,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:50,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 23:19:50,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:50,468 INFO L130 PetriNetUnfolder]: 171/334 cut-off events. [2022-12-05 23:19:50,469 INFO L131 PetriNetUnfolder]: For 896/906 co-relation queries the response was YES. [2022-12-05 23:19:50,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 334 events. 171/334 cut-off events. For 896/906 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1373 event pairs, 57 based on Foata normal form. 6/340 useless extension candidates. Maximal degree in co-relation 1362. Up to 289 conditions per place. [2022-12-05 23:19:50,472 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 37 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2022-12-05 23:19:50,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 451 flow [2022-12-05 23:19:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:19:50,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:19:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-05 23:19:50,474 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-05 23:19:50,474 INFO L175 Difference]: Start difference. First operand has 39 places, 40 transitions, 307 flow. Second operand 4 states and 31 transitions. [2022-12-05 23:19:50,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 451 flow [2022-12-05 23:19:50,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 429 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-05 23:19:50,478 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 350 flow [2022-12-05 23:19:50,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=350, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2022-12-05 23:19:50,481 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2022-12-05 23:19:50,481 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:50,481 INFO L89 Accepts]: Start accepts. Operand has 42 places, 43 transitions, 350 flow [2022-12-05 23:19:50,482 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:50,482 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:50,482 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 43 transitions, 350 flow [2022-12-05 23:19:50,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 43 transitions, 350 flow [2022-12-05 23:19:50,506 INFO L130 PetriNetUnfolder]: 57/147 cut-off events. [2022-12-05 23:19:50,506 INFO L131 PetriNetUnfolder]: For 412/425 co-relation queries the response was YES. [2022-12-05 23:19:50,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 147 events. 57/147 cut-off events. For 412/425 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 621 event pairs, 9 based on Foata normal form. 2/149 useless extension candidates. Maximal degree in co-relation 574. Up to 97 conditions per place. [2022-12-05 23:19:50,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 43 transitions, 350 flow [2022-12-05 23:19:50,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 23:19:50,511 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:50,512 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-05 23:19:50,512 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 350 flow [2022-12-05 23:19:50,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:50,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:50,513 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:50,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:19:50,513 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:19:50,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:50,513 INFO L85 PathProgramCache]: Analyzing trace with hash 336462211, now seen corresponding path program 1 times [2022-12-05 23:19:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:50,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512230990] [2022-12-05 23:19:50,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:50,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:50,902 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-05 23:19:50,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:50,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512230990] [2022-12-05 23:19:50,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512230990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:50,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:50,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:19:50,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532577054] [2022-12-05 23:19:50,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:50,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:19:50,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:50,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:19:50,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:19:50,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 23:19:50,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 350 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:50,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:50,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 23:19:50,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:51,112 INFO L130 PetriNetUnfolder]: 175/342 cut-off events. [2022-12-05 23:19:51,112 INFO L131 PetriNetUnfolder]: For 1130/1140 co-relation queries the response was YES. [2022-12-05 23:19:51,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 342 events. 175/342 cut-off events. For 1130/1140 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1402 event pairs, 55 based on Foata normal form. 6/348 useless extension candidates. Maximal degree in co-relation 1454. Up to 290 conditions per place. [2022-12-05 23:19:51,115 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 38 selfloop transitions, 15 changer transitions 4/59 dead transitions. [2022-12-05 23:19:51,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 546 flow [2022-12-05 23:19:51,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:19:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:19:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-12-05 23:19:51,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2022-12-05 23:19:51,117 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 350 flow. Second operand 7 states and 44 transitions. [2022-12-05 23:19:51,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 546 flow [2022-12-05 23:19:51,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 529 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-05 23:19:51,121 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 406 flow [2022-12-05 23:19:51,122 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=406, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2022-12-05 23:19:51,122 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 22 predicate places. [2022-12-05 23:19:51,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:51,122 INFO L89 Accepts]: Start accepts. Operand has 49 places, 46 transitions, 406 flow [2022-12-05 23:19:51,123 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:51,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:51,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 46 transitions, 406 flow [2022-12-05 23:19:51,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 46 transitions, 406 flow [2022-12-05 23:19:51,145 INFO L130 PetriNetUnfolder]: 54/146 cut-off events. [2022-12-05 23:19:51,146 INFO L131 PetriNetUnfolder]: For 647/660 co-relation queries the response was YES. [2022-12-05 23:19:51,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 146 events. 54/146 cut-off events. For 647/660 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 630 event pairs, 9 based on Foata normal form. 2/148 useless extension candidates. Maximal degree in co-relation 628. Up to 92 conditions per place. [2022-12-05 23:19:51,148 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 46 transitions, 406 flow [2022-12-05 23:19:51,148 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 23:19:51,195 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [320] $Ultimate##0-->L743: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd1~0_46 1) (= v_~y$r_buff0_thd2~0_35 v_~y$r_buff1_thd2~0_33) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd0~0_81 v_~y$r_buff1_thd0~0_79) (= v_~y$w_buff0_used~0_163 1) (= v_~y$w_buff0~0_99 v_~y$w_buff1~0_79) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= 2 v_~y$w_buff0~0_98) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_140) (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff1_thd1~0_35) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_140 256) 0)) (not (= (mod v_~y$w_buff0_used~0_163 256) 0)))) 1 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, ~y$w_buff0~0=v_~y$w_buff0~0_99, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_35, ~y$w_buff1~0=v_~y$w_buff1~0_79, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, ~y$w_buff0~0=v_~y$w_buff0~0_98, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_140} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$w_buff1_used~0] and [321] L2-1-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_167 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd0~0_82 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_84 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_168 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_143 256) 0)) .cse3)) (.cse4 (and .cse5 .cse2))) (and (= v_~y$w_buff0_used~0_167 (ite .cse0 0 v_~y$w_buff0_used~0_168)) (= v_~y~0_98 (ite .cse0 v_~y$w_buff0~0_102 (ite .cse1 v_~y$w_buff1~0_81 v_~y~0_99))) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_83 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_142 256) 0)) .cse3)) 0 v_~y$r_buff1_thd0~0_82) v_~y$r_buff1_thd0~0_81) (= (ite (or .cse1 .cse4) 0 v_~y$w_buff1_used~0_143) v_~y$w_buff1_used~0_142) (= v_~y$r_buff0_thd0~0_83 (ite .cse4 0 v_~y$r_buff0_thd0~0_84))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_168, ~y$w_buff1~0=v_~y$w_buff1~0_81, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_84, ~y$w_buff0~0=v_~y$w_buff0~0_102, ~y~0=v_~y~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_143} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_167, ~y$w_buff1~0=v_~y$w_buff1~0_81, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_102, ~y~0=v_~y~0_98, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_81, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_142} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-05 23:19:51,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [320] $Ultimate##0-->L743: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd1~0_46 1) (= v_~y$r_buff0_thd2~0_35 v_~y$r_buff1_thd2~0_33) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd0~0_81 v_~y$r_buff1_thd0~0_79) (= v_~y$w_buff0_used~0_163 1) (= v_~y$w_buff0~0_99 v_~y$w_buff1~0_79) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= 2 v_~y$w_buff0~0_98) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_140) (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff1_thd1~0_35) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_140 256) 0)) (not (= (mod v_~y$w_buff0_used~0_163 256) 0)))) 1 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, ~y$w_buff0~0=v_~y$w_buff0~0_99, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_35, ~y$w_buff1~0=v_~y$w_buff1~0_79, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, ~y$w_buff0~0=v_~y$w_buff0~0_98, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_140} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$w_buff1_used~0] and [282] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_113 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_114 256) 0)))) (.cse1 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_113 (ite .cse0 0 v_~y$w_buff0_used~0_114)) (= v_~y$r_buff0_thd2~0_25 (ite .cse1 0 v_~y$r_buff0_thd2~0_26)) (= v_~y~0_73 (ite .cse0 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_49 v_~y~0_74))) (= v_~y$w_buff1_used~0_104 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_105)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff1~0=v_~y$w_buff1~0_49, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_49, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-05 23:19:51,599 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [374] $Ultimate##0-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_434 256) 0))) (.cse4 (= (mod v_~y$w_buff0_used~0_436 256) 0)) (.cse1 (not (= (mod v_~y$r_buff0_thd0~0_237 256) 0)))) (let ((.cse2 (and (not .cse4) .cse1)) (.cse0 (and .cse3 .cse1))) (and (= v_~y$r_buff0_thd2~0_140 v_~y$r_buff1_thd2~0_140) (= v_~y$r_buff0_thd1~0_175 v_~y$r_buff1_thd1~0_130) (= v_~y$r_buff0_thd0~0_236 (ite .cse0 0 v_~y$r_buff0_thd0~0_237)) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_44| 0)) (= 2 v_~y$w_buff0~0_274) (= v_~y~0_344 (ite .cse1 v_~y$w_buff0~0_274 (ite .cse2 v_~y$w_buff1~0_235 v_~y~0_345))) (= |v_P0Thread1of1ForFork1_~arg#1.base_42| |v_P0Thread1of1ForFork1_#in~arg#1.base_42|) (= v_~y$w_buff1~0_235 v_~y$w_buff0~0_275) (= (ite (or (and (not (= 0 (mod v_~y$w_buff1_used~0_387 256))) .cse1) (and (not (= (mod v_~y$r_buff0_thd0~0_236 256) 0)) .cse3)) 0 v_~y$r_buff0_thd0~0_237) v_~y$r_buff1_thd0~0_241) (= v_~y$w_buff0_used~0_434 (ite .cse1 0 1)) (= v_~y$r_buff0_thd1~0_174 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_42| |v_P0Thread1of1ForFork1_#in~arg#1.offset_42|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44| (ite .cse4 1 0)) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_44| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44|) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff0_used~0_436) v_~y$w_buff1_used~0_387)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_436, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_42|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_237, ~y$w_buff0~0=v_~y$w_buff0~0_275, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_175, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_140, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_42|, ~y~0=v_~y~0_345} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_434, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_42|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_42|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_42|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_42|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_140, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_235, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_274, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_174, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_140, ~y~0=v_~y~0_344, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_44|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_241, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_387} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, ~y~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [282] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_113 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_114 256) 0)))) (.cse1 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_113 (ite .cse0 0 v_~y$w_buff0_used~0_114)) (= v_~y$r_buff0_thd2~0_25 (ite .cse1 0 v_~y$r_buff0_thd2~0_26)) (= v_~y~0_73 (ite .cse0 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_49 v_~y~0_74))) (= v_~y$w_buff1_used~0_104 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_105)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff1~0=v_~y$w_buff1~0_49, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_49, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-05 23:19:52,191 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L773: Formula: (let ((.cse8 (not (= (mod v_~y$r_buff0_thd0~0_243 256) 0)))) (let ((.cse2 (ite .cse8 0 1))) (let ((.cse10 (not (= (mod .cse2 256) 0))) (.cse12 (= (mod v_~y$w_buff0_used~0_448 256) 0))) (let ((.cse9 (and .cse8 (not .cse12))) (.cse3 (and .cse8 .cse10))) (let ((.cse5 (ite (or .cse9 .cse3) 0 v_~y$w_buff0_used~0_448))) (let ((.cse11 (not (= (mod .cse5 256) 0))) (.cse6 (not (= 0 (mod v_~y$w_buff0_used~0_446 256)))) (.cse7 (not (= (mod v_~y$r_buff0_thd2~0_147 256) 0)))) (let ((.cse0 (and .cse6 .cse7)) (.cse1 (and .cse7 .cse10)) (.cse4 (and .cse7 .cse11))) (and (= v_~y$r_buff0_thd2~0_146 (ite .cse0 0 v_~y$r_buff0_thd2~0_147)) (= v_~y$w_buff0_used~0_446 (ite .cse1 0 .cse2)) (= (ite .cse3 0 v_~y$r_buff0_thd0~0_243) v_~y$r_buff0_thd0~0_242) (= v_~y$w_buff1~0_239 v_~y$w_buff0~0_283) (= |v_P0Thread1of1ForFork1_~arg#1.offset_46| |v_P0Thread1of1ForFork1_#in~arg#1.offset_46|) (= v_~y$r_buff0_thd1~0_182 1) (= (ite (or .cse0 .cse4) 0 .cse5) v_~y$w_buff1_used~0_395) (= v_~y$r_buff0_thd1~0_183 v_~y$r_buff1_thd1~0_134) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| 0)) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|) (= (ite (or (and .cse6 (not (= (mod v_~y$r_buff0_thd2~0_146 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_395 256) 0)) .cse7)) 0 v_~y$r_buff0_thd2~0_147) v_~y$r_buff1_thd2~0_146) (= v_~y~0_352 (ite .cse1 v_~y$w_buff0~0_282 (ite .cse4 v_~y$w_buff1~0_239 (ite .cse8 v_~y$w_buff0~0_282 (ite .cse9 v_~y$w_buff1~0_239 v_~y~0_354))))) (= v_~y$r_buff1_thd0~0_247 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_242 256) 0)) .cse10) (and .cse8 .cse11)) 0 v_~y$r_buff0_thd0~0_243)) (= (ite .cse12 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|) (= 2 v_~y$w_buff0~0_282) (= |v_P0Thread1of1ForFork1_~arg#1.base_46| |v_P0Thread1of1ForFork1_#in~arg#1.base_46|))))))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_448, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_46|, ~y$w_buff0~0=v_~y$w_buff0~0_283, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_243, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_147, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_183, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_46|, ~y~0=v_~y~0_354} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_446, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_46|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_46|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_46|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_46|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_146, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_134, ~y$w_buff1~0=v_~y$w_buff1~0_239, ~y$w_buff0~0=v_~y$w_buff0~0_282, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_242, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_146, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_182, ~y~0=v_~y~0_352, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_48|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_247, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_395} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd2~0, ~y$r_buff0_thd1~0, ~y~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [368] L804-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~y$r_buff1_thd0~0_155 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd0~0_154 256) 0))) (let ((.cse11 (not .cse10)) (.cse2 (and .cse10 (= (mod v_~y$w_buff1_used~0_227 256) 0))) (.cse12 (= (mod v_~y$w_buff0_used~0_255 256) 0)) (.cse4 (and .cse10 .cse9))) (let ((.cse5 (or .cse2 .cse12 .cse4)) (.cse6 (and .cse11 (not .cse12)))) (let ((.cse1 (ite .cse5 v_~y~0_185 (ite .cse6 v_~y$w_buff0~0_169 v_~y$w_buff1~0_145))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse7 (= (mod v_~y$w_buff1_used~0_226 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_254 256) 0))) (and (= v_~weak$$choice0~0_47 |v_ULTIMATE.start_main_#t~nondet7#1_79|) (= v_~y$w_buff0~0_169 v_~y$w_buff0~0_168) (= (mod v_~main$tmp_guard1~0_52 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~y~0_184 (ite .cse0 v_~y$mem_tmp~0_64 .cse1)) (= 0 v_~y$flush_delayed~0_63) (= v_~y$w_buff1~0_145 v_~y$w_buff1~0_144) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (ite .cse0 v_~y$w_buff1_used~0_227 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_227 0)) v_~y$w_buff1_used~0_226) (= v_~y~0_185 v_~y$mem_tmp~0_64) (= v_~y$w_buff0_used~0_254 (ite .cse0 v_~y$w_buff0_used~0_255 (ite .cse5 v_~y$w_buff0_used~0_255 (ite .cse6 0 v_~y$w_buff0_used~0_255)))) (= v_~y$r_buff1_thd0~0_154 (ite .cse0 v_~y$r_buff1_thd0~0_155 (ite (let ((.cse8 (= (mod v_~y$r_buff0_thd0~0_153 256) 0))) (or (and .cse7 .cse8) (and .cse9 .cse8) .cse3)) v_~y$r_buff1_thd0~0_155 0))) (= (ite (= (ite (not (and (= v_~x~0_67 2) (= 2 .cse1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_52) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0) (= v_~weak$$choice2~0_64 |v_ULTIMATE.start_main_#t~nondet8#1_73|) (= v_~y$r_buff0_thd0~0_153 (ite .cse0 v_~y$r_buff0_thd0~0_154 (ite (or (and .cse7 .cse10) .cse3 .cse4) v_~y$r_buff0_thd0~0_154 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd0~0_154))))))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_255, ~y$w_buff1~0=v_~y$w_buff1~0_145, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_154, ~y$w_buff0~0=v_~y$w_buff0~0_169, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_73|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_79|, ~y~0=v_~y~0_185, ~x~0=v_~x~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_227} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_47, ~y$mem_tmp~0=v_~y$mem_tmp~0_64, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~y$w_buff1~0=v_~y$w_buff1~0_144, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_153, ~y$w_buff0~0=v_~y$w_buff0~0_168, ~y$flush_delayed~0=v_~y$flush_delayed~0_63, ~y~0=v_~y~0_184, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~x~0=v_~x~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_154, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_226} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-05 23:19:52,793 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:19:52,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1672 [2022-12-05 23:19:52,794 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 412 flow [2022-12-05 23:19:52,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:52,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:52,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:52,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:19:52,795 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:19:52,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash 336463141, now seen corresponding path program 2 times [2022-12-05 23:19:52,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:52,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100965239] [2022-12-05 23:19:52,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:53,171 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-05 23:19:53,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:53,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100965239] [2022-12-05 23:19:53,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100965239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:53,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:53,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:19:53,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066482628] [2022-12-05 23:19:53,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:53,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:19:53,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:53,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:19:53,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:19:53,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-05 23:19:53,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:53,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:53,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-05 23:19:53,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:53,299 INFO L130 PetriNetUnfolder]: 162/318 cut-off events. [2022-12-05 23:19:53,300 INFO L131 PetriNetUnfolder]: For 1606/1618 co-relation queries the response was YES. [2022-12-05 23:19:53,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1508 conditions, 318 events. 162/318 cut-off events. For 1606/1618 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1306 event pairs, 57 based on Foata normal form. 5/323 useless extension candidates. Maximal degree in co-relation 1480. Up to 274 conditions per place. [2022-12-05 23:19:53,302 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 37 selfloop transitions, 13 changer transitions 2/54 dead transitions. [2022-12-05 23:19:53,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 576 flow [2022-12-05 23:19:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:19:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:19:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-05 23:19:53,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-05 23:19:53,304 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 412 flow. Second operand 5 states and 35 transitions. [2022-12-05 23:19:53,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 576 flow [2022-12-05 23:19:53,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 512 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-05 23:19:53,310 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 402 flow [2022-12-05 23:19:53,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=402, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2022-12-05 23:19:53,310 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 22 predicate places. [2022-12-05 23:19:53,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:53,311 INFO L89 Accepts]: Start accepts. Operand has 49 places, 45 transitions, 402 flow [2022-12-05 23:19:53,311 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:53,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:53,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 45 transitions, 402 flow [2022-12-05 23:19:53,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 402 flow [2022-12-05 23:19:53,332 INFO L130 PetriNetUnfolder]: 54/140 cut-off events. [2022-12-05 23:19:53,332 INFO L131 PetriNetUnfolder]: For 535/548 co-relation queries the response was YES. [2022-12-05 23:19:53,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 140 events. 54/140 cut-off events. For 535/548 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 596 event pairs, 9 based on Foata normal form. 2/142 useless extension candidates. Maximal degree in co-relation 600. Up to 89 conditions per place. [2022-12-05 23:19:53,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 402 flow [2022-12-05 23:19:53,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-05 23:19:53,354 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [320] $Ultimate##0-->L743: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd1~0_46 1) (= v_~y$r_buff0_thd2~0_35 v_~y$r_buff1_thd2~0_33) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd0~0_81 v_~y$r_buff1_thd0~0_79) (= v_~y$w_buff0_used~0_163 1) (= v_~y$w_buff0~0_99 v_~y$w_buff1~0_79) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= 2 v_~y$w_buff0~0_98) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_140) (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff1_thd1~0_35) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_140 256) 0)) (not (= (mod v_~y$w_buff0_used~0_163 256) 0)))) 1 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, ~y$w_buff0~0=v_~y$w_buff0~0_99, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_35, ~y$w_buff1~0=v_~y$w_buff1~0_79, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, ~y$w_buff0~0=v_~y$w_buff0~0_98, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_140} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$w_buff1_used~0] and [282] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_113 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_114 256) 0)))) (.cse1 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_113 (ite .cse0 0 v_~y$w_buff0_used~0_114)) (= v_~y$r_buff0_thd2~0_25 (ite .cse1 0 v_~y$r_buff0_thd2~0_26)) (= v_~y~0_73 (ite .cse0 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_49 v_~y~0_74))) (= v_~y$w_buff1_used~0_104 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_105)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff1~0=v_~y$w_buff1~0_49, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_49, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-05 23:19:53,542 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_113 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_114 256) 0)))) (.cse1 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_113 (ite .cse0 0 v_~y$w_buff0_used~0_114)) (= v_~y$r_buff0_thd2~0_25 (ite .cse1 0 v_~y$r_buff0_thd2~0_26)) (= v_~y~0_73 (ite .cse0 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_49 v_~y~0_74))) (= v_~y$w_buff1_used~0_104 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_105)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff1~0=v_~y$w_buff1~0_49, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_49, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [320] $Ultimate##0-->L743: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd1~0_46 1) (= v_~y$r_buff0_thd2~0_35 v_~y$r_buff1_thd2~0_33) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd0~0_81 v_~y$r_buff1_thd0~0_79) (= v_~y$w_buff0_used~0_163 1) (= v_~y$w_buff0~0_99 v_~y$w_buff1~0_79) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= 2 v_~y$w_buff0~0_98) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_140) (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff1_thd1~0_35) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_140 256) 0)) (not (= (mod v_~y$w_buff0_used~0_163 256) 0)))) 1 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, ~y$w_buff0~0=v_~y$w_buff0~0_99, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_35, ~y$w_buff1~0=v_~y$w_buff1~0_79, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, ~y$w_buff0~0=v_~y$w_buff0~0_98, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_140} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$w_buff1_used~0] [2022-12-05 23:19:53,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_113 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_114 256) 0)))) (.cse1 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_113 (ite .cse0 0 v_~y$w_buff0_used~0_114)) (= v_~y$r_buff0_thd2~0_25 (ite .cse1 0 v_~y$r_buff0_thd2~0_26)) (= v_~y~0_73 (ite .cse0 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_49 v_~y~0_74))) (= v_~y$w_buff1_used~0_104 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_105)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff1~0=v_~y$w_buff1~0_49, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_49, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [320] $Ultimate##0-->L743: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd1~0_46 1) (= v_~y$r_buff0_thd2~0_35 v_~y$r_buff1_thd2~0_33) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd0~0_81 v_~y$r_buff1_thd0~0_79) (= v_~y$w_buff0_used~0_163 1) (= v_~y$w_buff0~0_99 v_~y$w_buff1~0_79) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= 2 v_~y$w_buff0~0_98) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_140) (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff1_thd1~0_35) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_140 256) 0)) (not (= (mod v_~y$w_buff0_used~0_163 256) 0)))) 1 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, ~y$w_buff0~0=v_~y$w_buff0~0_99, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_35, ~y$w_buff1~0=v_~y$w_buff1~0_79, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, ~y$w_buff0~0=v_~y$w_buff0~0_98, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_140} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$w_buff1_used~0] [2022-12-05 23:19:53,867 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:19:53,868 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 558 [2022-12-05 23:19:53,868 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 395 flow [2022-12-05 23:19:53,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:53,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:53,868 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:53,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:19:53,869 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:19:53,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1067805075, now seen corresponding path program 1 times [2022-12-05 23:19:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:53,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591463698] [2022-12-05 23:19:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:53,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:54,234 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-05 23:19:54,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:54,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591463698] [2022-12-05 23:19:54,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591463698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:54,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:54,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:19:54,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164527242] [2022-12-05 23:19:54,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:54,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:19:54,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:54,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:19:54,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:19:54,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:19:54,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 395 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-05 23:19:54,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:54,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:19:54,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:54,324 INFO L130 PetriNetUnfolder]: 152/301 cut-off events. [2022-12-05 23:19:54,324 INFO L131 PetriNetUnfolder]: For 1249/1260 co-relation queries the response was YES. [2022-12-05 23:19:54,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 301 events. 152/301 cut-off events. For 1249/1260 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1210 event pairs, 55 based on Foata normal form. 4/305 useless extension candidates. Maximal degree in co-relation 1373. Up to 269 conditions per place. [2022-12-05 23:19:54,327 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 34 selfloop transitions, 11 changer transitions 0/47 dead transitions. [2022-12-05 23:19:54,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 486 flow [2022-12-05 23:19:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:19:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:19:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-05 23:19:54,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3875 [2022-12-05 23:19:54,328 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 395 flow. Second operand 4 states and 31 transitions. [2022-12-05 23:19:54,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 486 flow [2022-12-05 23:19:54,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 439 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-05 23:19:54,333 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 355 flow [2022-12-05 23:19:54,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=355, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2022-12-05 23:19:54,334 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 18 predicate places. [2022-12-05 23:19:54,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:54,334 INFO L89 Accepts]: Start accepts. Operand has 45 places, 42 transitions, 355 flow [2022-12-05 23:19:54,335 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:54,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:54,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 42 transitions, 355 flow [2022-12-05 23:19:54,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 42 transitions, 355 flow [2022-12-05 23:19:54,357 INFO L130 PetriNetUnfolder]: 53/133 cut-off events. [2022-12-05 23:19:54,358 INFO L131 PetriNetUnfolder]: For 410/416 co-relation queries the response was YES. [2022-12-05 23:19:54,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 133 events. 53/133 cut-off events. For 410/416 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 534 event pairs, 9 based on Foata normal form. 2/132 useless extension candidates. Maximal degree in co-relation 531. Up to 86 conditions per place. [2022-12-05 23:19:54,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 42 transitions, 355 flow [2022-12-05 23:19:54,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-05 23:19:54,361 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:54,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-05 23:19:54,362 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 355 flow [2022-12-05 23:19:54,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-05 23:19:54,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:54,362 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:54,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:19:54,362 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:19:54,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:54,363 INFO L85 PathProgramCache]: Analyzing trace with hash 336518910, now seen corresponding path program 1 times [2022-12-05 23:19:54,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:54,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668332623] [2022-12-05 23:19:54,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:54,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:54,766 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-05 23:19:54,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:54,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668332623] [2022-12-05 23:19:54,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668332623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:54,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:54,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:19:54,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280908104] [2022-12-05 23:19:54,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:54,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:19:54,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:54,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:19:54,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:19:54,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-05 23:19:54,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:54,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:54,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-05 23:19:54,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:54,942 INFO L130 PetriNetUnfolder]: 160/321 cut-off events. [2022-12-05 23:19:54,943 INFO L131 PetriNetUnfolder]: For 1233/1250 co-relation queries the response was YES. [2022-12-05 23:19:54,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 321 events. 160/321 cut-off events. For 1233/1250 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1342 event pairs, 46 based on Foata normal form. 11/328 useless extension candidates. Maximal degree in co-relation 1365. Up to 271 conditions per place. [2022-12-05 23:19:54,945 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 34 selfloop transitions, 8 changer transitions 9/53 dead transitions. [2022-12-05 23:19:54,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 505 flow [2022-12-05 23:19:54,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:19:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:19:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-05 23:19:54,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2022-12-05 23:19:54,947 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 355 flow. Second operand 6 states and 40 transitions. [2022-12-05 23:19:54,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 505 flow [2022-12-05 23:19:54,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 483 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:19:54,950 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 328 flow [2022-12-05 23:19:54,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2022-12-05 23:19:54,951 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 22 predicate places. [2022-12-05 23:19:54,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:54,951 INFO L89 Accepts]: Start accepts. Operand has 49 places, 39 transitions, 328 flow [2022-12-05 23:19:54,952 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:54,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:54,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 39 transitions, 328 flow [2022-12-05 23:19:54,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 39 transitions, 328 flow [2022-12-05 23:19:54,969 INFO L130 PetriNetUnfolder]: 49/130 cut-off events. [2022-12-05 23:19:54,969 INFO L131 PetriNetUnfolder]: For 585/598 co-relation queries the response was YES. [2022-12-05 23:19:54,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 130 events. 49/130 cut-off events. For 585/598 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 537 event pairs, 8 based on Foata normal form. 2/131 useless extension candidates. Maximal degree in co-relation 537. Up to 86 conditions per place. [2022-12-05 23:19:54,970 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 39 transitions, 328 flow [2022-12-05 23:19:54,971 INFO L188 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-05 23:19:54,994 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L763-->L766: Formula: (= v_~y~0_3 1) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] and [321] L2-1-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_167 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd0~0_82 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_84 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_168 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_143 256) 0)) .cse3)) (.cse4 (and .cse5 .cse2))) (and (= v_~y$w_buff0_used~0_167 (ite .cse0 0 v_~y$w_buff0_used~0_168)) (= v_~y~0_98 (ite .cse0 v_~y$w_buff0~0_102 (ite .cse1 v_~y$w_buff1~0_81 v_~y~0_99))) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_83 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_142 256) 0)) .cse3)) 0 v_~y$r_buff1_thd0~0_82) v_~y$r_buff1_thd0~0_81) (= (ite (or .cse1 .cse4) 0 v_~y$w_buff1_used~0_143) v_~y$w_buff1_used~0_142) (= v_~y$r_buff0_thd0~0_83 (ite .cse4 0 v_~y$r_buff0_thd0~0_84))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_168, ~y$w_buff1~0=v_~y$w_buff1~0_81, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_84, ~y$w_buff0~0=v_~y$w_buff0~0_102, ~y~0=v_~y~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_143} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_167, ~y$w_buff1~0=v_~y$w_buff1~0_81, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_102, ~y~0=v_~y~0_98, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_81, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_142} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-05 23:19:55,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [381] L763-->L804: Formula: (let ((.cse1 (not (= 0 (mod v_~y$r_buff1_thd0~0_282 256)))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_279 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_500 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_442 256) 0)) .cse1)) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_501 256) 0))))) (and (= v_~y$r_buff0_thd0~0_278 (ite .cse0 0 v_~y$r_buff0_thd0~0_279)) (= v_~y$r_buff1_thd0~0_281 (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_441 256) 0))) (and .cse2 (not (= 0 (mod v_~y$r_buff0_thd0~0_278 256))))) 0 v_~y$r_buff1_thd0~0_282)) (= v_~y$w_buff1_used~0_441 (ite (or .cse3 .cse0) 0 v_~y$w_buff1_used~0_442)) (= v_~y~0_395 (ite .cse4 v_~y$w_buff0~0_325 (ite .cse3 v_~y$w_buff1~0_271 1))) (= (ite .cse4 0 v_~y$w_buff0_used~0_501) v_~y$w_buff0_used~0_500)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_501, ~y$w_buff1~0=v_~y$w_buff1~0_271, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_279, ~y$w_buff0~0=v_~y$w_buff0~0_325, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_282, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_442} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_500, ~y$w_buff1~0=v_~y$w_buff1~0_271, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_278, ~y$w_buff0~0=v_~y$w_buff0~0_325, ~y~0=v_~y~0_395, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_281, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_441} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [380] L766-->L743: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff0_thd2~0_172 256) 0)))) (let ((.cse2 (and .cse1 (not (= (mod v_~y$w_buff0_used~0_496 256) 0))))) (let ((.cse0 (ite .cse2 0 v_~y$w_buff0_used~0_496))) (and (= v_~y$r_buff0_thd0~0_276 v_~y$r_buff1_thd0~0_279) (= v_~y$w_buff0_used~0_494 1) (= (ite (and (not (= (mod .cse0 256) 0)) .cse1) 0 v_~y$r_buff0_thd2~0_172) v_~y$r_buff0_thd2~0_171) (= (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_435 256))) (not (= (mod v_~y$w_buff0_used~0_494 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_65|) (= v_~y$r_buff0_thd1~0_216 1) (= v_~y$r_buff0_thd2~0_171 v_~y$r_buff1_thd2~0_171) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_65| 0)) (= 2 v_~y$w_buff0~0_321) (= |v_P0Thread1of1ForFork1_~arg#1.base_63| |v_P0Thread1of1ForFork1_#in~arg#1.base_63|) (= |v_P0Thread1of1ForFork1_~arg#1.offset_63| |v_P0Thread1of1ForFork1_#in~arg#1.offset_63|) (= v_~y$w_buff1_used~0_435 .cse0) (= (ite .cse2 v_~y$w_buff0~0_322 (ite (and (not (= (mod v_~y$w_buff1_used~0_437 256) 0)) (not (= (mod v_~y$r_buff1_thd2~0_173 256) 0))) v_~y$w_buff1~0_268 v_~y~0_392)) v_~y~0_391) (= v_~y$r_buff0_thd1~0_217 v_~y$r_buff1_thd1~0_151) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_65| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_65|) (= v_~y$w_buff1~0_267 v_~y$w_buff0~0_322))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_173, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_496, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_63|, ~y$w_buff1~0=v_~y$w_buff1~0_268, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_276, ~y$w_buff0~0=v_~y$w_buff0~0_322, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_217, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_172, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_63|, ~y~0=v_~y~0_392, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_437} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_494, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_63|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_63|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_63|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_63|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_151, ~y$w_buff1~0=v_~y$w_buff1~0_267, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_65|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_276, ~y$w_buff0~0=v_~y$w_buff0~0_321, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_216, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_171, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_65|, ~y~0=v_~y~0_391, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_279, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_435} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff0_thd2~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-05 23:19:55,368 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [381] L763-->L804: Formula: (let ((.cse1 (not (= 0 (mod v_~y$r_buff1_thd0~0_282 256)))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_279 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_500 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_442 256) 0)) .cse1)) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_501 256) 0))))) (and (= v_~y$r_buff0_thd0~0_278 (ite .cse0 0 v_~y$r_buff0_thd0~0_279)) (= v_~y$r_buff1_thd0~0_281 (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_441 256) 0))) (and .cse2 (not (= 0 (mod v_~y$r_buff0_thd0~0_278 256))))) 0 v_~y$r_buff1_thd0~0_282)) (= v_~y$w_buff1_used~0_441 (ite (or .cse3 .cse0) 0 v_~y$w_buff1_used~0_442)) (= v_~y~0_395 (ite .cse4 v_~y$w_buff0~0_325 (ite .cse3 v_~y$w_buff1~0_271 1))) (= (ite .cse4 0 v_~y$w_buff0_used~0_501) v_~y$w_buff0_used~0_500)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_501, ~y$w_buff1~0=v_~y$w_buff1~0_271, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_279, ~y$w_buff0~0=v_~y$w_buff0~0_325, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_282, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_442} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_500, ~y$w_buff1~0=v_~y$w_buff1~0_271, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_278, ~y$w_buff0~0=v_~y$w_buff0~0_325, ~y~0=v_~y~0_395, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_281, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_441} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [378] $Ultimate##0-->L773: Formula: (let ((.cse4 (= (mod v_~y$w_buff0_used~0_476 256) 0)) (.cse0 (not (= (mod v_~y$r_buff0_thd2~0_161 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_474 256) 0)))) (let ((.cse1 (and .cse0 .cse3)) (.cse2 (and .cse0 (not .cse4)))) (and (= v_~y$w_buff1~0_256 v_~y$w_buff0~0_307) (= v_~y$w_buff0_used~0_474 (ite .cse0 0 1)) (= v_~y$r_buff0_thd1~0_202 1) (= v_~y$w_buff1_used~0_417 (ite (or .cse1 .cse2) 0 v_~y$w_buff0_used~0_476)) (= v_~y$r_buff1_thd2~0_158 (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_417 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_160 256) 0)))) 0 v_~y$r_buff0_thd2~0_161)) (= 2 v_~y$w_buff0~0_306) (= v_~y$r_buff0_thd1~0_203 v_~y$r_buff1_thd1~0_144) (= (ite .cse4 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_58|) (= |v_P0Thread1of1ForFork1_~arg#1.base_56| |v_P0Thread1of1ForFork1_#in~arg#1.base_56|) (= v_~y$r_buff0_thd0~0_265 v_~y$r_buff1_thd0~0_268) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_58| 0)) (= (ite .cse1 0 v_~y$r_buff0_thd2~0_161) v_~y$r_buff0_thd2~0_160) (= (ite .cse0 v_~y$w_buff0~0_306 (ite .cse2 v_~y$w_buff1~0_256 v_~y~0_378)) v_~y~0_377) (= |v_P0Thread1of1ForFork1_~arg#1.offset_56| |v_P0Thread1of1ForFork1_#in~arg#1.offset_56|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_58| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_58|)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_476, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_56|, ~y$w_buff0~0=v_~y$w_buff0~0_307, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_265, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_161, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_203, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_56|, ~y~0=v_~y~0_378} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_474, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_56|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_56|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_56|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_56|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_158, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_144, ~y$w_buff1~0=v_~y$w_buff1~0_256, ~y$w_buff0~0=v_~y$w_buff0~0_306, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_58|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_265, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_160, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_202, ~y~0=v_~y~0_377, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_58|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_268, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd2~0, ~y$r_buff0_thd1~0, ~y~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-05 23:19:56,634 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [382] L763-->L743: Formula: (let ((.cse6 (not (= (mod v_~y$r_buff0_thd0~0_283 256) 0)))) (let ((.cse5 (and .cse6 (not (= (mod v_~y$w_buff0_used~0_506 256) 0))))) (let ((.cse8 (ite .cse5 0 v_~y$w_buff0_used~0_506))) (let ((.cse0 (not (= (mod v_~y$r_buff0_thd2~0_176 256) 0))) (.cse7 (not (= (mod .cse8 256) 0)))) (let ((.cse2 (and .cse0 .cse7))) (let ((.cse1 (ite .cse2 0 .cse8)) (.cse4 (and .cse6 .cse7))) (and (= (ite (and .cse0 (not (= (mod .cse1 256) 0))) 0 v_~y$r_buff0_thd2~0_176) v_~y$r_buff0_thd2~0_175) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_67| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_67|) (= v_~y$w_buff1_used~0_445 .cse1) (= v_~y~0_399 (ite .cse2 v_~y$w_buff0~0_328 (let ((.cse3 (and (not (= (mod v_~y$r_buff1_thd0~0_287 256) 0)) (not (= (mod v_~y$w_buff1_used~0_447 256) 0))))) (ite (and (not (= (mod (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_447) 256) 0)) (not (= (mod v_~y$r_buff1_thd2~0_178 256) 0))) v_~y$w_buff1~0_274 (ite .cse5 v_~y$w_buff0~0_328 (ite .cse3 v_~y$w_buff1~0_274 1)))))) (= |v_P0Thread1of1ForFork1_~arg#1.offset_65| |v_P0Thread1of1ForFork1_#in~arg#1.offset_65|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_504 256) 0)) (not (= (mod v_~y$w_buff1_used~0_445 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_67|) (= 2 v_~y$w_buff0~0_327) (= v_~y$r_buff0_thd0~0_282 v_~y$r_buff1_thd0~0_285) (= v_~y$r_buff0_thd1~0_220 1) (= v_~y$w_buff1~0_273 v_~y$w_buff0~0_328) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_67| 0)) (= v_~y$r_buff0_thd0~0_282 (ite .cse4 0 v_~y$r_buff0_thd0~0_283)) (= v_~y$r_buff0_thd2~0_175 v_~y$r_buff1_thd2~0_177) (= |v_P0Thread1of1ForFork1_~arg#1.base_65| |v_P0Thread1of1ForFork1_#in~arg#1.base_65|) (= v_~y$r_buff0_thd1~0_221 v_~y$r_buff1_thd1~0_153) (= v_~y$w_buff0_used~0_504 1)))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_178, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_506, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_65|, ~y$w_buff1~0=v_~y$w_buff1~0_274, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_283, ~y$w_buff0~0=v_~y$w_buff0~0_328, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_221, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_176, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_65|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_287, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_447} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_504, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_65|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_65|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_65|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_65|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_177, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_153, ~y$w_buff1~0=v_~y$w_buff1~0_273, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_67|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_282, ~y$w_buff0~0=v_~y$w_buff0~0_327, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_220, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_67|, ~y~0=v_~y~0_399, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_285, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff0_thd2~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [368] L804-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~y$r_buff1_thd0~0_155 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd0~0_154 256) 0))) (let ((.cse11 (not .cse10)) (.cse2 (and .cse10 (= (mod v_~y$w_buff1_used~0_227 256) 0))) (.cse12 (= (mod v_~y$w_buff0_used~0_255 256) 0)) (.cse4 (and .cse10 .cse9))) (let ((.cse5 (or .cse2 .cse12 .cse4)) (.cse6 (and .cse11 (not .cse12)))) (let ((.cse1 (ite .cse5 v_~y~0_185 (ite .cse6 v_~y$w_buff0~0_169 v_~y$w_buff1~0_145))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse7 (= (mod v_~y$w_buff1_used~0_226 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_254 256) 0))) (and (= v_~weak$$choice0~0_47 |v_ULTIMATE.start_main_#t~nondet7#1_79|) (= v_~y$w_buff0~0_169 v_~y$w_buff0~0_168) (= (mod v_~main$tmp_guard1~0_52 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~y~0_184 (ite .cse0 v_~y$mem_tmp~0_64 .cse1)) (= 0 v_~y$flush_delayed~0_63) (= v_~y$w_buff1~0_145 v_~y$w_buff1~0_144) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (ite .cse0 v_~y$w_buff1_used~0_227 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_227 0)) v_~y$w_buff1_used~0_226) (= v_~y~0_185 v_~y$mem_tmp~0_64) (= v_~y$w_buff0_used~0_254 (ite .cse0 v_~y$w_buff0_used~0_255 (ite .cse5 v_~y$w_buff0_used~0_255 (ite .cse6 0 v_~y$w_buff0_used~0_255)))) (= v_~y$r_buff1_thd0~0_154 (ite .cse0 v_~y$r_buff1_thd0~0_155 (ite (let ((.cse8 (= (mod v_~y$r_buff0_thd0~0_153 256) 0))) (or (and .cse7 .cse8) (and .cse9 .cse8) .cse3)) v_~y$r_buff1_thd0~0_155 0))) (= (ite (= (ite (not (and (= v_~x~0_67 2) (= 2 .cse1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_52) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0) (= v_~weak$$choice2~0_64 |v_ULTIMATE.start_main_#t~nondet8#1_73|) (= v_~y$r_buff0_thd0~0_153 (ite .cse0 v_~y$r_buff0_thd0~0_154 (ite (or (and .cse7 .cse10) .cse3 .cse4) v_~y$r_buff0_thd0~0_154 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd0~0_154))))))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_255, ~y$w_buff1~0=v_~y$w_buff1~0_145, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_154, ~y$w_buff0~0=v_~y$w_buff0~0_169, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_73|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_79|, ~y~0=v_~y~0_185, ~x~0=v_~x~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_227} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_47, ~y$mem_tmp~0=v_~y$mem_tmp~0_64, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~y$w_buff1~0=v_~y$w_buff1~0_144, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_153, ~y$w_buff0~0=v_~y$w_buff0~0_168, ~y$flush_delayed~0=v_~y$flush_delayed~0_63, ~y~0=v_~y~0_184, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~x~0=v_~x~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_154, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_226} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-05 23:19:57,124 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] L763-->L773: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff0_thd0~0_287 256) 0)))) (let ((.cse6 (and .cse0 (not (= (mod v_~y$w_buff0_used~0_512 256) 0))))) (let ((.cse8 (ite .cse6 0 v_~y$w_buff0_used~0_512))) (let ((.cse4 (= (mod .cse8 256) 0))) (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_510 256) 0))) (.cse1 (not .cse4)) (.cse2 (not (= (mod v_~y$r_buff0_thd2~0_180 256) 0)))) (let ((.cse5 (and .cse1 .cse2)) (.cse7 (and .cse3 .cse2))) (and (= v_~y$r_buff0_thd0~0_286 (ite (and .cse0 .cse1) 0 v_~y$r_buff0_thd0~0_287)) (= v_~y$r_buff0_thd1~0_224 1) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_69| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_69|) (= |v_P0Thread1of1ForFork1_~arg#1.offset_67| |v_P0Thread1of1ForFork1_#in~arg#1.offset_67|) (= v_~y$w_buff0_used~0_510 (ite .cse2 0 1)) (= |v_P0Thread1of1ForFork1_~arg#1.base_67| |v_P0Thread1of1ForFork1_#in~arg#1.base_67|) (= 2 v_~y$w_buff0~0_331) (= v_~y$r_buff1_thd2~0_181 (ite (or (and .cse3 (not (= 0 (mod v_~y$r_buff0_thd2~0_179 256)))) (and (not (= (mod v_~y$w_buff1_used~0_451 256) 0)) .cse2)) 0 v_~y$r_buff0_thd2~0_180)) (= (ite .cse4 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_69|) (= v_~y$r_buff0_thd1~0_225 v_~y$r_buff1_thd1~0_155) (= v_~y~0_403 (ite .cse2 v_~y$w_buff0~0_331 (ite .cse5 v_~y$w_buff1~0_277 (ite .cse6 v_~y$w_buff0~0_332 (ite (and (not (= (mod v_~y$w_buff1_used~0_453 256) 0)) (not (= (mod v_~y$r_buff1_thd0~0_293 256) 0))) v_~y$w_buff1~0_278 1))))) (= v_~y$w_buff1~0_277 v_~y$w_buff0~0_332) (= v_~y$r_buff0_thd0~0_286 v_~y$r_buff1_thd0~0_291) (= (ite .cse7 0 v_~y$r_buff0_thd2~0_180) v_~y$r_buff0_thd2~0_179) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_69| 0)) (= (ite (or .cse5 .cse7) 0 .cse8) v_~y$w_buff1_used~0_451)))))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_512, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_67|, ~y$w_buff1~0=v_~y$w_buff1~0_278, ~y$w_buff0~0=v_~y$w_buff0~0_332, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_287, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_180, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_225, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_67|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_293, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_453} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_510, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_67|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_67|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_67|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_67|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_181, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_155, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$w_buff0~0=v_~y$w_buff0~0_331, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_69|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_286, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_179, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_224, ~y~0=v_~y~0_403, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_69|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_291, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_451} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, ~y$r_buff0_thd1~0, ~y~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [368] L804-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~y$r_buff1_thd0~0_155 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd0~0_154 256) 0))) (let ((.cse11 (not .cse10)) (.cse2 (and .cse10 (= (mod v_~y$w_buff1_used~0_227 256) 0))) (.cse12 (= (mod v_~y$w_buff0_used~0_255 256) 0)) (.cse4 (and .cse10 .cse9))) (let ((.cse5 (or .cse2 .cse12 .cse4)) (.cse6 (and .cse11 (not .cse12)))) (let ((.cse1 (ite .cse5 v_~y~0_185 (ite .cse6 v_~y$w_buff0~0_169 v_~y$w_buff1~0_145))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse7 (= (mod v_~y$w_buff1_used~0_226 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_254 256) 0))) (and (= v_~weak$$choice0~0_47 |v_ULTIMATE.start_main_#t~nondet7#1_79|) (= v_~y$w_buff0~0_169 v_~y$w_buff0~0_168) (= (mod v_~main$tmp_guard1~0_52 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~y~0_184 (ite .cse0 v_~y$mem_tmp~0_64 .cse1)) (= 0 v_~y$flush_delayed~0_63) (= v_~y$w_buff1~0_145 v_~y$w_buff1~0_144) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (ite .cse0 v_~y$w_buff1_used~0_227 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_227 0)) v_~y$w_buff1_used~0_226) (= v_~y~0_185 v_~y$mem_tmp~0_64) (= v_~y$w_buff0_used~0_254 (ite .cse0 v_~y$w_buff0_used~0_255 (ite .cse5 v_~y$w_buff0_used~0_255 (ite .cse6 0 v_~y$w_buff0_used~0_255)))) (= v_~y$r_buff1_thd0~0_154 (ite .cse0 v_~y$r_buff1_thd0~0_155 (ite (let ((.cse8 (= (mod v_~y$r_buff0_thd0~0_153 256) 0))) (or (and .cse7 .cse8) (and .cse9 .cse8) .cse3)) v_~y$r_buff1_thd0~0_155 0))) (= (ite (= (ite (not (and (= v_~x~0_67 2) (= 2 .cse1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_52) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0) (= v_~weak$$choice2~0_64 |v_ULTIMATE.start_main_#t~nondet8#1_73|) (= v_~y$r_buff0_thd0~0_153 (ite .cse0 v_~y$r_buff0_thd0~0_154 (ite (or (and .cse7 .cse10) .cse3 .cse4) v_~y$r_buff0_thd0~0_154 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd0~0_154))))))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_255, ~y$w_buff1~0=v_~y$w_buff1~0_145, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_154, ~y$w_buff0~0=v_~y$w_buff0~0_169, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_73|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_79|, ~y~0=v_~y~0_185, ~x~0=v_~x~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_227} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_47, ~y$mem_tmp~0=v_~y$mem_tmp~0_64, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~y$w_buff1~0=v_~y$w_buff1~0_144, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_153, ~y$w_buff0~0=v_~y$w_buff0~0_168, ~y$flush_delayed~0=v_~y$flush_delayed~0_63, ~y~0=v_~y~0_184, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~x~0=v_~x~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_154, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_226} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-05 23:19:57,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L2-1-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_167 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd0~0_82 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_84 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_168 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_143 256) 0)) .cse3)) (.cse4 (and .cse5 .cse2))) (and (= v_~y$w_buff0_used~0_167 (ite .cse0 0 v_~y$w_buff0_used~0_168)) (= v_~y~0_98 (ite .cse0 v_~y$w_buff0~0_102 (ite .cse1 v_~y$w_buff1~0_81 v_~y~0_99))) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_83 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_142 256) 0)) .cse3)) 0 v_~y$r_buff1_thd0~0_82) v_~y$r_buff1_thd0~0_81) (= (ite (or .cse1 .cse4) 0 v_~y$w_buff1_used~0_143) v_~y$w_buff1_used~0_142) (= v_~y$r_buff0_thd0~0_83 (ite .cse4 0 v_~y$r_buff0_thd0~0_84))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_168, ~y$w_buff1~0=v_~y$w_buff1~0_81, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_84, ~y$w_buff0~0=v_~y$w_buff0~0_102, ~y~0=v_~y~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_143} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_167, ~y$w_buff1~0=v_~y$w_buff1~0_81, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_102, ~y~0=v_~y~0_98, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_81, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_142} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [320] $Ultimate##0-->L743: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd1~0_46 1) (= v_~y$r_buff0_thd2~0_35 v_~y$r_buff1_thd2~0_33) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd0~0_81 v_~y$r_buff1_thd0~0_79) (= v_~y$w_buff0_used~0_163 1) (= v_~y$w_buff0~0_99 v_~y$w_buff1~0_79) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= 2 v_~y$w_buff0~0_98) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_140) (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff1_thd1~0_35) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_140 256) 0)) (not (= (mod v_~y$w_buff0_used~0_163 256) 0)))) 1 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, ~y$w_buff0~0=v_~y$w_buff0~0_99, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_35, ~y$w_buff1~0=v_~y$w_buff1~0_79, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, ~y$w_buff0~0=v_~y$w_buff0~0_98, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_140} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$w_buff1_used~0] [2022-12-05 23:19:57,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:19:57,872 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 7 out of bounds for length 7 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) 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) [2022-12-05 23:19:57,875 INFO L158 Benchmark]: Toolchain (without parser) took 17767.42ms. Allocated memory was 181.4MB in the beginning and 520.1MB in the end (delta: 338.7MB). Free memory was 156.4MB in the beginning and 213.9MB in the end (delta: -57.5MB). Peak memory consumption was 318.8MB. Max. memory is 8.0GB. [2022-12-05 23:19:57,875 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 158.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:19:57,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.86ms. Allocated memory is still 181.4MB. Free memory was 156.2MB in the beginning and 131.5MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-05 23:19:57,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.23ms. Allocated memory is still 181.4MB. Free memory was 131.5MB in the beginning and 128.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:19:57,875 INFO L158 Benchmark]: Boogie Preprocessor took 55.23ms. Allocated memory is still 181.4MB. Free memory was 128.9MB in the beginning and 126.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:19:57,876 INFO L158 Benchmark]: RCFGBuilder took 564.57ms. Allocated memory is still 181.4MB. Free memory was 126.8MB in the beginning and 95.9MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-05 23:19:57,876 INFO L158 Benchmark]: TraceAbstraction took 16487.93ms. Allocated memory was 181.4MB in the beginning and 520.1MB in the end (delta: 338.7MB). Free memory was 95.4MB in the beginning and 213.9MB in the end (delta: -118.5MB). Peak memory consumption was 257.9MB. Max. memory is 8.0GB. [2022-12-05 23:19:57,877 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.12ms. Allocated memory is still 181.4MB. Free memory is still 158.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 586.86ms. Allocated memory is still 181.4MB. Free memory was 156.2MB in the beginning and 131.5MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.23ms. Allocated memory is still 181.4MB. Free memory was 131.5MB in the beginning and 128.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.23ms. Allocated memory is still 181.4MB. Free memory was 128.9MB in the beginning and 126.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 564.57ms. Allocated memory is still 181.4MB. Free memory was 126.8MB in the beginning and 95.9MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 16487.93ms. Allocated memory was 181.4MB in the beginning and 520.1MB in the end (delta: 338.7MB). Free memory was 95.4MB in the beginning and 213.9MB in the end (delta: -118.5MB). Peak memory consumption was 257.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 89 PlacesBefore, 27 PlacesAfterwards, 84 TransitionsBefore, 21 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 33 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 906, independent: 865, independent conditional: 865, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 906, independent: 865, independent conditional: 0, independent unconditional: 865, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 906, independent: 865, independent conditional: 0, independent unconditional: 865, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 906, independent: 865, independent conditional: 0, independent unconditional: 865, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 674, independent: 645, independent conditional: 0, independent unconditional: 645, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 674, independent: 635, independent conditional: 0, independent unconditional: 635, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 906, independent: 220, independent conditional: 0, independent unconditional: 220, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 674, unknown conditional: 0, unknown unconditional: 674] , Statistics on independence cache: Total cache size (in pairs): 1050, Positive cache size: 1021, Positive conditional cache size: 0, Positive unconditional cache size: 1021, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 10, independent unconditional: 24, dependent: 16, dependent conditional: 6, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 34, independent conditional: 10, independent unconditional: 24, dependent: 16, dependent conditional: 6, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 10, independent unconditional: 24, dependent: 16, dependent conditional: 6, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 31, independent conditional: 9, independent unconditional: 22, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 32, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 42, unknown conditional: 14, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 31, Positive conditional cache size: 9, Positive unconditional cache size: 22, Negative cache size: 11, Negative conditional cache size: 5, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 23 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 51, independent: 38, independent conditional: 2, independent unconditional: 36, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 43, Positive conditional cache size: 9, Positive unconditional cache size: 34, Negative cache size: 15, Negative conditional cache size: 5, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 25 PlacesBefore, 25 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 47, Positive conditional cache size: 9, Positive unconditional cache size: 38, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 13, independent unconditional: 13, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 26, independent conditional: 7, independent unconditional: 19, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 7, independent unconditional: 19, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 23, independent conditional: 5, independent unconditional: 18, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 50, Positive conditional cache size: 11, Positive unconditional cache size: 39, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 21, independent conditional: 12, independent unconditional: 9, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 21, independent conditional: 5, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 21, independent conditional: 5, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 21, independent conditional: 5, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 50, Positive conditional cache size: 11, Positive unconditional cache size: 39, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 18, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 51, Positive conditional cache size: 11, Positive unconditional cache size: 40, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 87, independent: 75, independent conditional: 40, independent unconditional: 35, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, independent: 75, independent conditional: 20, independent unconditional: 55, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 87, independent: 75, independent conditional: 20, independent unconditional: 55, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, independent: 75, independent conditional: 20, independent unconditional: 55, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 51, Positive conditional cache size: 11, Positive unconditional cache size: 40, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 82, independent: 68, independent conditional: 32, independent unconditional: 36, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 68, independent conditional: 14, independent unconditional: 54, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 68, independent conditional: 14, independent unconditional: 54, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 82, independent: 67, independent conditional: 13, independent unconditional: 54, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 52, Positive conditional cache size: 12, Positive unconditional cache size: 40, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 49 PlacesBefore, 47 PlacesAfterwards, 46 TransitionsBefore, 44 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 319, independent: 262, independent conditional: 262, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 319, independent: 262, independent conditional: 131, independent unconditional: 131, dependent: 57, dependent conditional: 6, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 325, independent: 262, independent conditional: 56, independent unconditional: 206, dependent: 63, dependent conditional: 12, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 325, independent: 262, independent conditional: 56, independent unconditional: 206, dependent: 63, dependent conditional: 12, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 325, independent: 259, independent conditional: 55, independent unconditional: 204, dependent: 61, dependent conditional: 10, dependent unconditional: 51, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 56, Positive conditional cache size: 13, Positive unconditional cache size: 43, Negative cache size: 22, Negative conditional cache size: 7, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 75, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 49 PlacesBefore, 47 PlacesAfterwards, 45 TransitionsBefore, 43 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 237, independent: 201, independent conditional: 201, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 237, independent: 201, independent conditional: 112, independent unconditional: 89, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 239, independent: 201, independent conditional: 58, independent unconditional: 143, dependent: 38, dependent conditional: 2, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 239, independent: 201, independent conditional: 58, independent unconditional: 143, dependent: 38, dependent conditional: 2, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 239, independent: 198, independent conditional: 55, independent unconditional: 143, dependent: 38, dependent conditional: 2, dependent unconditional: 36, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 59, Positive conditional cache size: 16, Positive unconditional cache size: 43, Negative cache size: 22, Negative conditional cache size: 7, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 122, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 122, independent: 105, independent conditional: 53, independent unconditional: 52, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 122, independent: 105, independent conditional: 29, independent unconditional: 76, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 122, independent: 105, independent conditional: 29, independent unconditional: 76, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, independent: 104, independent conditional: 28, independent unconditional: 76, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 60, Positive conditional cache size: 17, Positive unconditional cache size: 43, Negative cache size: 22, Negative conditional cache size: 7, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 7 out of bounds for length 7 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 7 out of bounds for length 7: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-05 23:19:57,906 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...