/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:07:33,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:07:33,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:07:33,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:07:33,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:07:33,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:07:33,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:07:33,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:07:33,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:07:33,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:07:33,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:07:33,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:07:33,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:07:33,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:07:33,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:07:33,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:07:33,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:07:33,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:07:33,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:07:33,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:07:33,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:07:33,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:07:33,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:07:33,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:07:33,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:07:33,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:07:33,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:07:33,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:07:33,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:07:33,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:07:33,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:07:33,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:07:33,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:07:33,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:07:33,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:07:33,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:07:33,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:07:33,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:07:33,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:07:33,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:07:33,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:07:33,907 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:07:33,932 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:07:33,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:07:33,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:07:33,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:07:33,934 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:07:33,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:07:33,935 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:07:33,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:07:33,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:07:33,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:07:33,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:07:33,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:07:33,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:07:33,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:07:33,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:07:33,936 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:07:33,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:07:33,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:07:33,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:07:33,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:07:33,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:07:33,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:07:33,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:07:33,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:07:33,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:07:33,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:07:33,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:07:33,937 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:07:33,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:07:34,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:07:34,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:07:34,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:07:34,210 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:07:34,210 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:07:34,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2022-12-06 05:07:35,139 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:07:35,314 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:07:35,315 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2022-12-06 05:07:35,326 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041495cdc/b2182dce08db4107b177bd460cd5d2df/FLAGe681e03c4 [2022-12-06 05:07:35,339 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041495cdc/b2182dce08db4107b177bd460cd5d2df [2022-12-06 05:07:35,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:07:35,342 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:07:35,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:07:35,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:07:35,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:07:35,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:07:35" (1/1) ... [2022-12-06 05:07:35,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b990ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:35, skipping insertion in model container [2022-12-06 05:07:35,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:07:35" (1/1) ... [2022-12-06 05:07:35,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:07:35,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:07:35,528 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c[3945,3958] [2022-12-06 05:07:35,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:07:35,554 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:07:35,582 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c[3945,3958] [2022-12-06 05:07:35,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:07:35,595 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:07:35,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:35 WrapperNode [2022-12-06 05:07:35,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:07:35,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:07:35,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:07:35,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:07:35,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:35" (1/1) ... [2022-12-06 05:07:35,607 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:35" (1/1) ... [2022-12-06 05:07:35,629 INFO L138 Inliner]: procedures = 27, calls = 66, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 413 [2022-12-06 05:07:35,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:07:35,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:07:35,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:07:35,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:07:35,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:35" (1/1) ... [2022-12-06 05:07:35,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:35" (1/1) ... [2022-12-06 05:07:35,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:35" (1/1) ... [2022-12-06 05:07:35,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:35" (1/1) ... [2022-12-06 05:07:35,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:35" (1/1) ... [2022-12-06 05:07:35,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:35" (1/1) ... [2022-12-06 05:07:35,659 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:35" (1/1) ... [2022-12-06 05:07:35,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:35" (1/1) ... [2022-12-06 05:07:35,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:07:35,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:07:35,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:07:35,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:07:35,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:35" (1/1) ... [2022-12-06 05:07:35,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:07:35,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:07:35,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:07:35,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:07:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:07:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:07:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:07:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:07:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:07:35,728 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:07:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:07:35,728 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:07:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:07:35,728 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:07:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:07:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:07:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:07:35,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:07:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:07:35,729 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:07:35,837 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:07:35,839 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:07:36,312 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:07:36,326 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:07:36,327 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:07:36,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:07:36 BoogieIcfgContainer [2022-12-06 05:07:36,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:07:36,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:07:36,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:07:36,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:07:36,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:07:35" (1/3) ... [2022-12-06 05:07:36,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b1194e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:07:36, skipping insertion in model container [2022-12-06 05:07:36,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:35" (2/3) ... [2022-12-06 05:07:36,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b1194e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:07:36, skipping insertion in model container [2022-12-06 05:07:36,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:07:36" (3/3) ... [2022-12-06 05:07:36,334 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2022-12-06 05:07:36,346 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:07:36,346 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:07:36,346 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:07:36,411 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:07:36,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 452 places, 483 transitions, 990 flow [2022-12-06 05:07:36,595 INFO L130 PetriNetUnfolder]: 41/480 cut-off events. [2022-12-06 05:07:36,595 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:07:36,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 480 events. 41/480 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 632 event pairs, 0 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 406. Up to 2 conditions per place. [2022-12-06 05:07:36,602 INFO L82 GeneralOperation]: Start removeDead. Operand has 452 places, 483 transitions, 990 flow [2022-12-06 05:07:36,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 439 places, 470 transitions, 958 flow [2022-12-06 05:07:36,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:36,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 439 places, 470 transitions, 958 flow [2022-12-06 05:07:36,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 439 places, 470 transitions, 958 flow [2022-12-06 05:07:36,689 INFO L130 PetriNetUnfolder]: 41/470 cut-off events. [2022-12-06 05:07:36,690 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:07:36,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 470 events. 41/470 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 630 event pairs, 0 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 406. Up to 2 conditions per place. [2022-12-06 05:07:36,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 439 places, 470 transitions, 958 flow [2022-12-06 05:07:36,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 17280 [2022-12-06 05:07:52,412 INFO L203 LiptonReduction]: Total number of compositions: 429 [2022-12-06 05:07:52,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:07:52,426 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;@65d54791, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:07:52,426 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:07:52,432 INFO L130 PetriNetUnfolder]: 10/41 cut-off events. [2022-12-06 05:07:52,432 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:07:52,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:52,433 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:52,433 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:07:52,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:52,437 INFO L85 PathProgramCache]: Analyzing trace with hash -237819189, now seen corresponding path program 1 times [2022-12-06 05:07:52,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:52,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399828274] [2022-12-06 05:07:52,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:52,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:52,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:52,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399828274] [2022-12-06 05:07:52,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399828274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:52,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:52,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:07:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595503272] [2022-12-06 05:07:52,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:52,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:07:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:52,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:07:52,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:07:52,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:07:52,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:52,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:52,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:07:52,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:52,955 INFO L130 PetriNetUnfolder]: 727/1071 cut-off events. [2022-12-06 05:07:52,955 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-06 05:07:52,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 1071 events. 727/1071 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4030 event pairs, 405 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 2079. Up to 795 conditions per place. [2022-12-06 05:07:52,961 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 52 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2022-12-06 05:07:52,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 246 flow [2022-12-06 05:07:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:07:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:07:52,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 05:07:52,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2022-12-06 05:07:52,972 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 102 flow. Second operand 3 states and 59 transitions. [2022-12-06 05:07:52,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 246 flow [2022-12-06 05:07:52,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 230 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:07:52,978 INFO L231 Difference]: Finished difference. Result has 40 places, 43 transitions, 108 flow [2022-12-06 05:07:52,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=43} [2022-12-06 05:07:52,983 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-06 05:07:52,983 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:52,984 INFO L89 Accepts]: Start accepts. Operand has 40 places, 43 transitions, 108 flow [2022-12-06 05:07:52,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:52,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:52,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 43 transitions, 108 flow [2022-12-06 05:07:52,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 43 transitions, 108 flow [2022-12-06 05:07:52,994 INFO L130 PetriNetUnfolder]: 10/43 cut-off events. [2022-12-06 05:07:52,994 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:07:52,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 43 events. 10/43 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 37. Up to 3 conditions per place. [2022-12-06 05:07:52,995 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 43 transitions, 108 flow [2022-12-06 05:07:52,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 05:07:53,030 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:07:53,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 05:07:53,031 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 43 transitions, 108 flow [2022-12-06 05:07:53,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:53,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:53,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:53,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:07:53,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:07:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2107721905, now seen corresponding path program 1 times [2022-12-06 05:07:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:53,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451178212] [2022-12-06 05:07:53,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:53,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:53,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:53,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451178212] [2022-12-06 05:07:53,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451178212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:53,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:53,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:07:53,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614066254] [2022-12-06 05:07:53,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:53,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:07:53,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:53,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:07:53,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:07:53,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:07:53,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 43 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:53,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:53,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:07:53,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:53,345 INFO L130 PetriNetUnfolder]: 835/1231 cut-off events. [2022-12-06 05:07:53,346 INFO L131 PetriNetUnfolder]: For 450/450 co-relation queries the response was YES. [2022-12-06 05:07:53,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2880 conditions, 1231 events. 835/1231 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4580 event pairs, 445 based on Foata normal form. 0/1116 useless extension candidates. Maximal degree in co-relation 1476. Up to 857 conditions per place. [2022-12-06 05:07:53,352 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 55 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2022-12-06 05:07:53,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 274 flow [2022-12-06 05:07:53,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:07:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:07:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 05:07:53,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 05:07:53,354 INFO L175 Difference]: Start difference. First operand has 40 places, 43 transitions, 108 flow. Second operand 3 states and 60 transitions. [2022-12-06 05:07:53,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 274 flow [2022-12-06 05:07:53,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:07:53,357 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 120 flow [2022-12-06 05:07:53,357 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2022-12-06 05:07:53,357 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 05:07:53,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:53,358 INFO L89 Accepts]: Start accepts. Operand has 42 places, 44 transitions, 120 flow [2022-12-06 05:07:53,360 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:53,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:53,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 44 transitions, 120 flow [2022-12-06 05:07:53,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 44 transitions, 120 flow [2022-12-06 05:07:53,366 INFO L130 PetriNetUnfolder]: 10/44 cut-off events. [2022-12-06 05:07:53,366 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:07:53,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 44 events. 10/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2022-12-06 05:07:53,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 44 transitions, 120 flow [2022-12-06 05:07:53,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 05:07:53,367 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:07:53,369 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:07:53,369 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 120 flow [2022-12-06 05:07:53,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:53,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:53,369 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:53,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:07:53,370 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:07:53,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:53,370 INFO L85 PathProgramCache]: Analyzing trace with hash 865441644, now seen corresponding path program 1 times [2022-12-06 05:07:53,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:53,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068406627] [2022-12-06 05:07:53,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:53,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:53,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:53,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068406627] [2022-12-06 05:07:53,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068406627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:53,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:53,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:07:53,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304209613] [2022-12-06 05:07:53,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:53,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:07:53,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:53,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:07:53,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:07:53,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:07:53,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:53,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:53,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:07:53,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:53,740 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-06 05:07:53,740 INFO L131 PetriNetUnfolder]: For 398/398 co-relation queries the response was YES. [2022-12-06 05:07:53,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3167 conditions, 1232 events. 835/1232 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4559 event pairs, 637 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 1604. Up to 1229 conditions per place. [2022-12-06 05:07:53,745 INFO L137 encePairwiseOnDemand]: 39/42 looper letters, 42 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-12-06 05:07:53,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 210 flow [2022-12-06 05:07:53,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:07:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:07:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 05:07:53,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2022-12-06 05:07:53,748 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 120 flow. Second operand 3 states and 46 transitions. [2022-12-06 05:07:53,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 210 flow [2022-12-06 05:07:53,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:07:53,751 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 126 flow [2022-12-06 05:07:53,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2022-12-06 05:07:53,752 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2022-12-06 05:07:53,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:53,752 INFO L89 Accepts]: Start accepts. Operand has 43 places, 45 transitions, 126 flow [2022-12-06 05:07:53,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:53,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:53,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 45 transitions, 126 flow [2022-12-06 05:07:53,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 45 transitions, 126 flow [2022-12-06 05:07:53,759 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 05:07:53,759 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:07:53,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 45 events. 10/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2022-12-06 05:07:53,759 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 45 transitions, 126 flow [2022-12-06 05:07:53,759 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 05:07:55,739 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:55,740 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1988 [2022-12-06 05:07:55,740 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 122 flow [2022-12-06 05:07:55,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:55,740 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:55,740 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:55,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:07:55,740 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:07:55,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash 933338406, now seen corresponding path program 1 times [2022-12-06 05:07:55,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:55,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177324338] [2022-12-06 05:07:55,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:55,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:55,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:55,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177324338] [2022-12-06 05:07:55,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177324338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:55,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:55,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:07:55,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042734594] [2022-12-06 05:07:55,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:55,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:07:55,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:55,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:07:55,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:07:55,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:07:55,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:55,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:55,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:07:55,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:56,023 INFO L130 PetriNetUnfolder]: 943/1389 cut-off events. [2022-12-06 05:07:56,027 INFO L131 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2022-12-06 05:07:56,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 1389 events. 943/1389 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5044 event pairs, 733 based on Foata normal form. 0/1281 useless extension candidates. Maximal degree in co-relation 3361. Up to 1388 conditions per place. [2022-12-06 05:07:56,033 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 42 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-06 05:07:56,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 214 flow [2022-12-06 05:07:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:07:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:07:56,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 05:07:56,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2022-12-06 05:07:56,034 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 122 flow. Second operand 4 states and 44 transitions. [2022-12-06 05:07:56,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 214 flow [2022-12-06 05:07:56,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 206 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:07:56,037 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:56,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-06 05:07:56,038 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 05:07:56,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:56,039 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:56,039 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:56,039 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:56,039 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:56,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:56,044 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 05:07:56,044 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:07:56,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2022-12-06 05:07:56,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:56,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 05:07:56,285 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:56,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-06 05:07:56,286 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 124 flow [2022-12-06 05:07:56,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:56,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:56,286 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:56,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:07:56,287 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:07:56,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1710610303, now seen corresponding path program 1 times [2022-12-06 05:07:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:56,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092475120] [2022-12-06 05:07:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:56,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:56,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:56,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092475120] [2022-12-06 05:07:56,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092475120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:56,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:56,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:07:56,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637582801] [2022-12-06 05:07:56,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:56,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:07:56,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:56,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:07:56,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:07:56,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:07:56,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:56,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:56,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:07:56,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:56,576 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-06 05:07:56,576 INFO L131 PetriNetUnfolder]: For 229/229 co-relation queries the response was YES. [2022-12-06 05:07:56,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 1232 events. 835/1232 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4553 event pairs, 637 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 3002. Up to 1228 conditions per place. [2022-12-06 05:07:56,582 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-06 05:07:56,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 214 flow [2022-12-06 05:07:56,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:07:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:07:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 05:07:56,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-06 05:07:56,585 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 124 flow. Second operand 4 states and 47 transitions. [2022-12-06 05:07:56,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 214 flow [2022-12-06 05:07:56,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:07:56,586 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:56,586 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-06 05:07:56,588 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 05:07:56,589 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:56,589 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:56,591 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:56,591 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:56,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:56,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:56,596 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 05:07:56,596 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:07:56,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2022-12-06 05:07:56,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:56,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 05:07:56,830 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:56,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-06 05:07:56,831 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 124 flow [2022-12-06 05:07:56,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:56,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:56,831 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:56,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:07:56,832 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:07:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash -174693395, now seen corresponding path program 1 times [2022-12-06 05:07:56,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:56,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909959727] [2022-12-06 05:07:56,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:56,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:56,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:56,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909959727] [2022-12-06 05:07:56,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909959727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:56,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:56,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:07:56,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322346904] [2022-12-06 05:07:56,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:56,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:07:56,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:56,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:07:56,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:07:56,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:07:56,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:56,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:56,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:07:56,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:57,110 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-06 05:07:57,110 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-06 05:07:57,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 1232 events. 835/1232 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4553 event pairs, 637 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 2998. Up to 1228 conditions per place. [2022-12-06 05:07:57,115 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-06 05:07:57,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 214 flow [2022-12-06 05:07:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:07:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:07:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 05:07:57,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-06 05:07:57,116 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 124 flow. Second operand 4 states and 47 transitions. [2022-12-06 05:07:57,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 214 flow [2022-12-06 05:07:57,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:07:57,118 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:57,118 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-06 05:07:57,118 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 05:07:57,118 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:57,118 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:57,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:57,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:57,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:57,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:57,124 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 05:07:57,124 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:07:57,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 52. Up to 4 conditions per place. [2022-12-06 05:07:57,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:57,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 05:07:57,349 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:57,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 05:07:57,350 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 124 flow [2022-12-06 05:07:57,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:57,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:57,350 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:57,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:07:57,350 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:07:57,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:57,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1300023411, now seen corresponding path program 1 times [2022-12-06 05:07:57,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:57,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669151623] [2022-12-06 05:07:57,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:57,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:57,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:57,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669151623] [2022-12-06 05:07:57,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669151623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:57,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:57,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:07:57,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523181574] [2022-12-06 05:07:57,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:57,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:07:57,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:57,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:07:57,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:07:57,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:07:57,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:57,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:57,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:07:57,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:57,719 INFO L130 PetriNetUnfolder]: 943/1389 cut-off events. [2022-12-06 05:07:57,719 INFO L131 PetriNetUnfolder]: For 237/237 co-relation queries the response was YES. [2022-12-06 05:07:57,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3372 conditions, 1389 events. 943/1389 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5044 event pairs, 733 based on Foata normal form. 0/1282 useless extension candidates. Maximal degree in co-relation 3349. Up to 1386 conditions per place. [2022-12-06 05:07:57,723 INFO L137 encePairwiseOnDemand]: 36/42 looper letters, 40 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2022-12-06 05:07:57,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 216 flow [2022-12-06 05:07:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:07:57,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:07:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 05:07:57,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20952380952380953 [2022-12-06 05:07:57,724 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 124 flow. Second operand 5 states and 44 transitions. [2022-12-06 05:07:57,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 216 flow [2022-12-06 05:07:57,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 206 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:07:57,726 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 132 flow [2022-12-06 05:07:57,726 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2022-12-06 05:07:57,727 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2022-12-06 05:07:57,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:57,727 INFO L89 Accepts]: Start accepts. Operand has 45 places, 45 transitions, 132 flow [2022-12-06 05:07:57,727 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:57,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:57,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 45 transitions, 132 flow [2022-12-06 05:07:57,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 45 transitions, 132 flow [2022-12-06 05:07:57,732 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 05:07:57,732 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:07:57,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 52. Up to 4 conditions per place. [2022-12-06 05:07:57,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 45 transitions, 132 flow [2022-12-06 05:07:57,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 05:07:57,911 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:57,911 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:07:57,911 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 128 flow [2022-12-06 05:07:57,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:57,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:57,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:57,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:07:57,912 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:07:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:57,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1330035469, now seen corresponding path program 1 times [2022-12-06 05:07:57,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:57,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160959628] [2022-12-06 05:07:57,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:57,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:58,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:58,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160959628] [2022-12-06 05:07:58,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160959628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:58,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:58,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:07:58,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034059355] [2022-12-06 05:07:58,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:58,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:07:58,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:58,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:07:58,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:07:58,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:07:58,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:58,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:58,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:07:58,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:58,222 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-06 05:07:58,222 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-06 05:07:58,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1232 events. 835/1232 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4553 event pairs, 637 based on Foata normal form. 0/1128 useless extension candidates. Maximal degree in co-relation 2990. Up to 1228 conditions per place. [2022-12-06 05:07:58,227 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-06 05:07:58,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 218 flow [2022-12-06 05:07:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:07:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:07:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 05:07:58,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-06 05:07:58,228 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 128 flow. Second operand 4 states and 47 transitions. [2022-12-06 05:07:58,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 218 flow [2022-12-06 05:07:58,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 05:07:58,229 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:58,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-06 05:07:58,230 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 05:07:58,230 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:58,230 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:58,230 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:58,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:58,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:58,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:58,236 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 05:07:58,237 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:07:58,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 50. Up to 4 conditions per place. [2022-12-06 05:07:58,237 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 05:07:58,237 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 05:07:58,429 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:07:58,430 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 05:07:58,430 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 124 flow [2022-12-06 05:07:58,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:58,430 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:58,430 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:58,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:07:58,430 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:07:58,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:58,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1717374927, now seen corresponding path program 1 times [2022-12-06 05:07:58,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:58,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544983162] [2022-12-06 05:07:58,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:58,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:59,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:59,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:59,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544983162] [2022-12-06 05:07:59,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544983162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:59,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:59,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 05:07:59,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991954205] [2022-12-06 05:07:59,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:59,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:07:59,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:59,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:07:59,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:07:59,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:07:59,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 124 flow. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:59,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:59,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:07:59,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:59,735 INFO L130 PetriNetUnfolder]: 1472/2269 cut-off events. [2022-12-06 05:07:59,736 INFO L131 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2022-12-06 05:07:59,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5518 conditions, 2269 events. 1472/2269 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10344 event pairs, 717 based on Foata normal form. 1/2123 useless extension candidates. Maximal degree in co-relation 5487. Up to 1333 conditions per place. [2022-12-06 05:07:59,744 INFO L137 encePairwiseOnDemand]: 31/42 looper letters, 106 selfloop transitions, 11 changer transitions 13/130 dead transitions. [2022-12-06 05:07:59,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 130 transitions, 623 flow [2022-12-06 05:07:59,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:07:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:07:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2022-12-06 05:07:59,746 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2976190476190476 [2022-12-06 05:07:59,746 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 124 flow. Second operand 10 states and 125 transitions. [2022-12-06 05:07:59,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 130 transitions, 623 flow [2022-12-06 05:07:59,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 130 transitions, 614 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 05:07:59,751 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 191 flow [2022-12-06 05:07:59,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=191, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-12-06 05:07:59,752 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-06 05:07:59,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:59,752 INFO L89 Accepts]: Start accepts. Operand has 56 places, 52 transitions, 191 flow [2022-12-06 05:07:59,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:59,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:59,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 52 transitions, 191 flow [2022-12-06 05:07:59,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 191 flow [2022-12-06 05:07:59,764 INFO L130 PetriNetUnfolder]: 19/116 cut-off events. [2022-12-06 05:07:59,764 INFO L131 PetriNetUnfolder]: For 18/20 co-relation queries the response was YES. [2022-12-06 05:07:59,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 116 events. 19/116 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 458 event pairs, 0 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 213. Up to 15 conditions per place. [2022-12-06 05:07:59,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 191 flow [2022-12-06 05:07:59,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-06 05:07:59,770 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 05:07:59,873 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1666] L101-4-->L102-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre48#1_41|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre48#1_41|)) |v_#memory_int_250|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_41|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_9|, #memory_int=|v_#memory_int_250|, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1] [2022-12-06 05:08:00,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1309] L52-6-->L52-10: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_17|) (= (select (select |v_#memory_int_46| v_~get_2~0.base_9) (+ v_~get_2~0.offset_9 (* 4 v_~id_0~0_15))) |v_thread1Thread1of1ForFork1_#t~mem6#1_9|)) InVars {~get_2~0.offset=v_~get_2~0.offset_9, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} OutVars{~get_2~0.offset=v_~get_2~0.offset_9, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_9|, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem6#1] and [1666] L101-4-->L102-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre48#1_41|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre48#1_41|)) |v_#memory_int_250|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_41|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_9|, #memory_int=|v_#memory_int_250|, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1] [2022-12-06 05:08:00,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1309] L52-6-->L52-10: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_17|) (= (select (select |v_#memory_int_46| v_~get_2~0.base_9) (+ v_~get_2~0.offset_9 (* 4 v_~id_0~0_15))) |v_thread1Thread1of1ForFork1_#t~mem6#1_9|)) InVars {~get_2~0.offset=v_~get_2~0.offset_9, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} OutVars{~get_2~0.offset=v_~get_2~0.offset_9, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_9|, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem6#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 05:08:00,400 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:08:00,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 649 [2022-12-06 05:08:00,401 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 209 flow [2022-12-06 05:08:00,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:00,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:00,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:00,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:08:00,402 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:00,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1440331023, now seen corresponding path program 1 times [2022-12-06 05:08:00,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:00,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417890259] [2022-12-06 05:08:00,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:00,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:00,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:00,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417890259] [2022-12-06 05:08:00,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417890259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:00,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:00,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:08:00,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275007505] [2022-12-06 05:08:00,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:00,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:08:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:00,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:08:00,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:08:00,867 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:08:00,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 209 flow. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:00,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:00,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:08:00,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:01,461 INFO L130 PetriNetUnfolder]: 2095/3284 cut-off events. [2022-12-06 05:08:01,461 INFO L131 PetriNetUnfolder]: For 3268/3268 co-relation queries the response was YES. [2022-12-06 05:08:01,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9582 conditions, 3284 events. 2095/3284 cut-off events. For 3268/3268 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17114 event pairs, 416 based on Foata normal form. 1/3149 useless extension candidates. Maximal degree in co-relation 9546. Up to 1226 conditions per place. [2022-12-06 05:08:01,476 INFO L137 encePairwiseOnDemand]: 36/47 looper letters, 134 selfloop transitions, 22 changer transitions 9/165 dead transitions. [2022-12-06 05:08:01,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 165 transitions, 962 flow [2022-12-06 05:08:01,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:08:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:08:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2022-12-06 05:08:01,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4122340425531915 [2022-12-06 05:08:01,477 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 209 flow. Second operand 8 states and 155 transitions. [2022-12-06 05:08:01,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 165 transitions, 962 flow [2022-12-06 05:08:01,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 165 transitions, 943 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 05:08:01,487 INFO L231 Difference]: Finished difference. Result has 62 places, 72 transitions, 404 flow [2022-12-06 05:08:01,487 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=404, PETRI_PLACES=62, PETRI_TRANSITIONS=72} [2022-12-06 05:08:01,488 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2022-12-06 05:08:01,488 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:01,488 INFO L89 Accepts]: Start accepts. Operand has 62 places, 72 transitions, 404 flow [2022-12-06 05:08:01,489 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:01,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:01,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 72 transitions, 404 flow [2022-12-06 05:08:01,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 72 transitions, 404 flow [2022-12-06 05:08:01,515 INFO L130 PetriNetUnfolder]: 74/334 cut-off events. [2022-12-06 05:08:01,515 INFO L131 PetriNetUnfolder]: For 419/456 co-relation queries the response was YES. [2022-12-06 05:08:01,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 334 events. 74/334 cut-off events. For 419/456 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2165 event pairs, 2 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 843. Up to 43 conditions per place. [2022-12-06 05:08:01,517 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 72 transitions, 404 flow [2022-12-06 05:08:01,517 INFO L188 LiptonReduction]: Number of co-enabled transitions 738 [2022-12-06 05:08:01,526 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:01,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 05:08:01,527 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 72 transitions, 404 flow [2022-12-06 05:08:01,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:01,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:01,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:01,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:08:01,528 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:01,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash -886988291, now seen corresponding path program 1 times [2022-12-06 05:08:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:01,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156177559] [2022-12-06 05:08:01,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:02,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:02,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156177559] [2022-12-06 05:08:02,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156177559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:02,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:02,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 05:08:02,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310440579] [2022-12-06 05:08:02,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:02,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:08:02,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:02,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:08:02,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:08:02,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:08:02,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 72 transitions, 404 flow. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:02,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:02,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:08:02,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:02,895 INFO L130 PetriNetUnfolder]: 2223/3569 cut-off events. [2022-12-06 05:08:02,895 INFO L131 PetriNetUnfolder]: For 7512/7512 co-relation queries the response was YES. [2022-12-06 05:08:02,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12150 conditions, 3569 events. 2223/3569 cut-off events. For 7512/7512 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 19073 event pairs, 1135 based on Foata normal form. 2/3434 useless extension candidates. Maximal degree in co-relation 12111. Up to 2457 conditions per place. [2022-12-06 05:08:02,917 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 120 selfloop transitions, 14 changer transitions 10/144 dead transitions. [2022-12-06 05:08:02,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 1029 flow [2022-12-06 05:08:02,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:08:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:08:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-12-06 05:08:02,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2553191489361702 [2022-12-06 05:08:02,918 INFO L175 Difference]: Start difference. First operand has 60 places, 72 transitions, 404 flow. Second operand 9 states and 108 transitions. [2022-12-06 05:08:02,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 1029 flow [2022-12-06 05:08:02,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 144 transitions, 1009 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 05:08:02,957 INFO L231 Difference]: Finished difference. Result has 70 places, 78 transitions, 506 flow [2022-12-06 05:08:02,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=506, PETRI_PLACES=70, PETRI_TRANSITIONS=78} [2022-12-06 05:08:02,957 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2022-12-06 05:08:02,957 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:02,957 INFO L89 Accepts]: Start accepts. Operand has 70 places, 78 transitions, 506 flow [2022-12-06 05:08:02,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:02,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:02,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 78 transitions, 506 flow [2022-12-06 05:08:02,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 78 transitions, 506 flow [2022-12-06 05:08:02,988 INFO L130 PetriNetUnfolder]: 82/393 cut-off events. [2022-12-06 05:08:02,989 INFO L131 PetriNetUnfolder]: For 894/945 co-relation queries the response was YES. [2022-12-06 05:08:02,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 393 events. 82/393 cut-off events. For 894/945 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2751 event pairs, 3 based on Foata normal form. 5/361 useless extension candidates. Maximal degree in co-relation 1073. Up to 50 conditions per place. [2022-12-06 05:08:02,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 78 transitions, 506 flow [2022-12-06 05:08:02,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 768 [2022-12-06 05:08:03,157 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1416] L52-->L52-6: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_17| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_25|) (= (select (select |v_#memory_int_84| v_~contains_key_1~0.base_9) (+ v_~contains_key_1~0.offset_9 v_~id_0~0_33)) |v_thread1Thread1of1ForFork1_#t~mem3#1_17|)) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_25|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_17|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1666] L101-4-->L102-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre48#1_41|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre48#1_41|)) |v_#memory_int_250|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_41|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_9|, #memory_int=|v_#memory_int_250|, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1] [2022-12-06 05:08:03,213 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:08:03,214 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 257 [2022-12-06 05:08:03,214 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 78 transitions, 519 flow [2022-12-06 05:08:03,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:03,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:03,214 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:03,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:08:03,214 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:03,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:03,215 INFO L85 PathProgramCache]: Analyzing trace with hash 484564831, now seen corresponding path program 2 times [2022-12-06 05:08:03,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:03,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475746852] [2022-12-06 05:08:03,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:03,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:03,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:03,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:03,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475746852] [2022-12-06 05:08:03,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475746852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:03,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:03,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 05:08:03,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339898966] [2022-12-06 05:08:03,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:03,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:08:03,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:03,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:08:03,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:08:03,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 05:08:03,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 78 transitions, 519 flow. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:03,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:03,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 05:08:03,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:04,697 INFO L130 PetriNetUnfolder]: 2556/4227 cut-off events. [2022-12-06 05:08:04,697 INFO L131 PetriNetUnfolder]: For 13273/13273 co-relation queries the response was YES. [2022-12-06 05:08:04,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15317 conditions, 4227 events. 2556/4227 cut-off events. For 13273/13273 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 24362 event pairs, 1354 based on Foata normal form. 2/4062 useless extension candidates. Maximal degree in co-relation 15273. Up to 3085 conditions per place. [2022-12-06 05:08:04,712 INFO L137 encePairwiseOnDemand]: 37/48 looper letters, 114 selfloop transitions, 30 changer transitions 22/166 dead transitions. [2022-12-06 05:08:04,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 166 transitions, 1329 flow [2022-12-06 05:08:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:08:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:08:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2022-12-06 05:08:04,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23484848484848486 [2022-12-06 05:08:04,713 INFO L175 Difference]: Start difference. First operand has 69 places, 78 transitions, 519 flow. Second operand 11 states and 124 transitions. [2022-12-06 05:08:04,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 166 transitions, 1329 flow [2022-12-06 05:08:04,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 166 transitions, 1292 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-06 05:08:04,742 INFO L231 Difference]: Finished difference. Result has 82 places, 94 transitions, 769 flow [2022-12-06 05:08:04,743 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=769, PETRI_PLACES=82, PETRI_TRANSITIONS=94} [2022-12-06 05:08:04,743 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2022-12-06 05:08:04,743 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:04,743 INFO L89 Accepts]: Start accepts. Operand has 82 places, 94 transitions, 769 flow [2022-12-06 05:08:04,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:04,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:04,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 94 transitions, 769 flow [2022-12-06 05:08:04,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 94 transitions, 769 flow [2022-12-06 05:08:04,788 INFO L130 PetriNetUnfolder]: 114/569 cut-off events. [2022-12-06 05:08:04,788 INFO L131 PetriNetUnfolder]: For 2339/2455 co-relation queries the response was YES. [2022-12-06 05:08:04,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 569 events. 114/569 cut-off events. For 2339/2455 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4524 event pairs, 4 based on Foata normal form. 11/525 useless extension candidates. Maximal degree in co-relation 1815. Up to 79 conditions per place. [2022-12-06 05:08:04,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 94 transitions, 769 flow [2022-12-06 05:08:04,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 862 [2022-12-06 05:08:04,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1416] L52-->L52-6: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_17| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_25|) (= (select (select |v_#memory_int_84| v_~contains_key_1~0.base_9) (+ v_~contains_key_1~0.offset_9 v_~id_0~0_33)) |v_thread1Thread1of1ForFork1_#t~mem3#1_17|)) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_25|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_17|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 05:08:04,993 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:08:04,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 251 [2022-12-06 05:08:04,994 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 777 flow [2022-12-06 05:08:04,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:04,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:04,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:04,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:08:04,994 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:04,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:04,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1839595051, now seen corresponding path program 1 times [2022-12-06 05:08:04,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:04,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680288909] [2022-12-06 05:08:04,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:04,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:05,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:05,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:05,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680288909] [2022-12-06 05:08:05,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680288909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:05,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:05,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 05:08:05,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613582463] [2022-12-06 05:08:05,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:05,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:08:05,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:05,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:08:05,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:08:05,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:08:05,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 93 transitions, 777 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:05,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:05,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:08:05,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:06,731 INFO L130 PetriNetUnfolder]: 2666/4433 cut-off events. [2022-12-06 05:08:06,731 INFO L131 PetriNetUnfolder]: For 20675/20675 co-relation queries the response was YES. [2022-12-06 05:08:06,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17395 conditions, 4433 events. 2666/4433 cut-off events. For 20675/20675 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26017 event pairs, 1800 based on Foata normal form. 1/4267 useless extension candidates. Maximal degree in co-relation 17345. Up to 4159 conditions per place. [2022-12-06 05:08:06,752 INFO L137 encePairwiseOnDemand]: 43/51 looper letters, 125 selfloop transitions, 5 changer transitions 13/143 dead transitions. [2022-12-06 05:08:06,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 143 transitions, 1336 flow [2022-12-06 05:08:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:08:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:08:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-12-06 05:08:06,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23529411764705882 [2022-12-06 05:08:06,754 INFO L175 Difference]: Start difference. First operand has 78 places, 93 transitions, 777 flow. Second operand 8 states and 96 transitions. [2022-12-06 05:08:06,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 143 transitions, 1336 flow [2022-12-06 05:08:06,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 143 transitions, 1297 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-06 05:08:06,809 INFO L231 Difference]: Finished difference. Result has 83 places, 94 transitions, 785 flow [2022-12-06 05:08:06,809 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=785, PETRI_PLACES=83, PETRI_TRANSITIONS=94} [2022-12-06 05:08:06,809 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2022-12-06 05:08:06,810 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:06,810 INFO L89 Accepts]: Start accepts. Operand has 83 places, 94 transitions, 785 flow [2022-12-06 05:08:06,812 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:06,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:06,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 94 transitions, 785 flow [2022-12-06 05:08:06,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 94 transitions, 785 flow [2022-12-06 05:08:06,870 INFO L130 PetriNetUnfolder]: 114/585 cut-off events. [2022-12-06 05:08:06,870 INFO L131 PetriNetUnfolder]: For 2508/2626 co-relation queries the response was YES. [2022-12-06 05:08:06,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 585 events. 114/585 cut-off events. For 2508/2626 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4721 event pairs, 10 based on Foata normal form. 13/541 useless extension candidates. Maximal degree in co-relation 1813. Up to 85 conditions per place. [2022-12-06 05:08:06,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 94 transitions, 785 flow [2022-12-06 05:08:06,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 880 [2022-12-06 05:08:06,883 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:06,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 05:08:06,883 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 94 transitions, 785 flow [2022-12-06 05:08:06,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:06,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:06,883 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:06,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:08:06,884 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:06,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash -785898795, now seen corresponding path program 2 times [2022-12-06 05:08:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:06,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112097305] [2022-12-06 05:08:06,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:06,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:07,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:07,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112097305] [2022-12-06 05:08:07,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112097305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:07,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:07,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 05:08:07,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303542302] [2022-12-06 05:08:07,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:07,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:08:07,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:07,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:08:07,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:08:07,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:08:07,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 94 transitions, 785 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:07,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:07,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:08:07,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:08,487 INFO L130 PetriNetUnfolder]: 2658/4443 cut-off events. [2022-12-06 05:08:08,487 INFO L131 PetriNetUnfolder]: For 20352/20352 co-relation queries the response was YES. [2022-12-06 05:08:08,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17296 conditions, 4443 events. 2658/4443 cut-off events. For 20352/20352 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26247 event pairs, 1838 based on Foata normal form. 2/4278 useless extension candidates. Maximal degree in co-relation 17245. Up to 4159 conditions per place. [2022-12-06 05:08:08,509 INFO L137 encePairwiseOnDemand]: 42/51 looper letters, 120 selfloop transitions, 9 changer transitions 8/137 dead transitions. [2022-12-06 05:08:08,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 137 transitions, 1265 flow [2022-12-06 05:08:08,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:08:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:08:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-12-06 05:08:08,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22794117647058823 [2022-12-06 05:08:08,510 INFO L175 Difference]: Start difference. First operand has 81 places, 94 transitions, 785 flow. Second operand 8 states and 93 transitions. [2022-12-06 05:08:08,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 137 transitions, 1265 flow [2022-12-06 05:08:08,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 137 transitions, 1245 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 05:08:08,561 INFO L231 Difference]: Finished difference. Result has 87 places, 99 transitions, 878 flow [2022-12-06 05:08:08,561 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=878, PETRI_PLACES=87, PETRI_TRANSITIONS=99} [2022-12-06 05:08:08,561 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2022-12-06 05:08:08,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:08,562 INFO L89 Accepts]: Start accepts. Operand has 87 places, 99 transitions, 878 flow [2022-12-06 05:08:08,562 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:08,562 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:08,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 99 transitions, 878 flow [2022-12-06 05:08:08,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 99 transitions, 878 flow [2022-12-06 05:08:08,609 INFO L130 PetriNetUnfolder]: 113/595 cut-off events. [2022-12-06 05:08:08,609 INFO L131 PetriNetUnfolder]: For 2872/2990 co-relation queries the response was YES. [2022-12-06 05:08:08,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 595 events. 113/595 cut-off events. For 2872/2990 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4868 event pairs, 10 based on Foata normal form. 13/550 useless extension candidates. Maximal degree in co-relation 1898. Up to 85 conditions per place. [2022-12-06 05:08:08,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 99 transitions, 878 flow [2022-12-06 05:08:08,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 908 [2022-12-06 05:08:08,616 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 05:08:08,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 05:08:08,818 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:08:08,819 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 257 [2022-12-06 05:08:08,819 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 98 transitions, 887 flow [2022-12-06 05:08:08,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:08,819 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:08,819 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:08,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:08:08,819 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:08,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:08,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1369209799, now seen corresponding path program 1 times [2022-12-06 05:08:08,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:08,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865723183] [2022-12-06 05:08:08,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:08,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:09,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:09,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865723183] [2022-12-06 05:08:09,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865723183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:09,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:09,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 05:08:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386172502] [2022-12-06 05:08:09,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:09,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:08:09,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:08:09,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:08:09,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 05:08:09,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 98 transitions, 887 flow. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:09,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:09,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 05:08:09,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:10,574 INFO L130 PetriNetUnfolder]: 2693/4500 cut-off events. [2022-12-06 05:08:10,575 INFO L131 PetriNetUnfolder]: For 22796/22796 co-relation queries the response was YES. [2022-12-06 05:08:10,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17844 conditions, 4500 events. 2693/4500 cut-off events. For 22796/22796 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26736 event pairs, 1792 based on Foata normal form. 1/4334 useless extension candidates. Maximal degree in co-relation 17791. Up to 4159 conditions per place. [2022-12-06 05:08:10,601 INFO L137 encePairwiseOnDemand]: 42/53 looper letters, 127 selfloop transitions, 11 changer transitions 12/150 dead transitions. [2022-12-06 05:08:10,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 150 transitions, 1412 flow [2022-12-06 05:08:10,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:08:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:08:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-12-06 05:08:10,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2180293501048218 [2022-12-06 05:08:10,602 INFO L175 Difference]: Start difference. First operand has 85 places, 98 transitions, 887 flow. Second operand 9 states and 104 transitions. [2022-12-06 05:08:10,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 150 transitions, 1412 flow [2022-12-06 05:08:10,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 150 transitions, 1372 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-12-06 05:08:10,717 INFO L231 Difference]: Finished difference. Result has 93 places, 103 transitions, 926 flow [2022-12-06 05:08:10,717 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=926, PETRI_PLACES=93, PETRI_TRANSITIONS=103} [2022-12-06 05:08:10,718 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2022-12-06 05:08:10,718 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:10,718 INFO L89 Accepts]: Start accepts. Operand has 93 places, 103 transitions, 926 flow [2022-12-06 05:08:10,719 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:10,720 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:10,720 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 103 transitions, 926 flow [2022-12-06 05:08:10,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 103 transitions, 926 flow [2022-12-06 05:08:10,790 INFO L130 PetriNetUnfolder]: 114/593 cut-off events. [2022-12-06 05:08:10,790 INFO L131 PetriNetUnfolder]: For 3018/3149 co-relation queries the response was YES. [2022-12-06 05:08:10,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1992 conditions, 593 events. 114/593 cut-off events. For 3018/3149 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4814 event pairs, 9 based on Foata normal form. 13/549 useless extension candidates. Maximal degree in co-relation 1948. Up to 85 conditions per place. [2022-12-06 05:08:10,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 103 transitions, 926 flow [2022-12-06 05:08:10,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 930 [2022-12-06 05:08:11,052 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_5~0.base_3) (+ v_~get_5~0.offset_3 (* v_~id_3~0_4 4)))) InVars {~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} OutVars{~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] [2022-12-06 05:08:11,075 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1866] L60-6-->L103-3: Formula: (and (<= v_~result_12~0_135 2147483647) (= (store |v_#memory_int_920| |v_ULTIMATE.start_main_~#t3~0#1.base_309| (store (select |v_#memory_int_920| |v_ULTIMATE.start_main_~#t3~0#1.base_309|) |v_ULTIMATE.start_main_~#t3~0#1.offset_272| |v_ULTIMATE.start_main_#t~pre50#1_266|)) |v_#memory_int_919|) (<= 0 (+ v_~result_12~0_135 2147483648)) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_65| |v_thread2Thread1of1ForFork2_minus_~b#1_75|) |v_thread2Thread1of1ForFork2_minus_~a#1_75|) (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (= |v_ULTIMATE.start_main_#t~pre50#1_266| |v_#pthreadsForks_603|) (= (select (select |v_#memory_int_920| v_~get_5~0.base_207) (+ v_~get_5~0.offset_203 (* v_~id_3~0_329 4))) |v_thread2Thread1of1ForFork2_minus_#in~a#1_51|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_81|) (= |v_thread2Thread1of1ForFork2_minus_#res#1_65| v_~result_12~0_135) (= |v_thread2Thread1of1ForFork2_minus_~b#1_75| |v_thread2Thread1of1ForFork2_minus_#in~b#1_53|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_53| (select (select |v_#memory_int_920| v_~get_8~0.base_238) (+ (* v_~id_6~0_310 4) v_~get_8~0.offset_216))) (= |v_#pthreadsForks_602| (+ |v_#pthreadsForks_603| 1)) (not |v_thread2Thread1of1ForFork2_#t~short14#1_131|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_75| |v_thread2Thread1of1ForFork2_minus_#in~a#1_51|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_75| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_75|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_75|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|)) InVars {~id_6~0=v_~id_6~0_310, #pthreadsForks=|v_#pthreadsForks_603|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_272|, ~get_8~0.base=v_~get_8~0.base_238, ~get_5~0.base=v_~get_5~0.base_207, ~get_8~0.offset=v_~get_8~0.offset_216, #memory_int=|v_#memory_int_920|, ~id_3~0=v_~id_3~0_329, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_309|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_131|, ~get_5~0.offset=v_~get_5~0.offset_203} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_325|, ~id_6~0=v_~id_6~0_310, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_272|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_72|, ~get_8~0.base=v_~get_8~0.base_238, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_63|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_309|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_65|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, #pthreadsForks=|v_#pthreadsForks_602|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_266|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_75|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_51|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_53|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_105|, ~id_3~0=v_~id_3~0_329, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_75|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_246|, ~get_8~0.offset=v_~get_8~0.offset_216, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_63|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_81|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_123|, ~get_5~0.base=v_~get_5~0.base_207, #memory_int=|v_#memory_int_919|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_57|, ~result_12~0=v_~result_12~0_135, ~get_5~0.offset=v_~get_5~0.offset_203} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, #memory_int, thread2Thread1of1ForFork2_#t~ite18#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1] and [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_5~0.base_3) (+ v_~get_5~0.offset_3 (* v_~id_3~0_4 4)))) InVars {~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} OutVars{~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] [2022-12-06 05:08:11,191 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1867] L60-6-->L103-3: Formula: (and (= (+ |v_#pthreadsForks_607| 1) |v_#pthreadsForks_606|) (= |v_thread2Thread1of1ForFork2_minus_#res#1_67| v_~result_12~0_137) (= |v_thread2Thread1of1ForFork2_#res#1.base_41| 0) (= (select (select |v_#memory_int_924| v_~get_8~0.base_240) (+ (* v_~id_6~0_312 4) v_~get_8~0.offset_218)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_55|) (not |v_thread2Thread1of1ForFork2_#t~short14#1_135|) (= |v_ULTIMATE.start_main_#t~pre50#1_268| |v_#pthreadsForks_607|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_77| |v_thread2Thread1of1ForFork2_minus_#in~a#1_53|) (<= 0 (+ v_~result_12~0_137 2147483648)) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_67| |v_thread2Thread1of1ForFork2_minus_~b#1_77|) |v_thread2Thread1of1ForFork2_minus_~a#1_77|) (= (store |v_#memory_int_924| |v_ULTIMATE.start_main_~#t3~0#1.base_311| (store (select |v_#memory_int_924| |v_ULTIMATE.start_main_~#t3~0#1.base_311|) |v_ULTIMATE.start_main_~#t3~0#1.offset_274| |v_ULTIMATE.start_main_#t~pre50#1_268|)) |v_#memory_int_923|) (<= v_~result_12~0_137 2147483647) (= |v_thread2Thread1of1ForFork2_minus_~b#1_77| |v_thread2Thread1of1ForFork2_minus_#in~b#1_55|) (= (select (select |v_#memory_int_924| v_~get_5~0.base_209) (+ v_~get_5~0.offset_205 (* v_~id_3~0_331 4))) |v_thread2Thread1of1ForFork2_minus_#in~a#1_53|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_41| 0) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_77|) (<= |v_thread2Thread1of1ForFork2_minus_~a#1_77| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_77|))) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_69| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|)) InVars {~id_6~0=v_~id_6~0_312, #pthreadsForks=|v_#pthreadsForks_607|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_274|, ~get_8~0.base=v_~get_8~0.base_240, ~get_5~0.base=v_~get_5~0.base_209, ~get_8~0.offset=v_~get_8~0.offset_218, #memory_int=|v_#memory_int_924|, ~id_3~0=v_~id_3~0_331, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_311|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_135|, ~get_5~0.offset=v_~get_5~0.offset_205} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_327|, ~id_6~0=v_~id_6~0_312, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_41|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_274|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_74|, ~get_8~0.base=v_~get_8~0.base_240, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_65|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_311|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_67|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_41|, #pthreadsForks=|v_#pthreadsForks_606|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_268|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_77|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_53|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_55|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_109|, ~id_3~0=v_~id_3~0_331, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_77|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_248|, ~get_8~0.offset=v_~get_8~0.offset_218, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_65|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_125|, ~get_5~0.base=v_~get_5~0.base_209, #memory_int=|v_#memory_int_923|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_59|, ~result_12~0=v_~result_12~0_137, ~get_5~0.offset=v_~get_5~0.offset_205} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, #memory_int, thread2Thread1of1ForFork2_#t~ite18#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1] and [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_5~0.base_3) (+ v_~get_5~0.offset_3 (* v_~id_3~0_4 4)))) InVars {~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} OutVars{~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] [2022-12-06 05:08:11,303 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1861] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|) (= |v_thread1Thread1of1ForFork1_#res#1.base_81| 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_231|) (<= 0 (+ v_~result_9~0_149 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_97| (select (select |v_#memory_int_860| v_~get_2~0.base_215) (+ (* v_~id_0~0_306 4) v_~get_2~0.offset_193))) (= |v_thread1Thread1of1ForFork1_minus_~b#1_121| |v_thread1Thread1of1ForFork1_minus_#in~b#1_95|) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_121| |v_thread1Thread1of1ForFork1_minus_#res#1_115|) |v_thread1Thread1of1ForFork1_minus_~a#1_121|) (= v_~result_9~0_149 |v_thread1Thread1of1ForFork1_minus_#res#1_115|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_95| (select (select |v_#memory_int_860| v_~get_5~0.base_195) (+ v_~get_5~0.offset_191 (* v_~id_3~0_311 4)))) (= (mod (select (select |v_#memory_int_860| v_~contains_key_1~0.base_185) (+ v_~id_0~0_306 v_~contains_key_1~0.offset_160)) 256) 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_121| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_121| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_121|)) 1 0)) (<= v_~result_9~0_149 2147483647) (= |v_thread1Thread1of1ForFork1_#res#1.offset_81| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_97| |v_thread1Thread1of1ForFork1_minus_~a#1_121|)) InVars {~get_2~0.offset=v_~get_2~0.offset_193, ~get_5~0.base=v_~get_5~0.base_195, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_160, ~id_3~0=v_~id_3~0_311, #memory_int=|v_#memory_int_860|, ~get_2~0.base=v_~get_2~0.base_215, ~id_0~0=v_~id_0~0_306, ~get_5~0.offset=v_~get_5~0.offset_191, ~contains_key_1~0.base=v_~contains_key_1~0.base_185} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_97|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_160|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_109|, ~result_9~0=v_~result_9~0_149, ~contains_key_1~0.base=v_~contains_key_1~0.base_185, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_107|, ~id_3~0=v_~id_3~0_311, ~get_2~0.base=v_~get_2~0.base_215, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_134|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_230|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_81|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_113|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_81|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_107|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_115|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_95|, ~get_2~0.offset=v_~get_2~0.offset_193, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_121|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, ~get_5~0.base=v_~get_5~0.base_195, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_160, #memory_int=|v_#memory_int_860|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_121|, ~id_0~0=v_~id_0~0_306, ~get_5~0.offset=v_~get_5~0.offset_191} AuxVars[|v_thread1Thread1of1ForFork1_#t~short5#1_231|] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_5~0.base_3) (+ v_~get_5~0.offset_3 (* v_~id_3~0_4 4)))) InVars {~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} OutVars{~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] [2022-12-06 05:08:11,405 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 05:08:11,440 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] and [1868] L102-4-->L58: Formula: (and (= |v_ULTIMATE.start_main_#t~pre50#1_273| |v_#pthreadsForks_617|) (= (store |v_#memory_int_935| |v_ULTIMATE.start_main_~#t3~0#1.base_317| (store (select |v_#memory_int_935| |v_ULTIMATE.start_main_~#t3~0#1.base_317|) |v_ULTIMATE.start_main_~#t3~0#1.offset_279| |v_ULTIMATE.start_main_#t~pre50#1_273|)) |v_#memory_int_934|) (= (+ |v_#pthreadsForks_617| 1) |v_#pthreadsForks_616|) (= |v_thread2Thread1of1ForFork2_#t~mem10#1_165| (select (select |v_#memory_int_934| v_~get_5~0.base_215) (+ v_~get_5~0.offset_211 (* v_~id_3~0_337 4))))) InVars {#pthreadsForks=|v_#pthreadsForks_617|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_279|, ~get_5~0.base=v_~get_5~0.base_215, ~id_3~0=v_~id_3~0_337, #memory_int=|v_#memory_int_935|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_317|, ~get_5~0.offset=v_~get_5~0.offset_211} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_332|, #pthreadsForks=|v_#pthreadsForks_616|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_279|, ~get_5~0.base=v_~get_5~0.base_215, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_273|, ~id_3~0=v_~id_3~0_337, #memory_int=|v_#memory_int_934|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_253|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_165|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_317|, ~get_5~0.offset=v_~get_5~0.offset_211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_#t~mem10#1] [2022-12-06 05:08:11,484 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] and [1868] L102-4-->L58: Formula: (and (= |v_ULTIMATE.start_main_#t~pre50#1_273| |v_#pthreadsForks_617|) (= (store |v_#memory_int_935| |v_ULTIMATE.start_main_~#t3~0#1.base_317| (store (select |v_#memory_int_935| |v_ULTIMATE.start_main_~#t3~0#1.base_317|) |v_ULTIMATE.start_main_~#t3~0#1.offset_279| |v_ULTIMATE.start_main_#t~pre50#1_273|)) |v_#memory_int_934|) (= (+ |v_#pthreadsForks_617| 1) |v_#pthreadsForks_616|) (= |v_thread2Thread1of1ForFork2_#t~mem10#1_165| (select (select |v_#memory_int_934| v_~get_5~0.base_215) (+ v_~get_5~0.offset_211 (* v_~id_3~0_337 4))))) InVars {#pthreadsForks=|v_#pthreadsForks_617|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_279|, ~get_5~0.base=v_~get_5~0.base_215, ~id_3~0=v_~id_3~0_337, #memory_int=|v_#memory_int_935|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_317|, ~get_5~0.offset=v_~get_5~0.offset_211} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_332|, #pthreadsForks=|v_#pthreadsForks_616|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_279|, ~get_5~0.base=v_~get_5~0.base_215, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_273|, ~id_3~0=v_~id_3~0_337, #memory_int=|v_#memory_int_934|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_253|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_165|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_317|, ~get_5~0.offset=v_~get_5~0.offset_211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_#t~mem10#1] [2022-12-06 05:08:12,054 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:08:12,054 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 05:08:12,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:08:12,055 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) 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-06 05:08:12,058 INFO L158 Benchmark]: Toolchain (without parser) took 36716.02ms. Allocated memory was 178.3MB in the beginning and 919.6MB in the end (delta: 741.3MB). Free memory was 154.4MB in the beginning and 621.7MB in the end (delta: -467.3MB). Peak memory consumption was 274.9MB. Max. memory is 8.0GB. [2022-12-06 05:08:12,058 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 109.3MB in the beginning and 109.2MB in the end (delta: 45.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:08:12,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.69ms. Allocated memory is still 178.3MB. Free memory was 154.0MB in the beginning and 141.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 05:08:12,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.54ms. Allocated memory is still 178.3MB. Free memory was 141.1MB in the beginning and 138.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 05:08:12,058 INFO L158 Benchmark]: Boogie Preprocessor took 33.44ms. Allocated memory is still 178.3MB. Free memory was 138.0MB in the beginning and 135.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 05:08:12,059 INFO L158 Benchmark]: RCFGBuilder took 665.22ms. Allocated memory is still 178.3MB. Free memory was 135.2MB in the beginning and 139.6MB in the end (delta: -4.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-06 05:08:12,059 INFO L158 Benchmark]: TraceAbstraction took 35726.85ms. Allocated memory was 178.3MB in the beginning and 919.6MB in the end (delta: 741.3MB). Free memory was 139.0MB in the beginning and 621.7MB in the end (delta: -482.6MB). Peak memory consumption was 259.2MB. Max. memory is 8.0GB. [2022-12-06 05:08:12,060 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 109.3MB in the beginning and 109.2MB in the end (delta: 45.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.69ms. Allocated memory is still 178.3MB. Free memory was 154.0MB in the beginning and 141.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.54ms. Allocated memory is still 178.3MB. Free memory was 141.1MB in the beginning and 138.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.44ms. Allocated memory is still 178.3MB. Free memory was 138.0MB in the beginning and 135.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 665.22ms. Allocated memory is still 178.3MB. Free memory was 135.2MB in the beginning and 139.6MB in the end (delta: -4.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 35726.85ms. Allocated memory was 178.3MB in the beginning and 919.6MB in the end (delta: 741.3MB). Free memory was 139.0MB in the beginning and 621.7MB in the end (delta: -482.6MB). Peak memory consumption was 259.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.7s, 439 PlacesBefore, 42 PlacesAfterwards, 470 TransitionsBefore, 42 TransitionsAfterwards, 17280 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 266 TrivialYvCompositions, 131 ConcurrentYvCompositions, 31 ChoiceCompositions, 429 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11567, independent: 11492, independent conditional: 11492, independent unconditional: 0, dependent: 75, dependent conditional: 75, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11567, independent: 11492, independent conditional: 0, independent unconditional: 11492, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11567, independent: 11492, independent conditional: 0, independent unconditional: 11492, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11567, independent: 11492, independent conditional: 0, independent unconditional: 11492, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10220, independent: 10175, independent conditional: 0, independent unconditional: 10175, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10220, independent: 10175, independent conditional: 0, independent unconditional: 10175, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11567, independent: 1317, independent conditional: 0, independent unconditional: 1317, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 10220, unknown conditional: 0, unknown unconditional: 10220] , Statistics on independence cache: Total cache size (in pairs): 20762, Positive cache size: 20717, Positive conditional cache size: 0, Positive unconditional cache size: 20717, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, 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, 40 PlacesBefore, 40 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 154, independent: 130, independent conditional: 15, independent unconditional: 115, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 154, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 154, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 105, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 105, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 105, unknown conditional: 0, unknown unconditional: 105] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 87, Positive conditional cache size: 0, Positive unconditional cache size: 87, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 156, independent conditional: 156, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 182, independent: 156, independent conditional: 30, independent unconditional: 126, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , 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: 182, independent: 153, independent conditional: 0, independent unconditional: 153, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 43 PlacesBefore, 42 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, 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: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 44 PlacesBefore, 43 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, 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: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 44 PlacesBefore, 43 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, 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: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 44 PlacesBefore, 43 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, 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: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 45 PlacesBefore, 44 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, 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: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 44 PlacesBefore, 44 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, 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: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 54 PlacesBefore, 53 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 531, independent: 494, independent conditional: 494, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 531, independent: 494, independent conditional: 145, independent unconditional: 349, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 531, independent: 494, independent conditional: 145, independent unconditional: 349, dependent: 37, dependent conditional: 24, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 531, independent: 494, independent conditional: 145, independent unconditional: 349, dependent: 37, dependent conditional: 24, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 95, independent: 81, independent conditional: 30, independent unconditional: 51, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 95, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 531, independent: 413, independent conditional: 115, independent unconditional: 298, dependent: 23, dependent conditional: 10, dependent unconditional: 13, unknown: 95, unknown conditional: 44, unknown unconditional: 51] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 175, Positive conditional cache size: 30, Positive unconditional cache size: 145, Negative cache size: 32, Negative conditional cache size: 14, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 738 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 178, independent: 158, independent conditional: 158, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 178, independent: 158, independent conditional: 28, independent unconditional: 130, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 183, independent: 158, independent conditional: 28, independent unconditional: 130, dependent: 25, dependent conditional: 13, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 183, independent: 158, independent conditional: 28, independent unconditional: 130, dependent: 25, dependent conditional: 13, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 183, independent: 142, independent conditional: 28, independent unconditional: 114, dependent: 22, dependent conditional: 10, dependent unconditional: 12, unknown: 19, unknown conditional: 3, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 191, Positive conditional cache size: 30, Positive unconditional cache size: 161, Negative cache size: 35, Negative conditional cache size: 17, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 69 PlacesBefore, 69 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 768 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 375, independent: 329, independent conditional: 329, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 375, independent: 329, independent conditional: 141, independent unconditional: 188, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 375, independent: 329, independent conditional: 141, independent unconditional: 188, dependent: 46, dependent conditional: 26, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375, independent: 329, independent conditional: 141, independent unconditional: 188, dependent: 46, dependent conditional: 26, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 375, independent: 319, independent conditional: 133, independent unconditional: 186, dependent: 37, dependent conditional: 17, dependent unconditional: 20, unknown: 19, unknown conditional: 17, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 201, Positive conditional cache size: 38, Positive unconditional cache size: 163, Negative cache size: 44, Negative conditional cache size: 26, Negative unconditional cache size: 18, 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.2s, 79 PlacesBefore, 78 PlacesAfterwards, 94 TransitionsBefore, 93 TransitionsAfterwards, 862 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 639, independent: 583, independent conditional: 583, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 639, independent: 583, independent conditional: 315, independent unconditional: 268, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 673, independent: 583, independent conditional: 315, independent unconditional: 268, dependent: 90, dependent conditional: 64, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 673, independent: 583, independent conditional: 315, independent unconditional: 268, dependent: 90, dependent conditional: 64, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 673, independent: 574, independent conditional: 306, independent unconditional: 268, dependent: 79, dependent conditional: 53, dependent unconditional: 26, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 269, Positive cache size: 214, Positive conditional cache size: 47, Positive unconditional cache size: 167, Negative cache size: 55, Negative conditional cache size: 37, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 880 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 262, independent: 234, independent conditional: 234, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 262, independent: 234, independent conditional: 125, independent unconditional: 109, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 282, independent: 234, independent conditional: 113, independent unconditional: 121, dependent: 48, dependent conditional: 35, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 282, independent: 234, independent conditional: 113, independent unconditional: 121, dependent: 48, dependent conditional: 35, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 282, independent: 233, independent conditional: 112, independent unconditional: 121, dependent: 46, dependent conditional: 33, dependent unconditional: 13, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 215, Positive conditional cache size: 48, Positive unconditional cache size: 167, Negative cache size: 57, Negative conditional cache size: 39, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 86 PlacesBefore, 85 PlacesAfterwards, 99 TransitionsBefore, 98 TransitionsAfterwards, 908 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 500, independent: 444, independent conditional: 444, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 500, independent: 444, independent conditional: 224, independent unconditional: 220, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 540, independent: 444, independent conditional: 200, independent unconditional: 244, dependent: 96, dependent conditional: 70, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 540, independent: 444, independent conditional: 200, independent unconditional: 244, dependent: 96, dependent conditional: 70, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 540, independent: 438, independent conditional: 195, independent unconditional: 243, dependent: 95, dependent conditional: 69, dependent unconditional: 26, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 221, Positive conditional cache size: 53, Positive unconditional cache size: 168, Negative cache size: 58, Negative conditional cache size: 40, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 92 PlacesBefore, 89 PlacesAfterwards, 103 TransitionsBefore, 100 TransitionsAfterwards, 930 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 373, independent: 327, independent conditional: 327, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 373, independent: 327, independent conditional: 171, independent unconditional: 156, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 388, independent: 327, independent conditional: 171, independent unconditional: 156, dependent: 61, dependent conditional: 35, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 388, independent: 327, independent conditional: 171, independent unconditional: 156, dependent: 61, dependent conditional: 35, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 14, independent unconditional: 0, 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: 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: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 388, independent: 313, independent conditional: 157, independent unconditional: 156, dependent: 59, dependent conditional: 33, dependent unconditional: 26, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 254, Positive conditional cache size: 73, Positive unconditional cache size: 181, Negative cache size: 60, Negative conditional cache size: 42, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 2 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:08:12,085 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...