/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-name-comparator-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:06:37,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:06:37,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:06:37,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:06:37,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:06:37,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:06:37,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:06:37,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:06:37,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:06:37,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:06:37,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:06:37,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:06:37,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:06:37,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:06:37,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:06:37,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:06:37,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:06:37,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:06:37,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:06:37,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:06:37,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:06:37,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:06:37,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:06:37,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:06:37,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:06:37,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:06:37,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:06:37,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:06:37,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:06:37,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:06:37,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:06:37,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:06:37,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:06:37,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:06:37,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:06:37,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:06:37,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:06:37,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:06:37,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:06:37,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:06:37,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:06:37,400 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:06:37,427 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:06:37,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:06:37,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:06:37,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:06:37,429 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:06:37,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:06:37,430 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:06:37,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:06:37,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:06:37,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:06:37,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:06:37,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:06:37,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:06:37,431 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:06:37,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:06:37,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:06:37,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:06:37,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:06:37,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:06:37,432 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:06:37,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:06:37,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:06:37,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:06:37,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:06:37,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:06:37,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:06:37,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:06:37,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:06:37,432 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:06:37,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:06:37,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:06:37,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:06:37,728 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:06:37,728 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:06:37,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-subst.wvr.c [2022-12-06 05:06:38,650 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:06:38,828 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:06:38,828 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-subst.wvr.c [2022-12-06 05:06:38,834 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629056db5/cd312c5c5d8c4709959dd6a183b2eb90/FLAG8517a995d [2022-12-06 05:06:38,845 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629056db5/cd312c5c5d8c4709959dd6a183b2eb90 [2022-12-06 05:06:38,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:06:38,848 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:06:38,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:06:38,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:06:38,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:06:38,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:06:38" (1/1) ... [2022-12-06 05:06:38,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5534395f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:38, skipping insertion in model container [2022-12-06 05:06:38,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:06:38" (1/1) ... [2022-12-06 05:06:38,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:06:38,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:06:39,001 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-name-comparator-subst.wvr.c[4836,4849] [2022-12-06 05:06:39,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:06:39,028 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:06:39,064 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-name-comparator-subst.wvr.c[4836,4849] [2022-12-06 05:06:39,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:06:39,080 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:06:39,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:39 WrapperNode [2022-12-06 05:06:39,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:06:39,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:06:39,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:06:39,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:06:39,086 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:06:39" (1/1) ... [2022-12-06 05:06:39,103 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:06:39" (1/1) ... [2022-12-06 05:06:39,135 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 297 [2022-12-06 05:06:39,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:06:39,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:06:39,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:06:39,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:06:39,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:39" (1/1) ... [2022-12-06 05:06:39,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:39" (1/1) ... [2022-12-06 05:06:39,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:39" (1/1) ... [2022-12-06 05:06:39,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:39" (1/1) ... [2022-12-06 05:06:39,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:39" (1/1) ... [2022-12-06 05:06:39,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:39" (1/1) ... [2022-12-06 05:06:39,167 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:39" (1/1) ... [2022-12-06 05:06:39,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:39" (1/1) ... [2022-12-06 05:06:39,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:06:39,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:06:39,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:06:39,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:06:39,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:39" (1/1) ... [2022-12-06 05:06:39,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:06:39,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:06:39,214 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:06:39,232 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:06:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:06:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:06:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:06:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:06:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:06:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:06:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:06:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:06:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:06:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:06:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:06:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:06:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:06:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:06:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:06:39,244 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:06:39,368 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:06:39,371 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:06:39,694 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:06:39,704 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:06:39,705 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 05:06:39,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:06:39 BoogieIcfgContainer [2022-12-06 05:06:39,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:06:39,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:06:39,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:06:39,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:06:39,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:06:38" (1/3) ... [2022-12-06 05:06:39,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5752d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:06:39, skipping insertion in model container [2022-12-06 05:06:39,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:39" (2/3) ... [2022-12-06 05:06:39,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5752d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:06:39, skipping insertion in model container [2022-12-06 05:06:39,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:06:39" (3/3) ... [2022-12-06 05:06:39,712 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-subst.wvr.c [2022-12-06 05:06:39,725 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:06:39,725 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:06:39,726 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:06:39,813 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:06:39,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 341 transitions, 706 flow [2022-12-06 05:06:39,964 INFO L130 PetriNetUnfolder]: 26/338 cut-off events. [2022-12-06 05:06:39,964 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:06:39,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 338 events. 26/338 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 791 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 250. Up to 2 conditions per place. [2022-12-06 05:06:39,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 341 transitions, 706 flow [2022-12-06 05:06:39,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 328 transitions, 674 flow [2022-12-06 05:06:39,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:39,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 312 places, 328 transitions, 674 flow [2022-12-06 05:06:40,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 328 transitions, 674 flow [2022-12-06 05:06:40,082 INFO L130 PetriNetUnfolder]: 26/328 cut-off events. [2022-12-06 05:06:40,083 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:06:40,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 328 events. 26/328 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 786 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 250. Up to 2 conditions per place. [2022-12-06 05:06:40,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 312 places, 328 transitions, 674 flow [2022-12-06 05:06:40,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 27528 [2022-12-06 05:06:52,943 INFO L203 LiptonReduction]: Total number of compositions: 304 [2022-12-06 05:06:52,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:06:52,958 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;@85f6f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:06:52,958 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:06:52,965 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-06 05:06:52,965 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:06:52,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:52,966 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] [2022-12-06 05:06:52,966 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:06:52,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:52,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1174101351, now seen corresponding path program 1 times [2022-12-06 05:06:52,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:52,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071601919] [2022-12-06 05:06:52,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:52,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:53,273 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:06:53,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:53,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071601919] [2022-12-06 05:06:53,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071601919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:53,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:06:53,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:06:53,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461090773] [2022-12-06 05:06:53,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:53,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:06:53,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:53,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:06:53,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:06:53,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:06:53,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:53,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:53,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:06:53,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:53,382 INFO L130 PetriNetUnfolder]: 221/328 cut-off events. [2022-12-06 05:06:53,382 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-06 05:06:53,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 328 events. 221/328 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 771 event pairs, 138 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 534. Up to 328 conditions per place. [2022-12-06 05:06:53,388 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-06 05:06:53,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 118 flow [2022-12-06 05:06:53,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:06:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:06:53,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 05:06:53,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-06 05:06:53,398 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 26 transitions. [2022-12-06 05:06:53,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 118 flow [2022-12-06 05:06:53,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 106 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:06:53,403 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:53,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-06 05:06:53,408 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 05:06:53,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:53,408 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:53,410 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:53,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:53,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:53,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:53,419 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 05:06:53,419 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:06:53,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 4/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-12-06 05:06:53,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:53,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 05:06:54,765 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:06:54,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1358 [2022-12-06 05:06:54,767 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-06 05:06:54,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:54,767 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:54,767 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] [2022-12-06 05:06:54,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:06:54,767 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:06:54,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:54,768 INFO L85 PathProgramCache]: Analyzing trace with hash 920055315, now seen corresponding path program 1 times [2022-12-06 05:06:54,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:54,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999196041] [2022-12-06 05:06:54,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:54,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:54,892 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:06:54,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:54,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999196041] [2022-12-06 05:06:54,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999196041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:54,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:06:54,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:06:54,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694771684] [2022-12-06 05:06:54,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:54,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:06:54,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:54,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:06:54,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:06:54,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:06:54,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:54,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:54,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:06:54,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:54,973 INFO L130 PetriNetUnfolder]: 221/328 cut-off events. [2022-12-06 05:06:54,974 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:06:54,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 328 events. 221/328 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 775 event pairs, 138 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 670. Up to 328 conditions per place. [2022-12-06 05:06:54,975 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-06 05:06:54,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 116 flow [2022-12-06 05:06:54,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:06:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:06:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 05:06:54,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-06 05:06:54,976 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 3 states and 26 transitions. [2022-12-06 05:06:54,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 116 flow [2022-12-06 05:06:54,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 106 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:06:54,978 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:54,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-06 05:06:54,979 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 05:06:54,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:54,979 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:54,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:54,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:54,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:54,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:54,986 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 05:06:54,986 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:06:54,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 4/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-12-06 05:06:54,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:54,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 05:06:56,909 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:06:56,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1931 [2022-12-06 05:06:56,910 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-06 05:06:56,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:56,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:56,910 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] [2022-12-06 05:06:56,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:06:56,911 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:06:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:56,911 INFO L85 PathProgramCache]: Analyzing trace with hash 511231090, now seen corresponding path program 1 times [2022-12-06 05:06:56,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:56,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173693297] [2022-12-06 05:06:56,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:56,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:56,977 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:06:56,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:56,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173693297] [2022-12-06 05:06:56,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173693297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:56,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:06:56,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:06:56,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653635504] [2022-12-06 05:06:56,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:56,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:06:56,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:56,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:06:56,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:06:56,979 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:06:56,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:56,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:56,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:06:56,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:57,035 INFO L130 PetriNetUnfolder]: 221/328 cut-off events. [2022-12-06 05:06:57,035 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:06:57,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 328 events. 221/328 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 775 event pairs, 138 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 670. Up to 328 conditions per place. [2022-12-06 05:06:57,037 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-06 05:06:57,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 116 flow [2022-12-06 05:06:57,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:06:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:06:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 05:06:57,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-06 05:06:57,038 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 3 states and 26 transitions. [2022-12-06 05:06:57,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 116 flow [2022-12-06 05:06:57,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 106 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:06:57,038 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:57,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-06 05:06:57,039 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 05:06:57,039 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:57,039 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:57,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:57,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:57,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:57,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:57,043 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 05:06:57,044 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:06:57,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 4/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-12-06 05:06:57,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 05:06:57,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 05:06:58,868 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:06:58,869 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1830 [2022-12-06 05:06:58,869 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-06 05:06:58,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:58,869 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:58,869 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] [2022-12-06 05:06:58,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:06:58,869 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:06:58,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:58,870 INFO L85 PathProgramCache]: Analyzing trace with hash 102406865, now seen corresponding path program 1 times [2022-12-06 05:06:58,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:58,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052223653] [2022-12-06 05:06:58,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:58,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:59,551 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:06:59,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:59,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052223653] [2022-12-06 05:06:59,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052223653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:59,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:06:59,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:06:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299466818] [2022-12-06 05:06:59,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:59,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:06:59,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:59,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:06:59,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:06:59,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:06:59,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:59,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:59,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:06:59,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:59,885 INFO L130 PetriNetUnfolder]: 437/670 cut-off events. [2022-12-06 05:06:59,885 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 05:06:59,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 670 events. 437/670 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2333 event pairs, 138 based on Foata normal form. 1/496 useless extension candidates. Maximal degree in co-relation 1363. Up to 328 conditions per place. [2022-12-06 05:06:59,889 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 67 selfloop transitions, 6 changer transitions 10/83 dead transitions. [2022-12-06 05:06:59,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 83 transitions, 362 flow [2022-12-06 05:06:59,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:06:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:06:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-12-06 05:06:59,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2022-12-06 05:06:59,891 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 7 states and 85 transitions. [2022-12-06 05:06:59,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 83 transitions, 362 flow [2022-12-06 05:06:59,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 83 transitions, 354 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:06:59,893 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 102 flow [2022-12-06 05:06:59,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=102, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2022-12-06 05:06:59,894 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-06 05:06:59,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:59,894 INFO L89 Accepts]: Start accepts. Operand has 35 places, 29 transitions, 102 flow [2022-12-06 05:06:59,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:59,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:59,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 102 flow [2022-12-06 05:06:59,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 29 transitions, 102 flow [2022-12-06 05:06:59,901 INFO L130 PetriNetUnfolder]: 5/45 cut-off events. [2022-12-06 05:06:59,901 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-12-06 05:06:59,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 45 events. 5/45 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 97 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 65. Up to 6 conditions per place. [2022-12-06 05:06:59,901 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 29 transitions, 102 flow [2022-12-06 05:06:59,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-06 05:07:00,408 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:07:00,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 515 [2022-12-06 05:07:00,410 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 95 flow [2022-12-06 05:07:00,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:00,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:00,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:00,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:07:00,410 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:00,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:00,410 INFO L85 PathProgramCache]: Analyzing trace with hash -222852644, now seen corresponding path program 1 times [2022-12-06 05:07:00,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:00,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832866991] [2022-12-06 05:07:00,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:00,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:00,938 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:00,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:00,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832866991] [2022-12-06 05:07:00,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832866991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:00,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:00,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:07:00,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762690849] [2022-12-06 05:07:00,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:00,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:07:00,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:00,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:07:00,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:07:00,941 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:07:00,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 95 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 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:00,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:00,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:07:00,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:01,193 INFO L130 PetriNetUnfolder]: 597/915 cut-off events. [2022-12-06 05:07:01,193 INFO L131 PetriNetUnfolder]: For 776/776 co-relation queries the response was YES. [2022-12-06 05:07:01,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2579 conditions, 915 events. 597/915 cut-off events. For 776/776 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3411 event pairs, 195 based on Foata normal form. 2/782 useless extension candidates. Maximal degree in co-relation 2286. Up to 494 conditions per place. [2022-12-06 05:07:01,197 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 60 selfloop transitions, 7 changer transitions 11/78 dead transitions. [2022-12-06 05:07:01,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 78 transitions, 432 flow [2022-12-06 05:07:01,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:07:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:07:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-12-06 05:07:01,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41798941798941797 [2022-12-06 05:07:01,198 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 95 flow. Second operand 7 states and 79 transitions. [2022-12-06 05:07:01,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 78 transitions, 432 flow [2022-12-06 05:07:01,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 78 transitions, 353 flow, removed 37 selfloop flow, removed 4 redundant places. [2022-12-06 05:07:01,202 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 117 flow [2022-12-06 05:07:01,202 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=117, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2022-12-06 05:07:01,203 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2022-12-06 05:07:01,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:01,203 INFO L89 Accepts]: Start accepts. Operand has 38 places, 31 transitions, 117 flow [2022-12-06 05:07:01,203 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:01,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:01,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 31 transitions, 117 flow [2022-12-06 05:07:01,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 117 flow [2022-12-06 05:07:01,210 INFO L130 PetriNetUnfolder]: 7/63 cut-off events. [2022-12-06 05:07:01,210 INFO L131 PetriNetUnfolder]: For 18/24 co-relation queries the response was YES. [2022-12-06 05:07:01,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 63 events. 7/63 cut-off events. For 18/24 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 194 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 92. Up to 9 conditions per place. [2022-12-06 05:07:01,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 117 flow [2022-12-06 05:07:01,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-06 05:07:01,313 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:01,313 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-06 05:07:01,314 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 111 flow [2022-12-06 05:07:01,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 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:01,314 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:01,314 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:01,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:07:01,314 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:01,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:01,314 INFO L85 PathProgramCache]: Analyzing trace with hash -776606692, now seen corresponding path program 1 times [2022-12-06 05:07:01,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:01,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309999203] [2022-12-06 05:07:01,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:01,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:01,623 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:01,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:01,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309999203] [2022-12-06 05:07:01,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309999203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:01,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:01,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:07:01,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938165714] [2022-12-06 05:07:01,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:01,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:07:01,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:01,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:07:01,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:07:01,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:07:01,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 111 flow. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:01,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:01,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:07:01,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:01,880 INFO L130 PetriNetUnfolder]: 870/1319 cut-off events. [2022-12-06 05:07:01,880 INFO L131 PetriNetUnfolder]: For 1161/1161 co-relation queries the response was YES. [2022-12-06 05:07:01,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3782 conditions, 1319 events. 870/1319 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5240 event pairs, 342 based on Foata normal form. 1/1041 useless extension candidates. Maximal degree in co-relation 3743. Up to 864 conditions per place. [2022-12-06 05:07:01,885 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 62 selfloop transitions, 3 changer transitions 7/72 dead transitions. [2022-12-06 05:07:01,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 72 transitions, 407 flow [2022-12-06 05:07:01,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:07:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:07:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-06 05:07:01,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2022-12-06 05:07:01,888 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 111 flow. Second operand 5 states and 67 transitions. [2022-12-06 05:07:01,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 72 transitions, 407 flow [2022-12-06 05:07:01,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 72 transitions, 374 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 05:07:01,911 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 116 flow [2022-12-06 05:07:01,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2022-12-06 05:07:01,912 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2022-12-06 05:07:01,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:01,912 INFO L89 Accepts]: Start accepts. Operand has 39 places, 32 transitions, 116 flow [2022-12-06 05:07:01,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:01,913 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:01,913 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 32 transitions, 116 flow [2022-12-06 05:07:01,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 116 flow [2022-12-06 05:07:01,920 INFO L130 PetriNetUnfolder]: 9/79 cut-off events. [2022-12-06 05:07:01,920 INFO L131 PetriNetUnfolder]: For 19/24 co-relation queries the response was YES. [2022-12-06 05:07:01,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 79 events. 9/79 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 285 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 107. Up to 12 conditions per place. [2022-12-06 05:07:01,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 32 transitions, 116 flow [2022-12-06 05:07:01,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 320 [2022-12-06 05:07:01,995 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:01,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 05:07:01,996 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 119 flow [2022-12-06 05:07:01,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:01,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:01,997 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:01,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:07:01,997 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:01,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:01,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851036, now seen corresponding path program 2 times [2022-12-06 05:07:01,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:01,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077597034] [2022-12-06 05:07:01,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:01,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:02,312 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:02,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:02,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077597034] [2022-12-06 05:07:02,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077597034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:02,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:02,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:07:02,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093189984] [2022-12-06 05:07:02,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:02,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:07:02,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:02,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:07:02,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:07:02,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:07:02,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 119 flow. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:02,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:02,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:07:02,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:02,515 INFO L130 PetriNetUnfolder]: 845/1286 cut-off events. [2022-12-06 05:07:02,515 INFO L131 PetriNetUnfolder]: For 1058/1058 co-relation queries the response was YES. [2022-12-06 05:07:02,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3725 conditions, 1286 events. 845/1286 cut-off events. For 1058/1058 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5112 event pairs, 366 based on Foata normal form. 1/1030 useless extension candidates. Maximal degree in co-relation 3688. Up to 842 conditions per place. [2022-12-06 05:07:02,520 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 48 selfloop transitions, 1 changer transitions 13/62 dead transitions. [2022-12-06 05:07:02,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 341 flow [2022-12-06 05:07:02,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:07:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:07:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-06 05:07:02,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4068965517241379 [2022-12-06 05:07:02,521 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 119 flow. Second operand 5 states and 59 transitions. [2022-12-06 05:07:02,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 341 flow [2022-12-06 05:07:02,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 332 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:07:02,525 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 121 flow [2022-12-06 05:07:02,525 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-06 05:07:02,525 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2022-12-06 05:07:02,525 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:02,525 INFO L89 Accepts]: Start accepts. Operand has 43 places, 32 transitions, 121 flow [2022-12-06 05:07:02,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:02,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:02,527 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 121 flow [2022-12-06 05:07:02,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 121 flow [2022-12-06 05:07:02,534 INFO L130 PetriNetUnfolder]: 7/77 cut-off events. [2022-12-06 05:07:02,535 INFO L131 PetriNetUnfolder]: For 32/38 co-relation queries the response was YES. [2022-12-06 05:07:02,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 77 events. 7/77 cut-off events. For 32/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 289 event pairs, 0 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 109. Up to 11 conditions per place. [2022-12-06 05:07:02,535 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 121 flow [2022-12-06 05:07:02,535 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 05:07:02,703 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:02,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:07:02,704 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 117 flow [2022-12-06 05:07:02,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:02,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:02,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:02,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:07:02,705 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:02,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash -775010663, now seen corresponding path program 1 times [2022-12-06 05:07:02,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:02,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599366250] [2022-12-06 05:07:02,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:02,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:02,883 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:02,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:02,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599366250] [2022-12-06 05:07:02,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599366250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:02,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:02,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:07:02,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526432471] [2022-12-06 05:07:02,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:02,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:07:02,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:02,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:07:02,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:07:02,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:07:02,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:02,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:02,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:07:02,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:03,082 INFO L130 PetriNetUnfolder]: 767/1179 cut-off events. [2022-12-06 05:07:03,082 INFO L131 PetriNetUnfolder]: For 1885/1885 co-relation queries the response was YES. [2022-12-06 05:07:03,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3427 conditions, 1179 events. 767/1179 cut-off events. For 1885/1885 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4771 event pairs, 280 based on Foata normal form. 8/972 useless extension candidates. Maximal degree in co-relation 3382. Up to 540 conditions per place. [2022-12-06 05:07:03,087 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 66 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2022-12-06 05:07:03,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 70 transitions, 396 flow [2022-12-06 05:07:03,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:07:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:07:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 05:07:03,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5603448275862069 [2022-12-06 05:07:03,088 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 117 flow. Second operand 4 states and 65 transitions. [2022-12-06 05:07:03,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 70 transitions, 396 flow [2022-12-06 05:07:03,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 70 transitions, 364 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-06 05:07:03,092 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 150 flow [2022-12-06 05:07:03,093 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2022-12-06 05:07:03,093 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2022-12-06 05:07:03,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:03,093 INFO L89 Accepts]: Start accepts. Operand has 41 places, 35 transitions, 150 flow [2022-12-06 05:07:03,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:03,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:03,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 35 transitions, 150 flow [2022-12-06 05:07:03,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 150 flow [2022-12-06 05:07:03,103 INFO L130 PetriNetUnfolder]: 14/107 cut-off events. [2022-12-06 05:07:03,103 INFO L131 PetriNetUnfolder]: For 73/81 co-relation queries the response was YES. [2022-12-06 05:07:03,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 107 events. 14/107 cut-off events. For 73/81 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 475 event pairs, 0 based on Foata normal form. 2/84 useless extension candidates. Maximal degree in co-relation 157. Up to 14 conditions per place. [2022-12-06 05:07:03,104 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 150 flow [2022-12-06 05:07:03,104 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-06 05:07:03,104 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:07:03,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:07:03,105 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 150 flow [2022-12-06 05:07:03,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:03,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:03,105 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:03,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:07:03,105 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:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 567179083, now seen corresponding path program 1 times [2022-12-06 05:07:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:03,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688289785] [2022-12-06 05:07:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:03,358 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:03,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:03,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688289785] [2022-12-06 05:07:03,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688289785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:03,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:03,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:07:03,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739092826] [2022-12-06 05:07:03,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:03,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:07:03,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:03,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:07:03,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:07:03,359 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:07:03,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 150 flow. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:03,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:03,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:07:03,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:03,582 INFO L130 PetriNetUnfolder]: 799/1241 cut-off events. [2022-12-06 05:07:03,582 INFO L131 PetriNetUnfolder]: For 1423/1423 co-relation queries the response was YES. [2022-12-06 05:07:03,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3542 conditions, 1241 events. 799/1241 cut-off events. For 1423/1423 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5141 event pairs, 315 based on Foata normal form. 2/1024 useless extension candidates. Maximal degree in co-relation 3285. Up to 727 conditions per place. [2022-12-06 05:07:03,588 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 57 selfloop transitions, 6 changer transitions 11/74 dead transitions. [2022-12-06 05:07:03,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 74 transitions, 432 flow [2022-12-06 05:07:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:07:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:07:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 05:07:03,589 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4689655172413793 [2022-12-06 05:07:03,589 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 150 flow. Second operand 5 states and 68 transitions. [2022-12-06 05:07:03,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 74 transitions, 432 flow [2022-12-06 05:07:03,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 74 transitions, 430 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 05:07:03,593 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 198 flow [2022-12-06 05:07:03,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2022-12-06 05:07:03,593 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2022-12-06 05:07:03,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:03,593 INFO L89 Accepts]: Start accepts. Operand has 48 places, 38 transitions, 198 flow [2022-12-06 05:07:03,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:03,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:03,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 38 transitions, 198 flow [2022-12-06 05:07:03,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 198 flow [2022-12-06 05:07:03,605 INFO L130 PetriNetUnfolder]: 20/125 cut-off events. [2022-12-06 05:07:03,605 INFO L131 PetriNetUnfolder]: For 160/177 co-relation queries the response was YES. [2022-12-06 05:07:03,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 125 events. 20/125 cut-off events. For 160/177 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 613 event pairs, 0 based on Foata normal form. 2/102 useless extension candidates. Maximal degree in co-relation 234. Up to 19 conditions per place. [2022-12-06 05:07:03,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 198 flow [2022-12-06 05:07:03,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 05:07:03,616 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1376] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= v_~break_15~0_173 0)) (.cse1 (= v_~name_2~0_135 v_~name_3~0_144))) (and (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_32| |v_thread3Thread1of1ForFork0_minus_#in~b#1_31|) (not .cse0) (= |v_thread3Thread1of1ForFork0_minus_#res#1_45| |v_thread3Thread1of1ForFork0_minus_#res#1_46|) (= (ite .cse1 0 v_~result_12~0_196) v_~result_12~0_194) (= |v_thread3Thread1of1ForFork0_#res#1.base_29| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_125| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= (ite (not (and .cse0 (< v_~i_13~0_133 3))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_52| |v_thread3Thread1of1ForFork0_minus_~b#1_51|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_52| |v_thread3Thread1of1ForFork0_minus_~a#1_51|) (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_60| 256) 0) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_32| |v_thread3Thread1of1ForFork0_minus_#in~a#1_31|) (= (ite .cse1 1 0) v_~break_15~0_173) (= v_~i_13~0_133 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_29| 0))) InVars {~name_2~0=v_~name_2~0_135, ~name_3~0=v_~name_3~0_144, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_60|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_46|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_52|, ~result_12~0=v_~result_12~0_196, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_52|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_32|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_32|} OutVars{~name_2~0=v_~name_2~0_135, ~name_3~0=v_~name_3~0_144, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_29|, ~break_15~0=v_~break_15~0_173, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_63|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_51|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_31|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_29|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_45|, ~i_13~0=v_~i_13~0_133, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_51|, ~result_12~0=v_~result_12~0_194, thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_49|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~break_15~0, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~i_13~0, thread3Thread1of1ForFork0_minus_~b#1, ~result_12~0, thread3Thread1of1ForFork0_#t~ite15#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [1347] L74-4-->L74-4: Formula: (let ((.cse1 (= v_~current_10~0_Out_38 v_~name_1~0_In_23))) (let ((.cse2 (ite .cse1 1 v_~break_11~0_In_11))) (let ((.cse0 (and (= v_~current_10~0_Out_38 v_~name_3~0_In_20) (= .cse2 0)))) (and (= (ite .cse0 (- 1) (ite .cse1 1 v_~result_8~0_In_9)) v_~result_8~0_Out_50) (= v_~break_11~0_Out_42 (ite .cse0 1 .cse2)) (= v_~current_10~0_Out_38 (select (select |v_#memory_int_In_30| v_~nondet_0~0.base_In_14) (+ (* v_~i_9~0_In_8 4) v_~nondet_0~0.offset_In_14))) (= (ite (and (< v_~i_9~0_In_8 3) (= v_~break_11~0_In_11 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_24|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_34| 0)) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_3| 256) 0)) (= v_~i_9~0_Out_24 (+ v_~i_9~0_In_8 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_34| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_24|))))) InVars {~name_3~0=v_~name_3~0_In_20, ~break_11~0=v_~break_11~0_In_11, ~name_1~0=v_~name_1~0_In_23, #memory_int=|v_#memory_int_In_30|, ~result_8~0=v_~result_8~0_In_9, ~nondet_0~0.base=v_~nondet_0~0.base_In_14, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_3|, ~i_9~0=v_~i_9~0_In_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_In_14} OutVars{~name_3~0=v_~name_3~0_In_20, ~name_1~0=v_~name_1~0_In_23, ~current_10~0=v_~current_10~0_Out_38, ~result_8~0=v_~result_8~0_Out_50, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_24|, ~nondet_0~0.base=v_~nondet_0~0.base_In_14, ~nondet_0~0.offset=v_~nondet_0~0.offset_In_14, ~break_11~0=v_~break_11~0_Out_42, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_Out_12|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_34|, #memory_int=|v_#memory_int_In_30|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_Out_8|, ~i_9~0=v_~i_9~0_Out_24} AuxVars[] AssignedVars[~break_11~0, thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~current_10~0, thread2Thread1of1ForFork2_#t~post8#1, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet6#1, ~i_9~0] [2022-12-06 05:07:03,890 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:03,891 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 298 [2022-12-06 05:07:03,891 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 201 flow [2022-12-06 05:07:03,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:03,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:03,892 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:03,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:07:03,892 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:07:03,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:03,892 INFO L85 PathProgramCache]: Analyzing trace with hash 611210552, now seen corresponding path program 1 times [2022-12-06 05:07:03,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:03,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094173486] [2022-12-06 05:07:03,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:03,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:04,050 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:04,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:04,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094173486] [2022-12-06 05:07:04,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094173486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:04,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:04,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:07:04,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829112246] [2022-12-06 05:07:04,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:04,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:07:04,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:04,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:07:04,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:07:04,051 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:07:04,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:04,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:04,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:07:04,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:04,329 INFO L130 PetriNetUnfolder]: 823/1281 cut-off events. [2022-12-06 05:07:04,329 INFO L131 PetriNetUnfolder]: For 2541/2541 co-relation queries the response was YES. [2022-12-06 05:07:04,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3960 conditions, 1281 events. 823/1281 cut-off events. For 2541/2541 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5347 event pairs, 186 based on Foata normal form. 18/1060 useless extension candidates. Maximal degree in co-relation 3910. Up to 362 conditions per place. [2022-12-06 05:07:04,334 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 91 selfloop transitions, 9 changer transitions 1/101 dead transitions. [2022-12-06 05:07:04,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 101 transitions, 630 flow [2022-12-06 05:07:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:07:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:07:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-12-06 05:07:04,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2022-12-06 05:07:04,335 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 201 flow. Second operand 6 states and 89 transitions. [2022-12-06 05:07:04,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 101 transitions, 630 flow [2022-12-06 05:07:04,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 101 transitions, 609 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:07:04,339 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 236 flow [2022-12-06 05:07:04,339 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-12-06 05:07:04,340 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2022-12-06 05:07:04,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:04,340 INFO L89 Accepts]: Start accepts. Operand has 52 places, 41 transitions, 236 flow [2022-12-06 05:07:04,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:04,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:04,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 41 transitions, 236 flow [2022-12-06 05:07:04,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 236 flow [2022-12-06 05:07:04,353 INFO L130 PetriNetUnfolder]: 21/134 cut-off events. [2022-12-06 05:07:04,353 INFO L131 PetriNetUnfolder]: For 181/194 co-relation queries the response was YES. [2022-12-06 05:07:04,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 134 events. 21/134 cut-off events. For 181/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 686 event pairs, 1 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 264. Up to 23 conditions per place. [2022-12-06 05:07:04,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 41 transitions, 236 flow [2022-12-06 05:07:04,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 05:07:04,363 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1376] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= v_~break_15~0_173 0)) (.cse1 (= v_~name_2~0_135 v_~name_3~0_144))) (and (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_32| |v_thread3Thread1of1ForFork0_minus_#in~b#1_31|) (not .cse0) (= |v_thread3Thread1of1ForFork0_minus_#res#1_45| |v_thread3Thread1of1ForFork0_minus_#res#1_46|) (= (ite .cse1 0 v_~result_12~0_196) v_~result_12~0_194) (= |v_thread3Thread1of1ForFork0_#res#1.base_29| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_125| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= (ite (not (and .cse0 (< v_~i_13~0_133 3))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_52| |v_thread3Thread1of1ForFork0_minus_~b#1_51|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_52| |v_thread3Thread1of1ForFork0_minus_~a#1_51|) (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_60| 256) 0) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_32| |v_thread3Thread1of1ForFork0_minus_#in~a#1_31|) (= (ite .cse1 1 0) v_~break_15~0_173) (= v_~i_13~0_133 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_29| 0))) InVars {~name_2~0=v_~name_2~0_135, ~name_3~0=v_~name_3~0_144, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_60|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_46|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_52|, ~result_12~0=v_~result_12~0_196, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_52|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_32|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_32|} OutVars{~name_2~0=v_~name_2~0_135, ~name_3~0=v_~name_3~0_144, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_29|, ~break_15~0=v_~break_15~0_173, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_63|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_51|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_31|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_29|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_45|, ~i_13~0=v_~i_13~0_133, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_51|, ~result_12~0=v_~result_12~0_194, thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_49|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~break_15~0, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~i_13~0, thread3Thread1of1ForFork0_minus_~b#1, ~result_12~0, thread3Thread1of1ForFork0_#t~ite15#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [1347] L74-4-->L74-4: Formula: (let ((.cse1 (= v_~current_10~0_Out_38 v_~name_1~0_In_23))) (let ((.cse2 (ite .cse1 1 v_~break_11~0_In_11))) (let ((.cse0 (and (= v_~current_10~0_Out_38 v_~name_3~0_In_20) (= .cse2 0)))) (and (= (ite .cse0 (- 1) (ite .cse1 1 v_~result_8~0_In_9)) v_~result_8~0_Out_50) (= v_~break_11~0_Out_42 (ite .cse0 1 .cse2)) (= v_~current_10~0_Out_38 (select (select |v_#memory_int_In_30| v_~nondet_0~0.base_In_14) (+ (* v_~i_9~0_In_8 4) v_~nondet_0~0.offset_In_14))) (= (ite (and (< v_~i_9~0_In_8 3) (= v_~break_11~0_In_11 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_24|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_34| 0)) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_3| 256) 0)) (= v_~i_9~0_Out_24 (+ v_~i_9~0_In_8 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_34| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_24|))))) InVars {~name_3~0=v_~name_3~0_In_20, ~break_11~0=v_~break_11~0_In_11, ~name_1~0=v_~name_1~0_In_23, #memory_int=|v_#memory_int_In_30|, ~result_8~0=v_~result_8~0_In_9, ~nondet_0~0.base=v_~nondet_0~0.base_In_14, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_3|, ~i_9~0=v_~i_9~0_In_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_In_14} OutVars{~name_3~0=v_~name_3~0_In_20, ~name_1~0=v_~name_1~0_In_23, ~current_10~0=v_~current_10~0_Out_38, ~result_8~0=v_~result_8~0_Out_50, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_24|, ~nondet_0~0.base=v_~nondet_0~0.base_In_14, ~nondet_0~0.offset=v_~nondet_0~0.offset_In_14, ~break_11~0=v_~break_11~0_Out_42, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_Out_12|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_34|, #memory_int=|v_#memory_int_In_30|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_Out_8|, ~i_9~0=v_~i_9~0_Out_24} AuxVars[] AssignedVars[~break_11~0, thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~current_10~0, thread2Thread1of1ForFork2_#t~post8#1, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet6#1, ~i_9~0] [2022-12-06 05:07:04,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1306] $Ultimate##0-->L74-4: Formula: (let ((.cse0 (= v_~name_1~0_81 v_~name_3~0_85))) (and (= v_~result_8~0_122 (ite .cse0 0 v_~result_8~0_123)) (= (ite .cse0 1 0) v_~break_11~0_103) (= v_~i_9~0_73 0))) InVars {~name_3~0=v_~name_3~0_85, ~name_1~0=v_~name_1~0_81, ~result_8~0=v_~result_8~0_123} OutVars{~name_3~0=v_~name_3~0_85, ~break_11~0=v_~break_11~0_103, ~name_1~0=v_~name_1~0_81, ~result_8~0=v_~result_8~0_122, ~i_9~0=v_~i_9~0_73} AuxVars[] AssignedVars[~break_11~0, ~result_8~0, ~i_9~0] and [1378] $Ultimate##0-->L74-4: Formula: (let ((.cse1 (= v_~current_10~0_122 v_~name_1~0_146))) (let ((.cse2 (ite .cse1 1 v_~break_11~0_196))) (let ((.cse0 (and (= .cse2 0) (= v_~name_3~0_152 v_~current_10~0_122))) (.cse3 (= v_~name_2~0_139 v_~name_3~0_152)) (.cse4 (= v_~break_15~0_177 0))) (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_165| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_137|) (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_68| 256) 0) (= |v_thread3Thread1of1ForFork0_minus_#res#1_54| |v_thread3Thread1of1ForFork0_minus_#res#1_53|) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_102| 256) 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_165| 0)) (= v_~result_8~0_218 (ite .cse0 (- 1) (ite .cse1 1 v_~result_8~0_219))) (= |v_thread3Thread1of1ForFork0_minus_~b#1_59| |v_thread3Thread1of1ForFork0_minus_~b#1_60|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_60| |v_thread3Thread1of1ForFork0_minus_~a#1_59|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_137| (ite (and (< v_~i_9~0_152 3) (= v_~break_11~0_196 0)) 1 0)) (= (ite .cse0 1 .cse2) v_~break_11~0_195) (= |v_thread3Thread1of1ForFork0_#res#1.base_33| 0) (= (ite .cse3 1 0) v_~break_15~0_177) (= (ite (not (and (< v_~i_13~0_137 3) .cse4)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|) (= v_~result_12~0_204 (ite .cse3 0 v_~result_12~0_205)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_33| 0) (not .cse4) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_129| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|) (= v_~i_13~0_137 0) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_39| |v_thread3Thread1of1ForFork0_minus_#in~b#1_40|) (= (+ v_~i_9~0_152 1) v_~i_9~0_151) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_39| |v_thread3Thread1of1ForFork0_minus_#in~a#1_40|) (= (select (select |v_#memory_int_189| v_~nondet_0~0.base_126) (+ (* v_~i_9~0_152 4) v_~nondet_0~0.offset_126)) v_~current_10~0_122))))) InVars {~name_2~0=v_~name_2~0_139, ~name_3~0=v_~name_3~0_152, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_68|, ~name_1~0=v_~name_1~0_146, ~result_8~0=v_~result_8~0_219, ~nondet_0~0.base=v_~nondet_0~0.base_126, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_60|, ~nondet_0~0.offset=v_~nondet_0~0.offset_126, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_40|, ~break_11~0=v_~break_11~0_196, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_54|, #memory_int=|v_#memory_int_189|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_60|, ~result_12~0=v_~result_12~0_205, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_102|, ~i_9~0=v_~i_9~0_152, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_40|} OutVars{~name_2~0=v_~name_2~0_139, ~current_10~0=v_~current_10~0_122, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_33|, ~break_15~0=v_~break_15~0_177, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_137|, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_67|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_59|, ~nondet_0~0.offset=v_~nondet_0~0.offset_126, ~break_11~0=v_~break_11~0_195, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_59|, ~i_9~0=v_~i_9~0_151, ~name_3~0=v_~name_3~0_152, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_129|, ~name_1~0=v_~name_1~0_146, ~result_8~0=v_~result_8~0_218, ~nondet_0~0.base=v_~nondet_0~0.base_126, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_39|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_33|, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_61|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_53|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_165|, ~i_13~0=v_~i_13~0_137, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_39|, ~result_12~0=v_~result_12~0_204, thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_53|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_39|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~current_10~0, thread3Thread1of1ForFork0_#res#1.base, ~break_15~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~result_8~0, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, ~break_11~0, thread2Thread1of1ForFork2_#t~mem7#1, thread3Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~i_13~0, thread3Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork2_#t~post8#1, ~result_12~0, thread3Thread1of1ForFork0_#t~ite15#1, thread2Thread1of1ForFork2_#t~nondet6#1, ~i_9~0, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 05:07:04,782 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:07:04,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 443 [2022-12-06 05:07:04,783 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 238 flow [2022-12-06 05:07:04,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:04,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:04,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:04,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:07:04,783 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:07:04,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:04,783 INFO L85 PathProgramCache]: Analyzing trace with hash -721171720, now seen corresponding path program 1 times [2022-12-06 05:07:04,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:04,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597180812] [2022-12-06 05:07:04,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:04,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:05,024 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:05,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:05,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597180812] [2022-12-06 05:07:05,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597180812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:05,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:05,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:07:05,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666960920] [2022-12-06 05:07:05,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:05,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:07:05,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:05,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:07:05,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:07:05,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:07:05,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:05,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:05,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:07:05,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:05,247 INFO L130 PetriNetUnfolder]: 820/1266 cut-off events. [2022-12-06 05:07:05,248 INFO L131 PetriNetUnfolder]: For 2732/2732 co-relation queries the response was YES. [2022-12-06 05:07:05,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4002 conditions, 1266 events. 820/1266 cut-off events. For 2732/2732 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5301 event pairs, 95 based on Foata normal form. 4/1021 useless extension candidates. Maximal degree in co-relation 3939. Up to 722 conditions per place. [2022-12-06 05:07:05,253 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 65 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2022-12-06 05:07:05,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 577 flow [2022-12-06 05:07:05,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:07:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:07:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 05:07:05,254 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2022-12-06 05:07:05,254 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 238 flow. Second operand 5 states and 58 transitions. [2022-12-06 05:07:05,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 577 flow [2022-12-06 05:07:05,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 538 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-12-06 05:07:05,258 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 278 flow [2022-12-06 05:07:05,259 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-06 05:07:05,259 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2022-12-06 05:07:05,259 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:05,259 INFO L89 Accepts]: Start accepts. Operand has 49 places, 44 transitions, 278 flow [2022-12-06 05:07:05,259 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:05,260 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:05,260 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 44 transitions, 278 flow [2022-12-06 05:07:05,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 278 flow [2022-12-06 05:07:05,271 INFO L130 PetriNetUnfolder]: 25/144 cut-off events. [2022-12-06 05:07:05,271 INFO L131 PetriNetUnfolder]: For 284/308 co-relation queries the response was YES. [2022-12-06 05:07:05,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 144 events. 25/144 cut-off events. For 284/308 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 720 event pairs, 0 based on Foata normal form. 2/127 useless extension candidates. Maximal degree in co-relation 240. Up to 29 conditions per place. [2022-12-06 05:07:05,272 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 44 transitions, 278 flow [2022-12-06 05:07:05,272 INFO L188 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-06 05:07:05,443 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:05,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:07:05,444 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 282 flow [2022-12-06 05:07:05,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:05,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:05,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:05,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:07:05,445 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:07:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash 877903972, now seen corresponding path program 1 times [2022-12-06 05:07:05,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:05,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807472119] [2022-12-06 05:07:05,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:05,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:05,605 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:05,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:05,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807472119] [2022-12-06 05:07:05,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807472119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:05,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:05,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:07:05,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867238020] [2022-12-06 05:07:05,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:05,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:07:05,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:05,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:07:05,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:07:05,608 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:07:05,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:05,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:05,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:07:05,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:05,828 INFO L130 PetriNetUnfolder]: 858/1336 cut-off events. [2022-12-06 05:07:05,828 INFO L131 PetriNetUnfolder]: For 3979/3979 co-relation queries the response was YES. [2022-12-06 05:07:05,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4433 conditions, 1336 events. 858/1336 cut-off events. For 3979/3979 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5766 event pairs, 223 based on Foata normal form. 10/1179 useless extension candidates. Maximal degree in co-relation 3294. Up to 713 conditions per place. [2022-12-06 05:07:05,834 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 76 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2022-12-06 05:07:05,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 604 flow [2022-12-06 05:07:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:07:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:07:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 05:07:05,835 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 05:07:05,835 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 282 flow. Second operand 4 states and 66 transitions. [2022-12-06 05:07:05,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 604 flow [2022-12-06 05:07:05,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 588 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:07:05,839 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 330 flow [2022-12-06 05:07:05,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2022-12-06 05:07:05,840 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2022-12-06 05:07:05,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:05,840 INFO L89 Accepts]: Start accepts. Operand has 53 places, 47 transitions, 330 flow [2022-12-06 05:07:05,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:05,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:05,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 47 transitions, 330 flow [2022-12-06 05:07:05,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 47 transitions, 330 flow [2022-12-06 05:07:05,856 INFO L130 PetriNetUnfolder]: 32/164 cut-off events. [2022-12-06 05:07:05,856 INFO L131 PetriNetUnfolder]: For 405/437 co-relation queries the response was YES. [2022-12-06 05:07:05,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 164 events. 32/164 cut-off events. For 405/437 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 867 event pairs, 1 based on Foata normal form. 1/147 useless extension candidates. Maximal degree in co-relation 320. Up to 30 conditions per place. [2022-12-06 05:07:05,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 47 transitions, 330 flow [2022-12-06 05:07:05,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-06 05:07:05,858 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:07:05,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 05:07:05,859 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 330 flow [2022-12-06 05:07:05,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:05,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:05,859 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:05,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:07:05,859 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:07:05,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:05,860 INFO L85 PathProgramCache]: Analyzing trace with hash 634840979, now seen corresponding path program 1 times [2022-12-06 05:07:05,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:05,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040374974] [2022-12-06 05:07:05,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:06,049 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:06,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:06,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040374974] [2022-12-06 05:07:06,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040374974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:06,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:06,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:07:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952444992] [2022-12-06 05:07:06,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:06,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:07:06,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:06,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:07:06,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:07:06,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:07:06,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 330 flow. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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:06,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:06,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:07:06,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:06,276 INFO L130 PetriNetUnfolder]: 857/1341 cut-off events. [2022-12-06 05:07:06,276 INFO L131 PetriNetUnfolder]: For 3773/3773 co-relation queries the response was YES. [2022-12-06 05:07:06,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4624 conditions, 1341 events. 857/1341 cut-off events. For 3773/3773 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5624 event pairs, 405 based on Foata normal form. 2/1176 useless extension candidates. Maximal degree in co-relation 3483. Up to 1045 conditions per place. [2022-12-06 05:07:06,287 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 59 selfloop transitions, 5 changer transitions 11/75 dead transitions. [2022-12-06 05:07:06,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 601 flow [2022-12-06 05:07:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:07:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:07:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 05:07:06,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-06 05:07:06,288 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 330 flow. Second operand 4 states and 57 transitions. [2022-12-06 05:07:06,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 601 flow [2022-12-06 05:07:06,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 601 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:07:06,294 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 349 flow [2022-12-06 05:07:06,294 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=349, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2022-12-06 05:07:06,295 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 28 predicate places. [2022-12-06 05:07:06,295 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:06,295 INFO L89 Accepts]: Start accepts. Operand has 58 places, 47 transitions, 349 flow [2022-12-06 05:07:06,296 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:06,296 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:06,296 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 47 transitions, 349 flow [2022-12-06 05:07:06,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 47 transitions, 349 flow [2022-12-06 05:07:06,312 INFO L130 PetriNetUnfolder]: 31/156 cut-off events. [2022-12-06 05:07:06,312 INFO L131 PetriNetUnfolder]: For 518/555 co-relation queries the response was YES. [2022-12-06 05:07:06,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 156 events. 31/156 cut-off events. For 518/555 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 801 event pairs, 1 based on Foata normal form. 1/140 useless extension candidates. Maximal degree in co-relation 388. Up to 28 conditions per place. [2022-12-06 05:07:06,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 47 transitions, 349 flow [2022-12-06 05:07:06,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-06 05:07:06,314 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:07:06,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 05:07:06,315 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 349 flow [2022-12-06 05:07:06,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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:06,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:06,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:06,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:07:06,315 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:07:06,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:06,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1152735693, now seen corresponding path program 1 times [2022-12-06 05:07:06,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:06,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663168853] [2022-12-06 05:07:06,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:06,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:06,663 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:06,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:06,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663168853] [2022-12-06 05:07:06,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663168853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:06,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:06,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:07:06,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702407544] [2022-12-06 05:07:06,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:06,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:07:06,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:06,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:07:06,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:07:06,665 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:07:06,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 349 flow. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:06,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:06,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:07:06,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:07,028 INFO L130 PetriNetUnfolder]: 1207/1870 cut-off events. [2022-12-06 05:07:07,028 INFO L131 PetriNetUnfolder]: For 6630/6630 co-relation queries the response was YES. [2022-12-06 05:07:07,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6513 conditions, 1870 events. 1207/1870 cut-off events. For 6630/6630 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8604 event pairs, 323 based on Foata normal form. 1/1614 useless extension candidates. Maximal degree in co-relation 6447. Up to 701 conditions per place. [2022-12-06 05:07:07,036 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 94 selfloop transitions, 14 changer transitions 9/117 dead transitions. [2022-12-06 05:07:07,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 117 transitions, 933 flow [2022-12-06 05:07:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:07:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:07:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-06 05:07:07,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 05:07:07,037 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 349 flow. Second operand 6 states and 99 transitions. [2022-12-06 05:07:07,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 117 transitions, 933 flow [2022-12-06 05:07:07,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 117 transitions, 912 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 05:07:07,045 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 463 flow [2022-12-06 05:07:07,045 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2022-12-06 05:07:07,045 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2022-12-06 05:07:07,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:07,046 INFO L89 Accepts]: Start accepts. Operand has 64 places, 55 transitions, 463 flow [2022-12-06 05:07:07,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:07,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:07,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 55 transitions, 463 flow [2022-12-06 05:07:07,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 463 flow [2022-12-06 05:07:07,068 INFO L130 PetriNetUnfolder]: 41/215 cut-off events. [2022-12-06 05:07:07,068 INFO L131 PetriNetUnfolder]: For 722/783 co-relation queries the response was YES. [2022-12-06 05:07:07,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 215 events. 41/215 cut-off events. For 722/783 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1290 event pairs, 1 based on Foata normal form. 4/202 useless extension candidates. Maximal degree in co-relation 551. Up to 34 conditions per place. [2022-12-06 05:07:07,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 55 transitions, 463 flow [2022-12-06 05:07:07,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-06 05:07:07,075 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:07:07,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 05:07:07,077 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 463 flow [2022-12-06 05:07:07,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:07,077 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:07,077 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:07,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:07:07,077 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:07:07,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash 864555415, now seen corresponding path program 2 times [2022-12-06 05:07:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:07,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104125521] [2022-12-06 05:07:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:07,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:07,544 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:07,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:07,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104125521] [2022-12-06 05:07:07,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104125521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:07,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:07,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:07:07,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80657866] [2022-12-06 05:07:07,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:07,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:07:07,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:07,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:07:07,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:07:07,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:07:07,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 463 flow. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:07,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:07,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:07:07,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:07,941 INFO L130 PetriNetUnfolder]: 1213/1876 cut-off events. [2022-12-06 05:07:07,941 INFO L131 PetriNetUnfolder]: For 6861/6861 co-relation queries the response was YES. [2022-12-06 05:07:07,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7135 conditions, 1876 events. 1213/1876 cut-off events. For 6861/6861 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8576 event pairs, 472 based on Foata normal form. 5/1740 useless extension candidates. Maximal degree in co-relation 7079. Up to 1319 conditions per place. [2022-12-06 05:07:07,954 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 64 selfloop transitions, 8 changer transitions 31/103 dead transitions. [2022-12-06 05:07:07,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 103 transitions, 909 flow [2022-12-06 05:07:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:07:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:07:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-12-06 05:07:07,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2022-12-06 05:07:07,955 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 463 flow. Second operand 7 states and 81 transitions. [2022-12-06 05:07:07,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 103 transitions, 909 flow [2022-12-06 05:07:07,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 103 transitions, 903 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 05:07:07,963 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 499 flow [2022-12-06 05:07:07,963 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=499, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2022-12-06 05:07:07,963 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2022-12-06 05:07:07,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:07,963 INFO L89 Accepts]: Start accepts. Operand has 71 places, 55 transitions, 499 flow [2022-12-06 05:07:07,964 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:07,964 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:07,964 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 55 transitions, 499 flow [2022-12-06 05:07:07,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 55 transitions, 499 flow [2022-12-06 05:07:07,981 INFO L130 PetriNetUnfolder]: 41/178 cut-off events. [2022-12-06 05:07:07,982 INFO L131 PetriNetUnfolder]: For 909/987 co-relation queries the response was YES. [2022-12-06 05:07:07,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 178 events. 41/178 cut-off events. For 909/987 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 936 event pairs, 2 based on Foata normal form. 4/164 useless extension candidates. Maximal degree in co-relation 550. Up to 33 conditions per place. [2022-12-06 05:07:07,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 55 transitions, 499 flow [2022-12-06 05:07:07,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 05:07:07,997 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:07:07,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 05:07:07,998 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 499 flow [2022-12-06 05:07:07,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:07,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:07,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:07,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:07:07,998 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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:07,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:07,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1419263772, now seen corresponding path program 2 times [2022-12-06 05:07:07,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:07,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213990111] [2022-12-06 05:07:07,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:07,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:08,117 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:08,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:08,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213990111] [2022-12-06 05:07:08,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213990111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:08,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:08,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:07:08,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620597940] [2022-12-06 05:07:08,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:08,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:07:08,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:08,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:07:08,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:07:08,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:07:08,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 499 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:08,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:08,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:07:08,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:08,345 INFO L130 PetriNetUnfolder]: 1010/1590 cut-off events. [2022-12-06 05:07:08,345 INFO L131 PetriNetUnfolder]: For 6547/6547 co-relation queries the response was YES. [2022-12-06 05:07:08,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6220 conditions, 1590 events. 1010/1590 cut-off events. For 6547/6547 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7090 event pairs, 417 based on Foata normal form. 4/1465 useless extension candidates. Maximal degree in co-relation 6137. Up to 781 conditions per place. [2022-12-06 05:07:08,353 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 78 selfloop transitions, 9 changer transitions 0/87 dead transitions. [2022-12-06 05:07:08,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 87 transitions, 784 flow [2022-12-06 05:07:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:07:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:07:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 05:07:08,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 05:07:08,354 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 499 flow. Second operand 4 states and 66 transitions. [2022-12-06 05:07:08,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 87 transitions, 784 flow [2022-12-06 05:07:08,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 762 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 05:07:08,362 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 508 flow [2022-12-06 05:07:08,362 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=508, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2022-12-06 05:07:08,363 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2022-12-06 05:07:08,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:08,364 INFO L89 Accepts]: Start accepts. Operand has 69 places, 55 transitions, 508 flow [2022-12-06 05:07:08,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:08,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:08,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 55 transitions, 508 flow [2022-12-06 05:07:08,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 55 transitions, 508 flow [2022-12-06 05:07:08,381 INFO L130 PetriNetUnfolder]: 37/197 cut-off events. [2022-12-06 05:07:08,382 INFO L131 PetriNetUnfolder]: For 1052/1131 co-relation queries the response was YES. [2022-12-06 05:07:08,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 197 events. 37/197 cut-off events. For 1052/1131 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1148 event pairs, 2 based on Foata normal form. 4/183 useless extension candidates. Maximal degree in co-relation 497. Up to 33 conditions per place. [2022-12-06 05:07:08,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 55 transitions, 508 flow [2022-12-06 05:07:08,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 05:07:08,390 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1372] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (= v_~name_2~0_127 v_~name_1~0_133)) (.cse1 (= v_~break_7~0_147 0))) (and (= |v_thread1Thread1of1ForFork1_#res#1.base_19| 0) (= (ite .cse0 1 0) v_~break_7~0_147) (= v_~result_4~0_150 (ite .cse0 0 v_~result_4~0_152)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_26| |v_thread1Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_62| 256) 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_24| |v_thread1Thread1of1ForFork1_minus_#in~b#1_23|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_47|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_48| |v_thread1Thread1of1ForFork1_minus_~a#1_47|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_44| |v_thread1Thread1of1ForFork1_minus_#res#1_43|) (= v_~i_5~0_113 0) (not .cse1) (= |v_thread1Thread1of1ForFork1_#res#1.offset_19| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| (ite (not (and .cse1 (< v_~i_5~0_113 3))) 1 0)))) InVars {~name_2~0=v_~name_2~0_127, ~result_4~0=v_~result_4~0_152, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_24|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_26|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_48|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_44|, ~name_1~0=v_~name_1~0_133, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_62|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_48|} OutVars{~name_2~0=v_~name_2~0_127, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_25|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_43|, ~name_1~0=v_~name_1~0_133, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_45|, thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_41|, ~result_4~0=v_~result_4~0_150, ~break_7~0=v_~break_7~0_147, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_23|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_47|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_19|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_47|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_19|, ~i_5~0=v_~i_5~0_113, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_#t~ite5#1, ~result_4~0, ~break_7~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, ~i_5~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1376] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= v_~break_15~0_173 0)) (.cse1 (= v_~name_2~0_135 v_~name_3~0_144))) (and (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_32| |v_thread3Thread1of1ForFork0_minus_#in~b#1_31|) (not .cse0) (= |v_thread3Thread1of1ForFork0_minus_#res#1_45| |v_thread3Thread1of1ForFork0_minus_#res#1_46|) (= (ite .cse1 0 v_~result_12~0_196) v_~result_12~0_194) (= |v_thread3Thread1of1ForFork0_#res#1.base_29| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_125| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= (ite (not (and .cse0 (< v_~i_13~0_133 3))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_52| |v_thread3Thread1of1ForFork0_minus_~b#1_51|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_52| |v_thread3Thread1of1ForFork0_minus_~a#1_51|) (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_60| 256) 0) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_32| |v_thread3Thread1of1ForFork0_minus_#in~a#1_31|) (= (ite .cse1 1 0) v_~break_15~0_173) (= v_~i_13~0_133 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_29| 0))) InVars {~name_2~0=v_~name_2~0_135, ~name_3~0=v_~name_3~0_144, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_60|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_46|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_52|, ~result_12~0=v_~result_12~0_196, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_52|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_32|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_32|} OutVars{~name_2~0=v_~name_2~0_135, ~name_3~0=v_~name_3~0_144, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_29|, ~break_15~0=v_~break_15~0_173, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_63|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_51|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_31|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_29|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_45|, ~i_13~0=v_~i_13~0_133, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_51|, ~result_12~0=v_~result_12~0_194, thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_49|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~break_15~0, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~i_13~0, thread3Thread1of1ForFork0_minus_~b#1, ~result_12~0, thread3Thread1of1ForFork0_#t~ite15#1, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 05:07:08,655 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:08,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 292 [2022-12-06 05:07:08,655 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 538 flow [2022-12-06 05:07:08,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:08,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:08,656 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:08,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:07:08,656 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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:08,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1201324706, now seen corresponding path program 1 times [2022-12-06 05:07:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:08,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311028133] [2022-12-06 05:07:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:08,788 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:08,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:08,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311028133] [2022-12-06 05:07:08,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311028133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:08,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:08,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:07:08,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716481932] [2022-12-06 05:07:08,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:08,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:07:08,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:08,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:07:08,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:07:08,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:07:08,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 538 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:08,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:08,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:07:08,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:09,020 INFO L130 PetriNetUnfolder]: 993/1567 cut-off events. [2022-12-06 05:07:09,020 INFO L131 PetriNetUnfolder]: For 7285/7285 co-relation queries the response was YES. [2022-12-06 05:07:09,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6146 conditions, 1567 events. 993/1567 cut-off events. For 7285/7285 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6905 event pairs, 438 based on Foata normal form. 6/1450 useless extension candidates. Maximal degree in co-relation 5453. Up to 1036 conditions per place. [2022-12-06 05:07:09,027 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 78 selfloop transitions, 9 changer transitions 3/90 dead transitions. [2022-12-06 05:07:09,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 90 transitions, 829 flow [2022-12-06 05:07:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:07:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:07:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 05:07:09,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2022-12-06 05:07:09,028 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 538 flow. Second operand 4 states and 66 transitions. [2022-12-06 05:07:09,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 90 transitions, 829 flow [2022-12-06 05:07:09,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 819 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 05:07:09,037 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 511 flow [2022-12-06 05:07:09,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=511, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2022-12-06 05:07:09,038 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 43 predicate places. [2022-12-06 05:07:09,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:09,038 INFO L89 Accepts]: Start accepts. Operand has 73 places, 54 transitions, 511 flow [2022-12-06 05:07:09,039 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:09,039 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:09,039 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 54 transitions, 511 flow [2022-12-06 05:07:09,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 54 transitions, 511 flow [2022-12-06 05:07:09,062 INFO L130 PetriNetUnfolder]: 35/191 cut-off events. [2022-12-06 05:07:09,062 INFO L131 PetriNetUnfolder]: For 1101/1163 co-relation queries the response was YES. [2022-12-06 05:07:09,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 191 events. 35/191 cut-off events. For 1101/1163 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1092 event pairs, 2 based on Foata normal form. 2/176 useless extension candidates. Maximal degree in co-relation 499. Up to 32 conditions per place. [2022-12-06 05:07:09,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 54 transitions, 511 flow [2022-12-06 05:07:09,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-06 05:07:09,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1380] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (= v_~name_3~0_156 v_~name_1~0_150)) (.cse1 (= v_~break_11~0_203 0))) (and (= (ite .cse0 1 0) v_~break_11~0_203) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_29| |v_thread2Thread1of1ForFork2_minus_#in~a#1_30|) (= v_~i_9~0_159 0) (= |v_thread2Thread1of1ForFork2_minus_~b#1_62| |v_thread2Thread1of1ForFork2_minus_~b#1_61|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_29| |v_thread2Thread1of1ForFork2_minus_#in~b#1_30|) (= |v_thread2Thread1of1ForFork2_minus_#res#1_44| |v_thread2Thread1of1ForFork2_minus_#res#1_43|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= |v_thread2Thread1of1ForFork2_minus_~a#1_62| |v_thread2Thread1of1ForFork2_minus_~a#1_61|) (not .cse1) (= v_~result_8~0_228 (ite .cse0 0 v_~result_8~0_230)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_169| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_141|) (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_110| 256) 0) (= (ite (not (and (< v_~i_9~0_159 3) .cse1)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_141|))) InVars {~name_3~0=v_~name_3~0_156, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_62|, ~name_1~0=v_~name_1~0_150, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_62|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_30|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_30|, ~result_8~0=v_~result_8~0_230, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_44|, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_110|} OutVars{thread2Thread1of1ForFork2_#t~ite10#1=|v_thread2Thread1of1ForFork2_#t~ite10#1_45|, ~name_3~0=v_~name_3~0_156, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_61|, ~name_1~0=v_~name_1~0_150, ~result_8~0=v_~result_8~0_228, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_141|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_43|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_#t~ret9#1=|v_thread2Thread1of1ForFork2_#t~ret9#1_47|, ~break_11~0=v_~break_11~0_203, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_61|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_29|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_29|, ~i_9~0=v_~i_9~0_159} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~ite10#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_#t~ret9#1, ~break_11~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet6#1, ~i_9~0] and [1372] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (= v_~name_2~0_127 v_~name_1~0_133)) (.cse1 (= v_~break_7~0_147 0))) (and (= |v_thread1Thread1of1ForFork1_#res#1.base_19| 0) (= (ite .cse0 1 0) v_~break_7~0_147) (= v_~result_4~0_150 (ite .cse0 0 v_~result_4~0_152)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_26| |v_thread1Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_62| 256) 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_24| |v_thread1Thread1of1ForFork1_minus_#in~b#1_23|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_47|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_48| |v_thread1Thread1of1ForFork1_minus_~a#1_47|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_44| |v_thread1Thread1of1ForFork1_minus_#res#1_43|) (= v_~i_5~0_113 0) (not .cse1) (= |v_thread1Thread1of1ForFork1_#res#1.offset_19| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| (ite (not (and .cse1 (< v_~i_5~0_113 3))) 1 0)))) InVars {~name_2~0=v_~name_2~0_127, ~result_4~0=v_~result_4~0_152, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_24|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_26|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_48|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_44|, ~name_1~0=v_~name_1~0_133, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_62|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_48|} OutVars{~name_2~0=v_~name_2~0_127, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_25|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_43|, ~name_1~0=v_~name_1~0_133, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_45|, thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_41|, ~result_4~0=v_~result_4~0_150, ~break_7~0=v_~break_7~0_147, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_23|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_47|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_19|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_47|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_19|, ~i_5~0=v_~i_5~0_113, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_#t~ite5#1, ~result_4~0, ~break_7~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, ~i_5~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:07:09,309 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:09,310 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-06 05:07:09,310 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 542 flow [2022-12-06 05:07:09,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:09,310 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:09,310 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:09,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:07:09,311 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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:09,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:09,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1440690177, now seen corresponding path program 1 times [2022-12-06 05:07:09,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:09,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946586959] [2022-12-06 05:07:09,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:09,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:09,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:09,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:09,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946586959] [2022-12-06 05:07:09,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946586959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:09,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:09,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:07:09,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229106522] [2022-12-06 05:07:09,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:09,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:07:09,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:09,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:07:09,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:07:09,437 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:07:09,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 542 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:09,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:09,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:07:09,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:09,760 INFO L130 PetriNetUnfolder]: 1055/1675 cut-off events. [2022-12-06 05:07:09,760 INFO L131 PetriNetUnfolder]: For 8072/8072 co-relation queries the response was YES. [2022-12-06 05:07:09,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6571 conditions, 1675 events. 1055/1675 cut-off events. For 8072/8072 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7827 event pairs, 154 based on Foata normal form. 4/1544 useless extension candidates. Maximal degree in co-relation 5496. Up to 478 conditions per place. [2022-12-06 05:07:09,766 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 103 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2022-12-06 05:07:09,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 119 transitions, 1089 flow [2022-12-06 05:07:09,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:07:09,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:07:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-12-06 05:07:09,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.489247311827957 [2022-12-06 05:07:09,767 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 542 flow. Second operand 6 states and 91 transitions. [2022-12-06 05:07:09,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 119 transitions, 1089 flow [2022-12-06 05:07:09,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 119 transitions, 1042 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 05:07:09,779 INFO L231 Difference]: Finished difference. Result has 79 places, 63 transitions, 647 flow [2022-12-06 05:07:09,779 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=647, PETRI_PLACES=79, PETRI_TRANSITIONS=63} [2022-12-06 05:07:09,779 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2022-12-06 05:07:09,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:09,780 INFO L89 Accepts]: Start accepts. Operand has 79 places, 63 transitions, 647 flow [2022-12-06 05:07:09,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:09,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:09,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 63 transitions, 647 flow [2022-12-06 05:07:09,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 63 transitions, 647 flow [2022-12-06 05:07:09,800 INFO L130 PetriNetUnfolder]: 40/216 cut-off events. [2022-12-06 05:07:09,801 INFO L131 PetriNetUnfolder]: For 1154/1221 co-relation queries the response was YES. [2022-12-06 05:07:09,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 216 events. 40/216 cut-off events. For 1154/1221 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1321 event pairs, 2 based on Foata normal form. 5/204 useless extension candidates. Maximal degree in co-relation 556. Up to 31 conditions per place. [2022-12-06 05:07:09,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 63 transitions, 647 flow [2022-12-06 05:07:09,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-06 05:07:09,810 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:09,812 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 05:07:09,812 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 647 flow [2022-12-06 05:07:09,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:09,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:09,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:09,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:07:09,813 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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:09,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:09,813 INFO L85 PathProgramCache]: Analyzing trace with hash -668452493, now seen corresponding path program 2 times [2022-12-06 05:07:09,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:09,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332432818] [2022-12-06 05:07:09,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:09,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:10,074 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:10,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:10,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332432818] [2022-12-06 05:07:10,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332432818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:10,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:10,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:07:10,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399033681] [2022-12-06 05:07:10,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:10,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:07:10,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:10,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:07:10,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:07:10,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:07:10,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 647 flow. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:10,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:10,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:07:10,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:10,611 INFO L130 PetriNetUnfolder]: 1761/2805 cut-off events. [2022-12-06 05:07:10,611 INFO L131 PetriNetUnfolder]: For 11806/11806 co-relation queries the response was YES. [2022-12-06 05:07:10,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10159 conditions, 2805 events. 1761/2805 cut-off events. For 11806/11806 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14407 event pairs, 551 based on Foata normal form. 2/2480 useless extension candidates. Maximal degree in co-relation 9046. Up to 1447 conditions per place. [2022-12-06 05:07:10,625 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 98 selfloop transitions, 30 changer transitions 1/129 dead transitions. [2022-12-06 05:07:10,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 129 transitions, 1331 flow [2022-12-06 05:07:10,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:07:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:07:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-12-06 05:07:10,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-06 05:07:10,626 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 647 flow. Second operand 6 states and 78 transitions. [2022-12-06 05:07:10,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 129 transitions, 1331 flow [2022-12-06 05:07:10,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 129 transitions, 1327 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 05:07:10,644 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 902 flow [2022-12-06 05:07:10,644 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=902, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2022-12-06 05:07:10,644 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2022-12-06 05:07:10,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:10,644 INFO L89 Accepts]: Start accepts. Operand has 89 places, 80 transitions, 902 flow [2022-12-06 05:07:10,645 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:10,645 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:10,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 80 transitions, 902 flow [2022-12-06 05:07:10,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 80 transitions, 902 flow [2022-12-06 05:07:10,682 INFO L130 PetriNetUnfolder]: 85/407 cut-off events. [2022-12-06 05:07:10,682 INFO L131 PetriNetUnfolder]: For 2271/2362 co-relation queries the response was YES. [2022-12-06 05:07:10,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 407 events. 85/407 cut-off events. For 2271/2362 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2986 event pairs, 3 based on Foata normal form. 7/359 useless extension candidates. Maximal degree in co-relation 1198. Up to 54 conditions per place. [2022-12-06 05:07:10,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 80 transitions, 902 flow [2022-12-06 05:07:10,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-06 05:07:10,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1372] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (= v_~name_2~0_127 v_~name_1~0_133)) (.cse1 (= v_~break_7~0_147 0))) (and (= |v_thread1Thread1of1ForFork1_#res#1.base_19| 0) (= (ite .cse0 1 0) v_~break_7~0_147) (= v_~result_4~0_150 (ite .cse0 0 v_~result_4~0_152)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_26| |v_thread1Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_62| 256) 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_24| |v_thread1Thread1of1ForFork1_minus_#in~b#1_23|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_47|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_48| |v_thread1Thread1of1ForFork1_minus_~a#1_47|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_44| |v_thread1Thread1of1ForFork1_minus_#res#1_43|) (= v_~i_5~0_113 0) (not .cse1) (= |v_thread1Thread1of1ForFork1_#res#1.offset_19| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| (ite (not (and .cse1 (< v_~i_5~0_113 3))) 1 0)))) InVars {~name_2~0=v_~name_2~0_127, ~result_4~0=v_~result_4~0_152, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_24|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_26|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_48|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_44|, ~name_1~0=v_~name_1~0_133, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_62|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_48|} OutVars{~name_2~0=v_~name_2~0_127, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_25|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_43|, ~name_1~0=v_~name_1~0_133, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_45|, thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_41|, ~result_4~0=v_~result_4~0_150, ~break_7~0=v_~break_7~0_147, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_23|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_47|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_19|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_47|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_19|, ~i_5~0=v_~i_5~0_113, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_#t~ite5#1, ~result_4~0, ~break_7~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, ~i_5~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1376] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= v_~break_15~0_173 0)) (.cse1 (= v_~name_2~0_135 v_~name_3~0_144))) (and (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_32| |v_thread3Thread1of1ForFork0_minus_#in~b#1_31|) (not .cse0) (= |v_thread3Thread1of1ForFork0_minus_#res#1_45| |v_thread3Thread1of1ForFork0_minus_#res#1_46|) (= (ite .cse1 0 v_~result_12~0_196) v_~result_12~0_194) (= |v_thread3Thread1of1ForFork0_#res#1.base_29| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_125| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= (ite (not (and .cse0 (< v_~i_13~0_133 3))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_52| |v_thread3Thread1of1ForFork0_minus_~b#1_51|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_52| |v_thread3Thread1of1ForFork0_minus_~a#1_51|) (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_60| 256) 0) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_32| |v_thread3Thread1of1ForFork0_minus_#in~a#1_31|) (= (ite .cse1 1 0) v_~break_15~0_173) (= v_~i_13~0_133 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_29| 0))) InVars {~name_2~0=v_~name_2~0_135, ~name_3~0=v_~name_3~0_144, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_60|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_46|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_52|, ~result_12~0=v_~result_12~0_196, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_52|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_32|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_32|} OutVars{~name_2~0=v_~name_2~0_135, ~name_3~0=v_~name_3~0_144, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_29|, ~break_15~0=v_~break_15~0_173, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_63|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_51|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_31|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_29|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_45|, ~i_13~0=v_~i_13~0_133, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_51|, ~result_12~0=v_~result_12~0_194, thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_49|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~break_15~0, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~i_13~0, thread3Thread1of1ForFork0_minus_~b#1, ~result_12~0, thread3Thread1of1ForFork0_#t~ite15#1, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 05:07:10,944 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1372] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (= v_~name_2~0_127 v_~name_1~0_133)) (.cse1 (= v_~break_7~0_147 0))) (and (= |v_thread1Thread1of1ForFork1_#res#1.base_19| 0) (= (ite .cse0 1 0) v_~break_7~0_147) (= v_~result_4~0_150 (ite .cse0 0 v_~result_4~0_152)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_26| |v_thread1Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_62| 256) 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_24| |v_thread1Thread1of1ForFork1_minus_#in~b#1_23|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_47|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_48| |v_thread1Thread1of1ForFork1_minus_~a#1_47|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_44| |v_thread1Thread1of1ForFork1_minus_#res#1_43|) (= v_~i_5~0_113 0) (not .cse1) (= |v_thread1Thread1of1ForFork1_#res#1.offset_19| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| (ite (not (and .cse1 (< v_~i_5~0_113 3))) 1 0)))) InVars {~name_2~0=v_~name_2~0_127, ~result_4~0=v_~result_4~0_152, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_24|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_26|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_48|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_44|, ~name_1~0=v_~name_1~0_133, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_62|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_48|} OutVars{~name_2~0=v_~name_2~0_127, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_25|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_43|, ~name_1~0=v_~name_1~0_133, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_45|, thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_41|, ~result_4~0=v_~result_4~0_150, ~break_7~0=v_~break_7~0_147, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_23|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_47|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_19|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_47|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_19|, ~i_5~0=v_~i_5~0_113, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_#t~ite5#1, ~result_4~0, ~break_7~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, ~i_5~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1376] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= v_~break_15~0_173 0)) (.cse1 (= v_~name_2~0_135 v_~name_3~0_144))) (and (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_32| |v_thread3Thread1of1ForFork0_minus_#in~b#1_31|) (not .cse0) (= |v_thread3Thread1of1ForFork0_minus_#res#1_45| |v_thread3Thread1of1ForFork0_minus_#res#1_46|) (= (ite .cse1 0 v_~result_12~0_196) v_~result_12~0_194) (= |v_thread3Thread1of1ForFork0_#res#1.base_29| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_125| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= (ite (not (and .cse0 (< v_~i_13~0_133 3))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_52| |v_thread3Thread1of1ForFork0_minus_~b#1_51|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_52| |v_thread3Thread1of1ForFork0_minus_~a#1_51|) (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_60| 256) 0) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_32| |v_thread3Thread1of1ForFork0_minus_#in~a#1_31|) (= (ite .cse1 1 0) v_~break_15~0_173) (= v_~i_13~0_133 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_29| 0))) InVars {~name_2~0=v_~name_2~0_135, ~name_3~0=v_~name_3~0_144, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_60|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_46|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_52|, ~result_12~0=v_~result_12~0_196, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_52|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_32|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_32|} OutVars{~name_2~0=v_~name_2~0_135, ~name_3~0=v_~name_3~0_144, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_29|, ~break_15~0=v_~break_15~0_173, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_63|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_51|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_31|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_29|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_45|, ~i_13~0=v_~i_13~0_133, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_51|, ~result_12~0=v_~result_12~0_194, thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_49|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~break_15~0, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~i_13~0, thread3Thread1of1ForFork0_minus_~b#1, ~result_12~0, thread3Thread1of1ForFork0_#t~ite15#1, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 05:07:11,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1366] L74-4-->thread2EXIT: Formula: (let ((.cse0 (= v_~break_11~0_In_15 0))) (let ((.cse1 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_44| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32|)) (.cse2 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_5| 256) 0)) (.cse3 (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_16| 0)) (.cse4 (ite (not (and .cse0 (< v_~i_9~0_In_11 3))) 1 0)) (.cse5 (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_16| 0))) (or (and (not .cse0) (= v_~result_8~0_Out_58 v_~result_8~0_In_14) (= |v_thread2Thread1of1ForFork2_minus_#res#1_In_4| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|) .cse1 .cse2 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_In_3| |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| |v_thread2Thread1of1ForFork2_minus_#in~b#1_In_4|) .cse3 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32| .cse4) (= |v_thread2Thread1of1ForFork2_minus_~a#1_In_11| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_In_11| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|) .cse5) (and (<= v_~result_8~0_Out_58 2147483647) .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10| v_~name_1~0_In_29) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|) .cse3 (<= 0 (+ v_~result_8~0_Out_58 2147483648)) (not (= 0 .cse4)) (= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14| (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|)) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| v_~name_3~0_In_27) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32|) (= v_~result_8~0_Out_58 |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|) .cse5)))) InVars {~name_3~0=v_~name_3~0_In_27, ~break_11~0=v_~break_11~0_In_15, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_In_11|, ~name_1~0=v_~name_1~0_In_29, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_In_11|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_In_3|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_In_4|, ~result_8~0=v_~result_8~0_In_14, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_In_4|, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_5|, ~i_9~0=v_~i_9~0_In_11} OutVars{thread2Thread1of1ForFork2_#t~ite10#1=|v_thread2Thread1of1ForFork2_#t~ite10#1_Out_18|, ~name_3~0=v_~name_3~0_In_27, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_16|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|, ~name_1~0=v_~name_1~0_In_29, ~result_8~0=v_~result_8~0_Out_58, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_16|, thread2Thread1of1ForFork2_#t~ret9#1=|v_thread2Thread1of1ForFork2_#t~ret9#1_Out_16|, ~break_11~0=v_~break_11~0_In_15, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_44|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10|, ~i_9~0=v_~i_9~0_In_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~ite10#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_#t~ret9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet6#1] and [1335] L96-4-->L96-4: Formula: (let ((.cse2 (= v_~current_14~0_Out_34 v_~name_2~0_In_17))) (let ((.cse1 (ite .cse2 1 v_~break_15~0_In_14))) (let ((.cse0 (and (= .cse1 0) (= v_~current_14~0_Out_34 v_~name_3~0_In_16)))) (and (= (ite .cse0 1 .cse1) v_~break_15~0_Out_46) (not (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_In_1| 256) 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_24| 0)) (= (ite .cse0 (- 1) (ite .cse2 1 v_~result_12~0_In_8)) v_~result_12~0_Out_52) (= v_~current_14~0_Out_34 (select (select |v_#memory_int_In_26| v_~nondet_0~0.base_In_10) (+ v_~nondet_0~0.offset_In_10 (* v_~i_13~0_In_9 4)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_24| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_24|) (= (+ v_~i_13~0_In_9 1) v_~i_13~0_Out_40) (= (ite (and (= v_~break_15~0_In_14 0) (< v_~i_13~0_In_9 3)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_24|))))) InVars {~name_2~0=v_~name_2~0_In_17, ~name_3~0=v_~name_3~0_In_16, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_In_1|, ~i_13~0=v_~i_13~0_In_9, ~break_15~0=v_~break_15~0_In_14, #memory_int=|v_#memory_int_In_26|, ~result_12~0=v_~result_12~0_In_8, ~nondet_0~0.base=v_~nondet_0~0.base_In_10, ~nondet_0~0.offset=v_~nondet_0~0.offset_In_10} OutVars{~name_2~0=v_~name_2~0_In_17, ~name_3~0=v_~name_3~0_In_16, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_24|, ~current_14~0=v_~current_14~0_Out_34, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_24|, ~break_15~0=v_~break_15~0_Out_46, ~nondet_0~0.base=v_~nondet_0~0.base_In_10, ~nondet_0~0.offset=v_~nondet_0~0.offset_In_10, thread3Thread1of1ForFork0_#t~post13#1=|v_thread3Thread1of1ForFork0_#t~post13#1_Out_8|, ~i_13~0=v_~i_13~0_Out_40, #memory_int=|v_#memory_int_In_26|, ~result_12~0=v_~result_12~0_Out_52, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_Out_12|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~post13#1, ~i_13~0, ~current_14~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~break_15~0, ~result_12~0, thread3Thread1of1ForFork0_#t~mem12#1] [2022-12-06 05:07:11,615 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1366] L74-4-->thread2EXIT: Formula: (let ((.cse0 (= v_~break_11~0_In_15 0))) (let ((.cse1 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_44| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32|)) (.cse2 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_5| 256) 0)) (.cse3 (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_16| 0)) (.cse4 (ite (not (and .cse0 (< v_~i_9~0_In_11 3))) 1 0)) (.cse5 (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_16| 0))) (or (and (not .cse0) (= v_~result_8~0_Out_58 v_~result_8~0_In_14) (= |v_thread2Thread1of1ForFork2_minus_#res#1_In_4| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|) .cse1 .cse2 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_In_3| |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| |v_thread2Thread1of1ForFork2_minus_#in~b#1_In_4|) .cse3 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32| .cse4) (= |v_thread2Thread1of1ForFork2_minus_~a#1_In_11| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_In_11| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|) .cse5) (and (<= v_~result_8~0_Out_58 2147483647) .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10| v_~name_1~0_In_29) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|) .cse3 (<= 0 (+ v_~result_8~0_Out_58 2147483648)) (not (= 0 .cse4)) (= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14| (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|)) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| v_~name_3~0_In_27) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32|) (= v_~result_8~0_Out_58 |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|) .cse5)))) InVars {~name_3~0=v_~name_3~0_In_27, ~break_11~0=v_~break_11~0_In_15, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_In_11|, ~name_1~0=v_~name_1~0_In_29, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_In_11|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_In_3|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_In_4|, ~result_8~0=v_~result_8~0_In_14, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_In_4|, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_5|, ~i_9~0=v_~i_9~0_In_11} OutVars{thread2Thread1of1ForFork2_#t~ite10#1=|v_thread2Thread1of1ForFork2_#t~ite10#1_Out_18|, ~name_3~0=v_~name_3~0_In_27, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_16|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|, ~name_1~0=v_~name_1~0_In_29, ~result_8~0=v_~result_8~0_Out_58, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_16|, thread2Thread1of1ForFork2_#t~ret9#1=|v_thread2Thread1of1ForFork2_#t~ret9#1_Out_16|, ~break_11~0=v_~break_11~0_In_15, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_44|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10|, ~i_9~0=v_~i_9~0_In_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~ite10#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_#t~ret9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet6#1] and [1365] L96-4-->thread3EXIT: Formula: (let ((.cse0 (= v_~break_15~0_In_20 0))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_20| 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_20| 0)) (.cse2 (ite (not (and .cse0 (< v_~i_13~0_In_13 3))) 1 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_36|)) (.cse5 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_In_5| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|)) (= v_~name_2~0_In_28 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14| v_~name_3~0_In_25) .cse0 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14|)) 1 0)) .cse1 (not (= 0 .cse2)) .cse3 (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| 2147483647) (= v_~result_12~0_Out_62 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|) .cse4 (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| 2147483648)) .cse5 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|)) (and (not .cse0) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_6|) .cse1 .cse3 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_11|) (= v_~result_12~0_Out_62 v_~result_12~0_In_14) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| .cse2) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| |v_thread3Thread1of1ForFork0_minus_#res#1_In_5|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~b#1_In_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|) .cse4 .cse5)))) InVars {~name_2~0=v_~name_2~0_In_28, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_In_5|, ~name_3~0=v_~name_3~0_In_25, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_5|, ~i_13~0=v_~i_13~0_In_13, ~break_15~0=v_~break_15~0_In_20, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_10|, ~result_12~0=v_~result_12~0_In_14, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_11|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_6|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_6|} OutVars{~name_2~0=v_~name_2~0_In_28, ~name_3~0=v_~name_3~0_In_25, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_36|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_20|, ~break_15~0=v_~break_15~0_In_20, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_Out_26|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_20|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|, ~i_13~0=v_~i_13~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_14|, ~result_12~0=v_~result_12~0_Out_62, thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_Out_20|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_minus_~b#1, ~result_12~0, thread3Thread1of1ForFork0_#t~ite15#1, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 05:07:12,170 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:07:12,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1527 [2022-12-06 05:07:12,171 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 994 flow [2022-12-06 05:07:12,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:12,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:12,172 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:12,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:07:12,172 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:12,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1248434356, now seen corresponding path program 2 times [2022-12-06 05:07:12,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:12,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469159376] [2022-12-06 05:07:12,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:12,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:12,447 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:12,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:12,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469159376] [2022-12-06 05:07:12,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469159376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:12,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:12,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:07:12,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106483876] [2022-12-06 05:07:12,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:12,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:07:12,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:12,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:07:12,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:07:12,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:07:12,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 994 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:12,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:12,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:07:12,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:12,946 INFO L130 PetriNetUnfolder]: 1836/2952 cut-off events. [2022-12-06 05:07:12,946 INFO L131 PetriNetUnfolder]: For 15776/15776 co-relation queries the response was YES. [2022-12-06 05:07:12,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12247 conditions, 2952 events. 1836/2952 cut-off events. For 15776/15776 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 15582 event pairs, 595 based on Foata normal form. 8/2665 useless extension candidates. Maximal degree in co-relation 11858. Up to 1222 conditions per place. [2022-12-06 05:07:12,961 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 130 selfloop transitions, 26 changer transitions 2/158 dead transitions. [2022-12-06 05:07:12,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 158 transitions, 1626 flow [2022-12-06 05:07:12,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:07:12,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:07:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-12-06 05:07:12,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 05:07:12,962 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 994 flow. Second operand 7 states and 102 transitions. [2022-12-06 05:07:12,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 158 transitions, 1626 flow [2022-12-06 05:07:12,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 158 transitions, 1606 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 05:07:12,988 INFO L231 Difference]: Finished difference. Result has 97 places, 82 transitions, 1002 flow [2022-12-06 05:07:12,988 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1002, PETRI_PLACES=97, PETRI_TRANSITIONS=82} [2022-12-06 05:07:12,988 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 67 predicate places. [2022-12-06 05:07:12,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:12,988 INFO L89 Accepts]: Start accepts. Operand has 97 places, 82 transitions, 1002 flow [2022-12-06 05:07:12,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:12,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:12,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 82 transitions, 1002 flow [2022-12-06 05:07:12,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 82 transitions, 1002 flow [2022-12-06 05:07:13,039 INFO L130 PetriNetUnfolder]: 82/426 cut-off events. [2022-12-06 05:07:13,039 INFO L131 PetriNetUnfolder]: For 2589/2674 co-relation queries the response was YES. [2022-12-06 05:07:13,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 426 events. 82/426 cut-off events. For 2589/2674 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3227 event pairs, 8 based on Foata normal form. 8/399 useless extension candidates. Maximal degree in co-relation 1335. Up to 58 conditions per place. [2022-12-06 05:07:13,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 82 transitions, 1002 flow [2022-12-06 05:07:13,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 748 [2022-12-06 05:07:13,339 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:13,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 352 [2022-12-06 05:07:13,340 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 84 transitions, 1035 flow [2022-12-06 05:07:13,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:13,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:13,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:13,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:07:13,340 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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:13,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:13,340 INFO L85 PathProgramCache]: Analyzing trace with hash -141587318, now seen corresponding path program 3 times [2022-12-06 05:07:13,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:13,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298613358] [2022-12-06 05:07:13,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:13,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:13,461 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:13,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:13,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298613358] [2022-12-06 05:07:13,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298613358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:13,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:13,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:07:13,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732148274] [2022-12-06 05:07:13,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:13,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:07:13,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:13,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:07:13,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:07:13,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:07:13,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 84 transitions, 1035 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:13,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:13,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:07:13,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:13,887 INFO L130 PetriNetUnfolder]: 1851/2957 cut-off events. [2022-12-06 05:07:13,887 INFO L131 PetriNetUnfolder]: For 17348/17348 co-relation queries the response was YES. [2022-12-06 05:07:13,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12752 conditions, 2957 events. 1851/2957 cut-off events. For 17348/17348 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 15273 event pairs, 853 based on Foata normal form. 4/2774 useless extension candidates. Maximal degree in co-relation 12621. Up to 1960 conditions per place. [2022-12-06 05:07:13,902 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 99 selfloop transitions, 18 changer transitions 0/117 dead transitions. [2022-12-06 05:07:13,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 117 transitions, 1405 flow [2022-12-06 05:07:13,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:07:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:07:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 05:07:13,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-06 05:07:13,903 INFO L175 Difference]: Start difference. First operand has 97 places, 84 transitions, 1035 flow. Second operand 4 states and 66 transitions. [2022-12-06 05:07:13,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 117 transitions, 1405 flow [2022-12-06 05:07:13,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 117 transitions, 1338 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-06 05:07:13,929 INFO L231 Difference]: Finished difference. Result has 94 places, 83 transitions, 995 flow [2022-12-06 05:07:13,929 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=995, PETRI_PLACES=94, PETRI_TRANSITIONS=83} [2022-12-06 05:07:13,930 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 64 predicate places. [2022-12-06 05:07:13,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:13,931 INFO L89 Accepts]: Start accepts. Operand has 94 places, 83 transitions, 995 flow [2022-12-06 05:07:13,933 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:13,933 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:13,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 83 transitions, 995 flow [2022-12-06 05:07:13,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 83 transitions, 995 flow [2022-12-06 05:07:13,973 INFO L130 PetriNetUnfolder]: 83/429 cut-off events. [2022-12-06 05:07:13,973 INFO L131 PetriNetUnfolder]: For 2423/2513 co-relation queries the response was YES. [2022-12-06 05:07:13,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 429 events. 83/429 cut-off events. For 2423/2513 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3239 event pairs, 8 based on Foata normal form. 7/399 useless extension candidates. Maximal degree in co-relation 1176. Up to 56 conditions per place. [2022-12-06 05:07:13,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 83 transitions, 995 flow [2022-12-06 05:07:13,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 774 [2022-12-06 05:07:14,129 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:14,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 05:07:14,130 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 83 transitions, 1007 flow [2022-12-06 05:07:14,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:14,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:14,130 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:14,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:07:14,130 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:14,131 INFO L85 PathProgramCache]: Analyzing trace with hash 236259472, now seen corresponding path program 1 times [2022-12-06 05:07:14,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:14,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056805762] [2022-12-06 05:07:14,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:14,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:14,292 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:14,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:14,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056805762] [2022-12-06 05:07:14,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056805762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:14,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:14,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:07:14,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702150525] [2022-12-06 05:07:14,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:14,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:07:14,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:14,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:07:14,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:07:14,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:07:14,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 83 transitions, 1007 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:14,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:14,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:07:14,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:14,786 INFO L130 PetriNetUnfolder]: 1943/3109 cut-off events. [2022-12-06 05:07:14,786 INFO L131 PetriNetUnfolder]: For 16246/16246 co-relation queries the response was YES. [2022-12-06 05:07:14,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13117 conditions, 3109 events. 1943/3109 cut-off events. For 16246/16246 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16453 event pairs, 449 based on Foata normal form. 32/2954 useless extension candidates. Maximal degree in co-relation 11981. Up to 1798 conditions per place. [2022-12-06 05:07:14,802 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 98 selfloop transitions, 25 changer transitions 0/123 dead transitions. [2022-12-06 05:07:14,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 123 transitions, 1448 flow [2022-12-06 05:07:14,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:07:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:07:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 05:07:14,804 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4114285714285714 [2022-12-06 05:07:14,804 INFO L175 Difference]: Start difference. First operand has 94 places, 83 transitions, 1007 flow. Second operand 5 states and 72 transitions. [2022-12-06 05:07:14,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 123 transitions, 1448 flow [2022-12-06 05:07:14,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 123 transitions, 1412 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:07:14,830 INFO L231 Difference]: Finished difference. Result has 99 places, 88 transitions, 1123 flow [2022-12-06 05:07:14,830 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1123, PETRI_PLACES=99, PETRI_TRANSITIONS=88} [2022-12-06 05:07:14,830 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2022-12-06 05:07:14,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:14,830 INFO L89 Accepts]: Start accepts. Operand has 99 places, 88 transitions, 1123 flow [2022-12-06 05:07:14,831 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:14,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:14,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 88 transitions, 1123 flow [2022-12-06 05:07:14,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 88 transitions, 1123 flow [2022-12-06 05:07:14,875 INFO L130 PetriNetUnfolder]: 87/440 cut-off events. [2022-12-06 05:07:14,875 INFO L131 PetriNetUnfolder]: For 2990/3106 co-relation queries the response was YES. [2022-12-06 05:07:14,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 440 events. 87/440 cut-off events. For 2990/3106 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3359 event pairs, 5 based on Foata normal form. 5/405 useless extension candidates. Maximal degree in co-relation 1287. Up to 61 conditions per place. [2022-12-06 05:07:14,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 88 transitions, 1123 flow [2022-12-06 05:07:14,879 INFO L188 LiptonReduction]: Number of co-enabled transitions 822 [2022-12-06 05:07:14,879 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:07:14,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 05:07:14,880 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 88 transitions, 1123 flow [2022-12-06 05:07:14,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:14,880 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:14,880 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:14,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:07:14,880 INFO L420 AbstractCegarLoop]: === Iteration 23 === 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:14,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:14,881 INFO L85 PathProgramCache]: Analyzing trace with hash -848359108, now seen corresponding path program 1 times [2022-12-06 05:07:14,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:14,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328293447] [2022-12-06 05:07:14,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:14,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:15,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:15,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328293447] [2022-12-06 05:07:15,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328293447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:15,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:15,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:07:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256484345] [2022-12-06 05:07:15,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:15,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:07:15,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:15,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:07:15,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:07:15,013 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:07:15,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 88 transitions, 1123 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:15,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:15,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:07:15,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:15,512 INFO L130 PetriNetUnfolder]: 1969/3161 cut-off events. [2022-12-06 05:07:15,512 INFO L131 PetriNetUnfolder]: For 19729/19729 co-relation queries the response was YES. [2022-12-06 05:07:15,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14006 conditions, 3161 events. 1969/3161 cut-off events. For 19729/19729 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16963 event pairs, 191 based on Foata normal form. 10/2986 useless extension candidates. Maximal degree in co-relation 12843. Up to 1293 conditions per place. [2022-12-06 05:07:15,525 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 120 selfloop transitions, 49 changer transitions 2/171 dead transitions. [2022-12-06 05:07:15,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 171 transitions, 2076 flow [2022-12-06 05:07:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:07:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:07:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-12-06 05:07:15,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4458874458874459 [2022-12-06 05:07:15,526 INFO L175 Difference]: Start difference. First operand has 99 places, 88 transitions, 1123 flow. Second operand 7 states and 103 transitions. [2022-12-06 05:07:15,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 171 transitions, 2076 flow [2022-12-06 05:07:15,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 171 transitions, 2031 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 05:07:15,561 INFO L231 Difference]: Finished difference. Result has 107 places, 101 transitions, 1471 flow [2022-12-06 05:07:15,561 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1471, PETRI_PLACES=107, PETRI_TRANSITIONS=101} [2022-12-06 05:07:15,562 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 77 predicate places. [2022-12-06 05:07:15,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:15,562 INFO L89 Accepts]: Start accepts. Operand has 107 places, 101 transitions, 1471 flow [2022-12-06 05:07:15,562 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:15,562 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:15,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 101 transitions, 1471 flow [2022-12-06 05:07:15,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 101 transitions, 1471 flow [2022-12-06 05:07:15,603 INFO L130 PetriNetUnfolder]: 84/439 cut-off events. [2022-12-06 05:07:15,603 INFO L131 PetriNetUnfolder]: For 4128/4348 co-relation queries the response was YES. [2022-12-06 05:07:15,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 439 events. 84/439 cut-off events. For 4128/4348 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3336 event pairs, 2 based on Foata normal form. 4/399 useless extension candidates. Maximal degree in co-relation 1387. Up to 59 conditions per place. [2022-12-06 05:07:15,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 101 transitions, 1471 flow [2022-12-06 05:07:15,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 926 [2022-12-06 05:07:15,625 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1375] $Ultimate##0-->L96-4: Formula: (let ((.cse4 (= v_~name_2~0_133 v_~name_3~0_142))) (let ((.cse3 (= v_~name_2~0_133 v_~current_14~0_98)) (.cse0 (ite .cse4 1 0))) (let ((.cse2 (ite .cse3 1 .cse0))) (let ((.cse1 (and (= v_~name_3~0_142 v_~current_14~0_98) (= .cse2 0)))) (and (= v_~i_13~0_129 1) (= v_~current_14~0_98 (select (select |v_#memory_int_179| v_~nondet_0~0.base_119) (+ (- 4) (* v_~i_13~0_129 4) v_~nondet_0~0.offset_119))) (= (ite (and (= .cse0 0) (< v_~i_13~0_129 4)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|) (= (ite .cse1 1 .cse2) v_~break_15~0_169) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_123| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|) (= v_~result_12~0_188 (ite .cse1 (- 1) (ite .cse3 1 (ite .cse4 0 v_~result_12~0_190)))) (not (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_56| 256) 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_123| 0))))))) InVars {~name_2~0=v_~name_2~0_133, ~name_3~0=v_~name_3~0_142, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_56|, #memory_int=|v_#memory_int_179|, ~result_12~0=v_~result_12~0_190, ~nondet_0~0.base=v_~nondet_0~0.base_119, ~nondet_0~0.offset=v_~nondet_0~0.offset_119} OutVars{~name_2~0=v_~name_2~0_133, ~name_3~0=v_~name_3~0_142, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|, ~current_14~0=v_~current_14~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_123|, ~break_15~0=v_~break_15~0_169, ~nondet_0~0.base=v_~nondet_0~0.base_119, ~nondet_0~0.offset=v_~nondet_0~0.offset_119, thread3Thread1of1ForFork0_#t~post13#1=|v_thread3Thread1of1ForFork0_#t~post13#1_23|, ~i_13~0=v_~i_13~0_129, #memory_int=|v_#memory_int_179|, ~result_12~0=v_~result_12~0_188, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_41|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~post13#1, ~i_13~0, ~current_14~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~break_15~0, ~result_12~0, thread3Thread1of1ForFork0_#t~mem12#1] and [1371] $Ultimate##0-->L74-4: Formula: (let ((.cse4 (= v_~name_3~0_135 v_~name_1~0_131))) (let ((.cse3 (= v_~current_10~0_112 v_~name_1~0_131)) (.cse2 (ite .cse4 1 0))) (let ((.cse1 (ite .cse3 1 .cse2))) (let ((.cse0 (and (= .cse1 0) (= v_~name_3~0_135 v_~current_10~0_112)))) (and (= (ite .cse0 1 .cse1) v_~break_11~0_173) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127| (ite (= .cse2 0) 1 0)) (= v_~result_8~0_194 (ite .cse0 (- 1) (ite .cse3 1 (ite .cse4 0 v_~result_8~0_196)))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_155| 0)) (= v_~i_9~0_129 1) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_82| 256) 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_155| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127|) (= (select (select |v_#memory_int_167| v_~nondet_0~0.base_110) v_~nondet_0~0.offset_110) v_~current_10~0_112)))))) InVars {~name_3~0=v_~name_3~0_135, ~name_1~0=v_~name_1~0_131, #memory_int=|v_#memory_int_167|, ~result_8~0=v_~result_8~0_196, ~nondet_0~0.base=v_~nondet_0~0.base_110, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_82|, ~nondet_0~0.offset=v_~nondet_0~0.offset_110} OutVars{~name_3~0=v_~name_3~0_135, ~name_1~0=v_~name_1~0_131, ~current_10~0=v_~current_10~0_112, ~result_8~0=v_~result_8~0_194, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127|, ~nondet_0~0.base=v_~nondet_0~0.base_110, ~nondet_0~0.offset=v_~nondet_0~0.offset_110, ~break_11~0=v_~break_11~0_173, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_51|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_155|, #memory_int=|v_#memory_int_167|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_29|, ~i_9~0=v_~i_9~0_129} AuxVars[] AssignedVars[~break_11~0, thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~current_10~0, thread2Thread1of1ForFork2_#t~post8#1, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet6#1, ~i_9~0] [2022-12-06 05:07:15,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1375] $Ultimate##0-->L96-4: Formula: (let ((.cse4 (= v_~name_2~0_133 v_~name_3~0_142))) (let ((.cse3 (= v_~name_2~0_133 v_~current_14~0_98)) (.cse0 (ite .cse4 1 0))) (let ((.cse2 (ite .cse3 1 .cse0))) (let ((.cse1 (and (= v_~name_3~0_142 v_~current_14~0_98) (= .cse2 0)))) (and (= v_~i_13~0_129 1) (= v_~current_14~0_98 (select (select |v_#memory_int_179| v_~nondet_0~0.base_119) (+ (- 4) (* v_~i_13~0_129 4) v_~nondet_0~0.offset_119))) (= (ite (and (= .cse0 0) (< v_~i_13~0_129 4)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|) (= (ite .cse1 1 .cse2) v_~break_15~0_169) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_123| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|) (= v_~result_12~0_188 (ite .cse1 (- 1) (ite .cse3 1 (ite .cse4 0 v_~result_12~0_190)))) (not (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_56| 256) 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_123| 0))))))) InVars {~name_2~0=v_~name_2~0_133, ~name_3~0=v_~name_3~0_142, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_56|, #memory_int=|v_#memory_int_179|, ~result_12~0=v_~result_12~0_190, ~nondet_0~0.base=v_~nondet_0~0.base_119, ~nondet_0~0.offset=v_~nondet_0~0.offset_119} OutVars{~name_2~0=v_~name_2~0_133, ~name_3~0=v_~name_3~0_142, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|, ~current_14~0=v_~current_14~0_98, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_123|, ~break_15~0=v_~break_15~0_169, ~nondet_0~0.base=v_~nondet_0~0.base_119, ~nondet_0~0.offset=v_~nondet_0~0.offset_119, thread3Thread1of1ForFork0_#t~post13#1=|v_thread3Thread1of1ForFork0_#t~post13#1_23|, ~i_13~0=v_~i_13~0_129, #memory_int=|v_#memory_int_179|, ~result_12~0=v_~result_12~0_188, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_41|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~post13#1, ~i_13~0, ~current_14~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~break_15~0, ~result_12~0, thread3Thread1of1ForFork0_#t~mem12#1] and [1371] $Ultimate##0-->L74-4: Formula: (let ((.cse4 (= v_~name_3~0_135 v_~name_1~0_131))) (let ((.cse3 (= v_~current_10~0_112 v_~name_1~0_131)) (.cse2 (ite .cse4 1 0))) (let ((.cse1 (ite .cse3 1 .cse2))) (let ((.cse0 (and (= .cse1 0) (= v_~name_3~0_135 v_~current_10~0_112)))) (and (= (ite .cse0 1 .cse1) v_~break_11~0_173) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127| (ite (= .cse2 0) 1 0)) (= v_~result_8~0_194 (ite .cse0 (- 1) (ite .cse3 1 (ite .cse4 0 v_~result_8~0_196)))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_155| 0)) (= v_~i_9~0_129 1) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_82| 256) 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_155| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127|) (= (select (select |v_#memory_int_167| v_~nondet_0~0.base_110) v_~nondet_0~0.offset_110) v_~current_10~0_112)))))) InVars {~name_3~0=v_~name_3~0_135, ~name_1~0=v_~name_1~0_131, #memory_int=|v_#memory_int_167|, ~result_8~0=v_~result_8~0_196, ~nondet_0~0.base=v_~nondet_0~0.base_110, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_82|, ~nondet_0~0.offset=v_~nondet_0~0.offset_110} OutVars{~name_3~0=v_~name_3~0_135, ~name_1~0=v_~name_1~0_131, ~current_10~0=v_~current_10~0_112, ~result_8~0=v_~result_8~0_194, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127|, ~nondet_0~0.base=v_~nondet_0~0.base_110, ~nondet_0~0.offset=v_~nondet_0~0.offset_110, ~break_11~0=v_~break_11~0_173, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_51|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_155|, #memory_int=|v_#memory_int_167|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_29|, ~i_9~0=v_~i_9~0_129} AuxVars[] AssignedVars[~break_11~0, thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~current_10~0, thread2Thread1of1ForFork2_#t~post8#1, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet6#1, ~i_9~0] [2022-12-06 05:07:15,848 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:15,848 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 286 [2022-12-06 05:07:15,848 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 1508 flow [2022-12-06 05:07:15,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:15,848 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:15,848 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:15,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 05:07:15,849 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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:15,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:15,849 INFO L85 PathProgramCache]: Analyzing trace with hash -692942154, now seen corresponding path program 1 times [2022-12-06 05:07:15,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:15,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369002930] [2022-12-06 05:07:15,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:15,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:17,227 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:17,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:17,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369002930] [2022-12-06 05:07:17,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369002930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:17,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:17,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 05:07:17,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090516175] [2022-12-06 05:07:17,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:17,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:07:17,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:17,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:07:17,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:07:17,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:07:17,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 1508 flow. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:17,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:17,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:07:17,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:18,300 INFO L130 PetriNetUnfolder]: 2182/3541 cut-off events. [2022-12-06 05:07:18,300 INFO L131 PetriNetUnfolder]: For 25832/25832 co-relation queries the response was YES. [2022-12-06 05:07:18,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15899 conditions, 3541 events. 2182/3541 cut-off events. For 25832/25832 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 19716 event pairs, 875 based on Foata normal form. 1/3325 useless extension candidates. Maximal degree in co-relation 14717. Up to 1840 conditions per place. [2022-12-06 05:07:18,315 INFO L137 encePairwiseOnDemand]: 22/35 looper letters, 134 selfloop transitions, 28 changer transitions 3/165 dead transitions. [2022-12-06 05:07:18,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 165 transitions, 2069 flow [2022-12-06 05:07:18,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:07:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:07:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-12-06 05:07:18,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2022-12-06 05:07:18,328 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 1508 flow. Second operand 8 states and 96 transitions. [2022-12-06 05:07:18,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 165 transitions, 2069 flow [2022-12-06 05:07:18,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 165 transitions, 1940 flow, removed 25 selfloop flow, removed 3 redundant places. [2022-12-06 05:07:18,374 INFO L231 Difference]: Finished difference. Result has 115 places, 109 transitions, 1491 flow [2022-12-06 05:07:18,374 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1491, PETRI_PLACES=115, PETRI_TRANSITIONS=109} [2022-12-06 05:07:18,375 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2022-12-06 05:07:18,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:18,375 INFO L89 Accepts]: Start accepts. Operand has 115 places, 109 transitions, 1491 flow [2022-12-06 05:07:18,376 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:18,376 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:18,376 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 109 transitions, 1491 flow [2022-12-06 05:07:18,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 109 transitions, 1491 flow [2022-12-06 05:07:18,426 INFO L130 PetriNetUnfolder]: 109/534 cut-off events. [2022-12-06 05:07:18,426 INFO L131 PetriNetUnfolder]: For 3677/3852 co-relation queries the response was YES. [2022-12-06 05:07:18,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1936 conditions, 534 events. 109/534 cut-off events. For 3677/3852 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4270 event pairs, 10 based on Foata normal form. 6/479 useless extension candidates. Maximal degree in co-relation 1708. Up to 79 conditions per place. [2022-12-06 05:07:18,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 109 transitions, 1491 flow [2022-12-06 05:07:18,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 992 [2022-12-06 05:07:18,474 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1365] L96-4-->thread3EXIT: Formula: (let ((.cse0 (= v_~break_15~0_In_20 0))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_20| 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_20| 0)) (.cse2 (ite (not (and .cse0 (< v_~i_13~0_In_13 3))) 1 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_36|)) (.cse5 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_In_5| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|)) (= v_~name_2~0_In_28 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14| v_~name_3~0_In_25) .cse0 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14|)) 1 0)) .cse1 (not (= 0 .cse2)) .cse3 (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| 2147483647) (= v_~result_12~0_Out_62 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|) .cse4 (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| 2147483648)) .cse5 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|)) (and (not .cse0) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_6|) .cse1 .cse3 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_11|) (= v_~result_12~0_Out_62 v_~result_12~0_In_14) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| .cse2) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| |v_thread3Thread1of1ForFork0_minus_#res#1_In_5|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~b#1_In_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|) .cse4 .cse5)))) InVars {~name_2~0=v_~name_2~0_In_28, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_In_5|, ~name_3~0=v_~name_3~0_In_25, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_5|, ~i_13~0=v_~i_13~0_In_13, ~break_15~0=v_~break_15~0_In_20, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_10|, ~result_12~0=v_~result_12~0_In_14, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_11|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_6|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_6|} OutVars{~name_2~0=v_~name_2~0_In_28, ~name_3~0=v_~name_3~0_In_25, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_36|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_20|, ~break_15~0=v_~break_15~0_In_20, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_Out_26|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_20|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|, ~i_13~0=v_~i_13~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_14|, ~result_12~0=v_~result_12~0_Out_62, thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_Out_20|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_minus_~b#1, ~result_12~0, thread3Thread1of1ForFork0_#t~ite15#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [1347] L74-4-->L74-4: Formula: (let ((.cse1 (= v_~current_10~0_Out_38 v_~name_1~0_In_23))) (let ((.cse2 (ite .cse1 1 v_~break_11~0_In_11))) (let ((.cse0 (and (= v_~current_10~0_Out_38 v_~name_3~0_In_20) (= .cse2 0)))) (and (= (ite .cse0 (- 1) (ite .cse1 1 v_~result_8~0_In_9)) v_~result_8~0_Out_50) (= v_~break_11~0_Out_42 (ite .cse0 1 .cse2)) (= v_~current_10~0_Out_38 (select (select |v_#memory_int_In_30| v_~nondet_0~0.base_In_14) (+ (* v_~i_9~0_In_8 4) v_~nondet_0~0.offset_In_14))) (= (ite (and (< v_~i_9~0_In_8 3) (= v_~break_11~0_In_11 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_24|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_34| 0)) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_3| 256) 0)) (= v_~i_9~0_Out_24 (+ v_~i_9~0_In_8 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_34| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_24|))))) InVars {~name_3~0=v_~name_3~0_In_20, ~break_11~0=v_~break_11~0_In_11, ~name_1~0=v_~name_1~0_In_23, #memory_int=|v_#memory_int_In_30|, ~result_8~0=v_~result_8~0_In_9, ~nondet_0~0.base=v_~nondet_0~0.base_In_14, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_3|, ~i_9~0=v_~i_9~0_In_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_In_14} OutVars{~name_3~0=v_~name_3~0_In_20, ~name_1~0=v_~name_1~0_In_23, ~current_10~0=v_~current_10~0_Out_38, ~result_8~0=v_~result_8~0_Out_50, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_24|, ~nondet_0~0.base=v_~nondet_0~0.base_In_14, ~nondet_0~0.offset=v_~nondet_0~0.offset_In_14, ~break_11~0=v_~break_11~0_Out_42, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_Out_12|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_34|, #memory_int=|v_#memory_int_In_30|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_Out_8|, ~i_9~0=v_~i_9~0_Out_24} AuxVars[] AssignedVars[~break_11~0, thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~current_10~0, thread2Thread1of1ForFork2_#t~post8#1, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet6#1, ~i_9~0] [2022-12-06 05:07:18,818 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1365] L96-4-->thread3EXIT: Formula: (let ((.cse0 (= v_~break_15~0_In_20 0))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_20| 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_20| 0)) (.cse2 (ite (not (and .cse0 (< v_~i_13~0_In_13 3))) 1 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_36|)) (.cse5 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_In_5| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|)) (= v_~name_2~0_In_28 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14| v_~name_3~0_In_25) .cse0 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14|)) 1 0)) .cse1 (not (= 0 .cse2)) .cse3 (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| 2147483647) (= v_~result_12~0_Out_62 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|) .cse4 (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| 2147483648)) .cse5 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|)) (and (not .cse0) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_6|) .cse1 .cse3 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_11|) (= v_~result_12~0_Out_62 v_~result_12~0_In_14) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| .cse2) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| |v_thread3Thread1of1ForFork0_minus_#res#1_In_5|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~b#1_In_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|) .cse4 .cse5)))) InVars {~name_2~0=v_~name_2~0_In_28, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_In_5|, ~name_3~0=v_~name_3~0_In_25, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_5|, ~i_13~0=v_~i_13~0_In_13, ~break_15~0=v_~break_15~0_In_20, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_10|, ~result_12~0=v_~result_12~0_In_14, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_11|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_6|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_6|} OutVars{~name_2~0=v_~name_2~0_In_28, ~name_3~0=v_~name_3~0_In_25, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_36|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_20|, ~break_15~0=v_~break_15~0_In_20, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_Out_26|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_20|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|, ~i_13~0=v_~i_13~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_14|, ~result_12~0=v_~result_12~0_Out_62, thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_Out_20|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_minus_~b#1, ~result_12~0, thread3Thread1of1ForFork0_#t~ite15#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [1366] L74-4-->thread2EXIT: Formula: (let ((.cse0 (= v_~break_11~0_In_15 0))) (let ((.cse1 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_44| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32|)) (.cse2 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_5| 256) 0)) (.cse3 (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_16| 0)) (.cse4 (ite (not (and .cse0 (< v_~i_9~0_In_11 3))) 1 0)) (.cse5 (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_16| 0))) (or (and (not .cse0) (= v_~result_8~0_Out_58 v_~result_8~0_In_14) (= |v_thread2Thread1of1ForFork2_minus_#res#1_In_4| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|) .cse1 .cse2 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_In_3| |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| |v_thread2Thread1of1ForFork2_minus_#in~b#1_In_4|) .cse3 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32| .cse4) (= |v_thread2Thread1of1ForFork2_minus_~a#1_In_11| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_In_11| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|) .cse5) (and (<= v_~result_8~0_Out_58 2147483647) .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10| v_~name_1~0_In_29) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|) .cse3 (<= 0 (+ v_~result_8~0_Out_58 2147483648)) (not (= 0 .cse4)) (= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14| (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|)) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| v_~name_3~0_In_27) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32|) (= v_~result_8~0_Out_58 |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|) .cse5)))) InVars {~name_3~0=v_~name_3~0_In_27, ~break_11~0=v_~break_11~0_In_15, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_In_11|, ~name_1~0=v_~name_1~0_In_29, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_In_11|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_In_3|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_In_4|, ~result_8~0=v_~result_8~0_In_14, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_In_4|, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_5|, ~i_9~0=v_~i_9~0_In_11} OutVars{thread2Thread1of1ForFork2_#t~ite10#1=|v_thread2Thread1of1ForFork2_#t~ite10#1_Out_18|, ~name_3~0=v_~name_3~0_In_27, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_16|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|, ~name_1~0=v_~name_1~0_In_29, ~result_8~0=v_~result_8~0_Out_58, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_16|, thread2Thread1of1ForFork2_#t~ret9#1=|v_thread2Thread1of1ForFork2_#t~ret9#1_Out_16|, ~break_11~0=v_~break_11~0_In_15, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_44|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10|, ~i_9~0=v_~i_9~0_In_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~ite10#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_#t~ret9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 05:07:19,302 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:19,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 927 [2022-12-06 05:07:19,302 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 108 transitions, 1495 flow [2022-12-06 05:07:19,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:19,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:19,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:19,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 05:07:19,303 INFO L420 AbstractCegarLoop]: === Iteration 25 === 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:19,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:19,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1243895489, now seen corresponding path program 1 times [2022-12-06 05:07:19,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:19,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88808072] [2022-12-06 05:07:19,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:19,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:20,428 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:20,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:20,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88808072] [2022-12-06 05:07:20,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88808072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:20,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:20,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:07:20,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409229383] [2022-12-06 05:07:20,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:20,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:07:20,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:20,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:07:20,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:07:20,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:07:20,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 108 transitions, 1495 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:20,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:20,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:07:20,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:21,195 INFO L130 PetriNetUnfolder]: 2203/3568 cut-off events. [2022-12-06 05:07:21,195 INFO L131 PetriNetUnfolder]: For 24250/24250 co-relation queries the response was YES. [2022-12-06 05:07:21,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16634 conditions, 3568 events. 2203/3568 cut-off events. For 24250/24250 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 19732 event pairs, 963 based on Foata normal form. 1/3352 useless extension candidates. Maximal degree in co-relation 15414. Up to 1976 conditions per place. [2022-12-06 05:07:21,212 INFO L137 encePairwiseOnDemand]: 27/36 looper letters, 117 selfloop transitions, 19 changer transitions 8/144 dead transitions. [2022-12-06 05:07:21,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 144 transitions, 1974 flow [2022-12-06 05:07:21,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:07:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:07:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-06 05:07:21,213 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 05:07:21,213 INFO L175 Difference]: Start difference. First operand has 114 places, 108 transitions, 1495 flow. Second operand 6 states and 72 transitions. [2022-12-06 05:07:21,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 144 transitions, 1974 flow [2022-12-06 05:07:21,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 144 transitions, 1921 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-06 05:07:21,267 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 1551 flow [2022-12-06 05:07:21,267 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1551, PETRI_PLACES=119, PETRI_TRANSITIONS=112} [2022-12-06 05:07:21,267 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2022-12-06 05:07:21,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:21,267 INFO L89 Accepts]: Start accepts. Operand has 119 places, 112 transitions, 1551 flow [2022-12-06 05:07:21,268 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:21,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:21,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 112 transitions, 1551 flow [2022-12-06 05:07:21,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 112 transitions, 1551 flow [2022-12-06 05:07:21,323 INFO L130 PetriNetUnfolder]: 111/536 cut-off events. [2022-12-06 05:07:21,324 INFO L131 PetriNetUnfolder]: For 3708/3821 co-relation queries the response was YES. [2022-12-06 05:07:21,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1977 conditions, 536 events. 111/536 cut-off events. For 3708/3821 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4298 event pairs, 8 based on Foata normal form. 9/486 useless extension candidates. Maximal degree in co-relation 1857. Up to 77 conditions per place. [2022-12-06 05:07:21,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 112 transitions, 1551 flow [2022-12-06 05:07:21,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 1010 [2022-12-06 05:07:21,330 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1393] $Ultimate##0-->L74-4: Formula: (let ((.cse10 (= v_~name_2~0_187 v_~name_3~0_184)) (.cse2 (= v_~name_3~0_184 v_~name_1~0_190))) (let ((.cse1 (= v_~current_10~0_126 v_~name_1~0_190)) (.cse6 (ite .cse2 1 0)) (.cse9 (= v_~name_2~0_187 v_~current_14~0_114)) (.cse4 (ite .cse10 1 0))) (let ((.cse8 (ite .cse9 1 .cse4)) (.cse5 (ite .cse1 1 .cse6))) (let ((.cse0 (and (= v_~name_3~0_184 v_~current_10~0_126) (= .cse5 0))) (.cse3 (select |v_#memory_int_245| v_~nondet_0~0.base_160)) (.cse7 (and (= v_~current_14~0_114 v_~name_3~0_184) (= .cse8 0)))) (and (= v_~result_8~0_246 (ite .cse0 (- 1) (ite .cse1 1 (ite .cse2 0 v_~result_8~0_247)))) (= (select .cse3 v_~nondet_0~0.offset_160) v_~current_10~0_126) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_155| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133|) (= (ite (and (= .cse4 0) (< v_~i_13~0_165 4)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_177| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_149|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_177| 0)) (= v_~break_11~0_211 (ite .cse0 1 .cse5)) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_126| 256) 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_155| 0)) (= v_~i_9~0_167 1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_149| (ite (= .cse6 0) 1 0)) (= v_~i_13~0_165 1) (= (select .cse3 (+ (* v_~i_13~0_165 4) (- 4) v_~nondet_0~0.offset_160)) v_~current_14~0_114) (= v_~break_15~0_205 (ite .cse7 1 .cse8)) (not (= 0 (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_114| 256))) (= v_~result_12~0_250 (ite .cse7 (- 1) (ite .cse9 1 (ite .cse10 0 v_~result_12~0_251))))))))) InVars {~name_2~0=v_~name_2~0_187, ~name_3~0=v_~name_3~0_184, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_114|, ~name_1~0=v_~name_1~0_190, #memory_int=|v_#memory_int_245|, ~result_8~0=v_~result_8~0_247, ~result_12~0=v_~result_12~0_251, ~nondet_0~0.base=v_~nondet_0~0.base_160, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_126|, ~nondet_0~0.offset=v_~nondet_0~0.offset_160} OutVars{~name_2~0=v_~name_2~0_187, ~name_3~0=v_~name_3~0_184, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133|, ~current_14~0=v_~current_14~0_114, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_155|, ~name_1~0=v_~name_1~0_190, ~current_10~0=v_~current_10~0_126, ~break_15~0=v_~break_15~0_205, ~result_8~0=v_~result_8~0_246, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_149|, ~nondet_0~0.base=v_~nondet_0~0.base_160, ~nondet_0~0.offset=v_~nondet_0~0.offset_160, ~break_11~0=v_~break_11~0_211, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_65|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_177|, thread3Thread1of1ForFork0_#t~post13#1=|v_thread3Thread1of1ForFork0_#t~post13#1_39|, ~i_13~0=v_~i_13~0_165, #memory_int=|v_#memory_int_245|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_43|, ~result_12~0=v_~result_12~0_250, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_57|, ~i_9~0=v_~i_9~0_167} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~current_14~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~current_10~0, ~break_15~0, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~break_11~0, thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post13#1, ~i_13~0, thread2Thread1of1ForFork2_#t~post8#1, ~result_12~0, thread3Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork2_#t~nondet6#1, ~i_9~0] and [1335] L96-4-->L96-4: Formula: (let ((.cse2 (= v_~current_14~0_Out_34 v_~name_2~0_In_17))) (let ((.cse1 (ite .cse2 1 v_~break_15~0_In_14))) (let ((.cse0 (and (= .cse1 0) (= v_~current_14~0_Out_34 v_~name_3~0_In_16)))) (and (= (ite .cse0 1 .cse1) v_~break_15~0_Out_46) (not (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_In_1| 256) 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_24| 0)) (= (ite .cse0 (- 1) (ite .cse2 1 v_~result_12~0_In_8)) v_~result_12~0_Out_52) (= v_~current_14~0_Out_34 (select (select |v_#memory_int_In_26| v_~nondet_0~0.base_In_10) (+ v_~nondet_0~0.offset_In_10 (* v_~i_13~0_In_9 4)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_24| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_24|) (= (+ v_~i_13~0_In_9 1) v_~i_13~0_Out_40) (= (ite (and (= v_~break_15~0_In_14 0) (< v_~i_13~0_In_9 3)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_24|))))) InVars {~name_2~0=v_~name_2~0_In_17, ~name_3~0=v_~name_3~0_In_16, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_In_1|, ~i_13~0=v_~i_13~0_In_9, ~break_15~0=v_~break_15~0_In_14, #memory_int=|v_#memory_int_In_26|, ~result_12~0=v_~result_12~0_In_8, ~nondet_0~0.base=v_~nondet_0~0.base_In_10, ~nondet_0~0.offset=v_~nondet_0~0.offset_In_10} OutVars{~name_2~0=v_~name_2~0_In_17, ~name_3~0=v_~name_3~0_In_16, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_24|, ~current_14~0=v_~current_14~0_Out_34, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_24|, ~break_15~0=v_~break_15~0_Out_46, ~nondet_0~0.base=v_~nondet_0~0.base_In_10, ~nondet_0~0.offset=v_~nondet_0~0.offset_In_10, thread3Thread1of1ForFork0_#t~post13#1=|v_thread3Thread1of1ForFork0_#t~post13#1_Out_8|, ~i_13~0=v_~i_13~0_Out_40, #memory_int=|v_#memory_int_In_26|, ~result_12~0=v_~result_12~0_Out_52, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_Out_12|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~post13#1, ~i_13~0, ~current_14~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~break_15~0, ~result_12~0, thread3Thread1of1ForFork0_#t~mem12#1] [2022-12-06 05:07:21,855 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1393] $Ultimate##0-->L74-4: Formula: (let ((.cse10 (= v_~name_2~0_187 v_~name_3~0_184)) (.cse2 (= v_~name_3~0_184 v_~name_1~0_190))) (let ((.cse1 (= v_~current_10~0_126 v_~name_1~0_190)) (.cse6 (ite .cse2 1 0)) (.cse9 (= v_~name_2~0_187 v_~current_14~0_114)) (.cse4 (ite .cse10 1 0))) (let ((.cse8 (ite .cse9 1 .cse4)) (.cse5 (ite .cse1 1 .cse6))) (let ((.cse0 (and (= v_~name_3~0_184 v_~current_10~0_126) (= .cse5 0))) (.cse3 (select |v_#memory_int_245| v_~nondet_0~0.base_160)) (.cse7 (and (= v_~current_14~0_114 v_~name_3~0_184) (= .cse8 0)))) (and (= v_~result_8~0_246 (ite .cse0 (- 1) (ite .cse1 1 (ite .cse2 0 v_~result_8~0_247)))) (= (select .cse3 v_~nondet_0~0.offset_160) v_~current_10~0_126) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_155| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133|) (= (ite (and (= .cse4 0) (< v_~i_13~0_165 4)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_177| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_149|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_177| 0)) (= v_~break_11~0_211 (ite .cse0 1 .cse5)) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_126| 256) 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_155| 0)) (= v_~i_9~0_167 1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_149| (ite (= .cse6 0) 1 0)) (= v_~i_13~0_165 1) (= (select .cse3 (+ (* v_~i_13~0_165 4) (- 4) v_~nondet_0~0.offset_160)) v_~current_14~0_114) (= v_~break_15~0_205 (ite .cse7 1 .cse8)) (not (= 0 (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_114| 256))) (= v_~result_12~0_250 (ite .cse7 (- 1) (ite .cse9 1 (ite .cse10 0 v_~result_12~0_251))))))))) InVars {~name_2~0=v_~name_2~0_187, ~name_3~0=v_~name_3~0_184, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_114|, ~name_1~0=v_~name_1~0_190, #memory_int=|v_#memory_int_245|, ~result_8~0=v_~result_8~0_247, ~result_12~0=v_~result_12~0_251, ~nondet_0~0.base=v_~nondet_0~0.base_160, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_126|, ~nondet_0~0.offset=v_~nondet_0~0.offset_160} OutVars{~name_2~0=v_~name_2~0_187, ~name_3~0=v_~name_3~0_184, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133|, ~current_14~0=v_~current_14~0_114, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_155|, ~name_1~0=v_~name_1~0_190, ~current_10~0=v_~current_10~0_126, ~break_15~0=v_~break_15~0_205, ~result_8~0=v_~result_8~0_246, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_149|, ~nondet_0~0.base=v_~nondet_0~0.base_160, ~nondet_0~0.offset=v_~nondet_0~0.offset_160, ~break_11~0=v_~break_11~0_211, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_65|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_177|, thread3Thread1of1ForFork0_#t~post13#1=|v_thread3Thread1of1ForFork0_#t~post13#1_39|, ~i_13~0=v_~i_13~0_165, #memory_int=|v_#memory_int_245|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_43|, ~result_12~0=v_~result_12~0_250, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_57|, ~i_9~0=v_~i_9~0_167} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~current_14~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~current_10~0, ~break_15~0, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~break_11~0, thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post13#1, ~i_13~0, thread2Thread1of1ForFork2_#t~post8#1, ~result_12~0, thread3Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork2_#t~nondet6#1, ~i_9~0] and [1395] L96-4-->L74-4: Formula: (let ((.cse2 (= v_~current_10~0_130 v_~name_1~0_194))) (let ((.cse1 (ite .cse2 1 v_~break_11~0_216))) (let ((.cse0 (and (= v_~name_3~0_188 v_~current_10~0_130) (= .cse1 0)))) (and (= (ite (and (< v_~i_9~0_172 3) (= v_~break_11~0_216 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_153|) (= (select (select |v_#memory_int_249| v_~nondet_0~0.base_164) (+ (* v_~i_9~0_172 4) v_~nondet_0~0.offset_164)) v_~current_10~0_130) (= v_~break_11~0_215 (ite .cse0 1 .cse1)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_181| 0)) (= v_~i_9~0_171 (+ v_~i_9~0_172 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_181| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_153|) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_134| 256) 0)) (= v_~result_8~0_254 (ite .cse0 (- 1) (ite .cse2 1 v_~result_8~0_255))) (let ((.cse7 (= v_~break_15~0_209 0))) (let ((.cse3 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_122| 256) 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_159| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137|)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_45| 0)) (.cse5 (ite (not (and .cse7 (< v_~i_13~0_169 3))) 1 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_45| 0))) (or (and .cse3 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_64| |v_thread3Thread1of1ForFork0_minus_#in~b#1_63|) .cse4 (= |v_thread3Thread1of1ForFork0_minus_~b#1_84| |v_thread3Thread1of1ForFork0_minus_~b#1_83|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137| .cse5) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_64| |v_thread3Thread1of1ForFork0_minus_#in~a#1_63|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_84| |v_thread3Thread1of1ForFork0_minus_~a#1_83|) .cse6 (not .cse7) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_78| |v_thread3Thread1of1ForFork0_minus_#res#1_77|) (= v_~result_12~0_259 v_~result_12~0_258)) (and .cse3 (= v_~name_2~0_191 |v_thread3Thread1of1ForFork0_minus_#in~a#1_63|) .cse4 (= v_~result_12~0_258 |v_thread3Thread1of1ForFork0_minus_#res#1_77|) .cse7 (<= |v_thread3Thread1of1ForFork0_minus_#res#1_77| 2147483647) (= |v_thread3Thread1of1ForFork0_minus_~b#1_83| |v_thread3Thread1of1ForFork0_minus_#in~b#1_63|) (= (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_83| (+ 2147483647 |v_thread3Thread1of1ForFork0_minus_~b#1_83|)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_83|)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_83| |v_thread3Thread1of1ForFork0_minus_#in~a#1_63|) .cse6 (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_77| 2147483648)) (not (= .cse5 0)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_83| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_83| |v_thread3Thread1of1ForFork0_minus_#res#1_77|)) .cse8 (= v_~name_3~0_188 |v_thread3Thread1of1ForFork0_minus_#in~b#1_63|))))))))) InVars {~name_2~0=v_~name_2~0_191, ~name_3~0=v_~name_3~0_188, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_122|, ~name_1~0=v_~name_1~0_194, ~break_15~0=v_~break_15~0_209, ~result_8~0=v_~result_8~0_255, ~nondet_0~0.base=v_~nondet_0~0.base_164, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_84|, ~nondet_0~0.offset=v_~nondet_0~0.offset_164, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_64|, ~break_11~0=v_~break_11~0_216, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_78|, ~i_13~0=v_~i_13~0_169, #memory_int=|v_#memory_int_249|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_84|, ~result_12~0=v_~result_12~0_259, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_134|, ~i_9~0=v_~i_9~0_172, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_64|} OutVars{~name_2~0=v_~name_2~0_191, ~current_10~0=v_~current_10~0_130, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_45|, ~break_15~0=v_~break_15~0_209, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_153|, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_79|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_83|, ~nondet_0~0.offset=v_~nondet_0~0.offset_164, ~break_11~0=v_~break_11~0_215, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_83|, ~i_9~0=v_~i_9~0_171, ~name_3~0=v_~name_3~0_188, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_159|, ~name_1~0=v_~name_1~0_194, ~result_8~0=v_~result_8~0_254, ~nondet_0~0.base=v_~nondet_0~0.base_164, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_63|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_45|, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_69|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_77|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_181|, ~i_13~0=v_~i_13~0_169, #memory_int=|v_#memory_int_249|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_47|, ~result_12~0=v_~result_12~0_258, thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_65|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_63|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~current_10~0, thread3Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~result_8~0, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, ~break_11~0, thread2Thread1of1ForFork2_#t~mem7#1, thread3Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork2_#t~post8#1, ~result_12~0, thread3Thread1of1ForFork0_#t~ite15#1, thread2Thread1of1ForFork2_#t~nondet6#1, ~i_9~0, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 05:07:22,340 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:22,341 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1074 [2022-12-06 05:07:22,341 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 112 transitions, 1618 flow [2022-12-06 05:07:22,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:22,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:22,341 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:22,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 05:07:22,342 INFO L420 AbstractCegarLoop]: === Iteration 26 === 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:22,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:22,342 INFO L85 PathProgramCache]: Analyzing trace with hash 384803435, now seen corresponding path program 1 times [2022-12-06 05:07:22,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:22,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790592577] [2022-12-06 05:07:22,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:22,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:23,214 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:23,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:23,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790592577] [2022-12-06 05:07:23,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790592577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:23,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:23,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:07:23,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393923480] [2022-12-06 05:07:23,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:23,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:07:23,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:23,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:07:23,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:07:23,216 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:07:23,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 112 transitions, 1618 flow. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:23,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:23,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:07:23,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:24,138 INFO L130 PetriNetUnfolder]: 2437/4011 cut-off events. [2022-12-06 05:07:24,138 INFO L131 PetriNetUnfolder]: For 26703/26703 co-relation queries the response was YES. [2022-12-06 05:07:24,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18716 conditions, 4011 events. 2437/4011 cut-off events. For 26703/26703 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 23384 event pairs, 946 based on Foata normal form. 6/3770 useless extension candidates. Maximal degree in co-relation 18526. Up to 1889 conditions per place. [2022-12-06 05:07:24,159 INFO L137 encePairwiseOnDemand]: 20/39 looper letters, 145 selfloop transitions, 37 changer transitions 4/186 dead transitions. [2022-12-06 05:07:24,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 186 transitions, 2400 flow [2022-12-06 05:07:24,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:07:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:07:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-06 05:07:24,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34294871794871795 [2022-12-06 05:07:24,161 INFO L175 Difference]: Start difference. First operand has 118 places, 112 transitions, 1618 flow. Second operand 8 states and 107 transitions. [2022-12-06 05:07:24,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 186 transitions, 2400 flow [2022-12-06 05:07:24,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 186 transitions, 2338 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 05:07:24,247 INFO L231 Difference]: Finished difference. Result has 124 places, 121 transitions, 1784 flow [2022-12-06 05:07:24,247 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1537, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1784, PETRI_PLACES=124, PETRI_TRANSITIONS=121} [2022-12-06 05:07:24,248 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 94 predicate places. [2022-12-06 05:07:24,248 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:24,248 INFO L89 Accepts]: Start accepts. Operand has 124 places, 121 transitions, 1784 flow [2022-12-06 05:07:24,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:24,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:24,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 121 transitions, 1784 flow [2022-12-06 05:07:24,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 121 transitions, 1784 flow [2022-12-06 05:07:24,309 INFO L130 PetriNetUnfolder]: 119/629 cut-off events. [2022-12-06 05:07:24,309 INFO L131 PetriNetUnfolder]: For 4576/4692 co-relation queries the response was YES. [2022-12-06 05:07:24,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 629 events. 119/629 cut-off events. For 4576/4692 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5390 event pairs, 12 based on Foata normal form. 5/565 useless extension candidates. Maximal degree in co-relation 2054. Up to 98 conditions per place. [2022-12-06 05:07:24,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 121 transitions, 1784 flow [2022-12-06 05:07:24,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-06 05:07:24,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1365] L96-4-->thread3EXIT: Formula: (let ((.cse0 (= v_~break_15~0_In_20 0))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_20| 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_20| 0)) (.cse2 (ite (not (and .cse0 (< v_~i_13~0_In_13 3))) 1 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_36|)) (.cse5 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_In_5| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|)) (= v_~name_2~0_In_28 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14| v_~name_3~0_In_25) .cse0 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14|)) 1 0)) .cse1 (not (= 0 .cse2)) .cse3 (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| 2147483647) (= v_~result_12~0_Out_62 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|) .cse4 (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| 2147483648)) .cse5 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|)) (and (not .cse0) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_6|) .cse1 .cse3 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_11|) (= v_~result_12~0_Out_62 v_~result_12~0_In_14) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| .cse2) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| |v_thread3Thread1of1ForFork0_minus_#res#1_In_5|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~b#1_In_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|) .cse4 .cse5)))) InVars {~name_2~0=v_~name_2~0_In_28, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_In_5|, ~name_3~0=v_~name_3~0_In_25, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_5|, ~i_13~0=v_~i_13~0_In_13, ~break_15~0=v_~break_15~0_In_20, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_10|, ~result_12~0=v_~result_12~0_In_14, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_11|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_6|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_6|} OutVars{~name_2~0=v_~name_2~0_In_28, ~name_3~0=v_~name_3~0_In_25, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_36|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_20|, ~break_15~0=v_~break_15~0_In_20, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_Out_26|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_20|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|, ~i_13~0=v_~i_13~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_14|, ~result_12~0=v_~result_12~0_Out_62, thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_Out_20|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_minus_~b#1, ~result_12~0, thread3Thread1of1ForFork0_#t~ite15#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [1366] L74-4-->thread2EXIT: Formula: (let ((.cse0 (= v_~break_11~0_In_15 0))) (let ((.cse1 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_44| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32|)) (.cse2 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_5| 256) 0)) (.cse3 (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_16| 0)) (.cse4 (ite (not (and .cse0 (< v_~i_9~0_In_11 3))) 1 0)) (.cse5 (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_16| 0))) (or (and (not .cse0) (= v_~result_8~0_Out_58 v_~result_8~0_In_14) (= |v_thread2Thread1of1ForFork2_minus_#res#1_In_4| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|) .cse1 .cse2 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_In_3| |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| |v_thread2Thread1of1ForFork2_minus_#in~b#1_In_4|) .cse3 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32| .cse4) (= |v_thread2Thread1of1ForFork2_minus_~a#1_In_11| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_In_11| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|) .cse5) (and (<= v_~result_8~0_Out_58 2147483647) .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10| v_~name_1~0_In_29) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|) .cse3 (<= 0 (+ v_~result_8~0_Out_58 2147483648)) (not (= 0 .cse4)) (= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14| (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|)) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| v_~name_3~0_In_27) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32|) (= v_~result_8~0_Out_58 |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|) .cse5)))) InVars {~name_3~0=v_~name_3~0_In_27, ~break_11~0=v_~break_11~0_In_15, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_In_11|, ~name_1~0=v_~name_1~0_In_29, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_In_11|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_In_3|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_In_4|, ~result_8~0=v_~result_8~0_In_14, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_In_4|, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_5|, ~i_9~0=v_~i_9~0_In_11} OutVars{thread2Thread1of1ForFork2_#t~ite10#1=|v_thread2Thread1of1ForFork2_#t~ite10#1_Out_18|, ~name_3~0=v_~name_3~0_In_27, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_16|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_Out_16|, ~name_1~0=v_~name_1~0_In_29, ~result_8~0=v_~result_8~0_Out_58, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_32|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_16|, thread2Thread1of1ForFork2_#t~ret9#1=|v_thread2Thread1of1ForFork2_#t~ret9#1_Out_16|, ~break_11~0=v_~break_11~0_In_15, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_44|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10|, ~i_9~0=v_~i_9~0_In_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~ite10#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_#t~ret9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 05:07:24,815 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1365] L96-4-->thread3EXIT: Formula: (let ((.cse0 (= v_~break_15~0_In_20 0))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_20| 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_20| 0)) (.cse2 (ite (not (and .cse0 (< v_~i_13~0_In_13 3))) 1 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_36|)) (.cse5 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_In_5| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|)) (= v_~name_2~0_In_28 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14| v_~name_3~0_In_25) .cse0 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14|)) 1 0)) .cse1 (not (= 0 .cse2)) .cse3 (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| 2147483647) (= v_~result_12~0_Out_62 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|) .cse4 (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| 2147483648)) .cse5 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|)) (and (not .cse0) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_6|) .cse1 .cse3 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_11|) (= v_~result_12~0_Out_62 v_~result_12~0_In_14) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| .cse2) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_26| |v_thread3Thread1of1ForFork0_minus_#res#1_In_5|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~b#1_In_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|) .cse4 .cse5)))) InVars {~name_2~0=v_~name_2~0_In_28, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_In_5|, ~name_3~0=v_~name_3~0_In_25, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_5|, ~i_13~0=v_~i_13~0_In_13, ~break_15~0=v_~break_15~0_In_20, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_10|, ~result_12~0=v_~result_12~0_In_14, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_11|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_6|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_6|} OutVars{~name_2~0=v_~name_2~0_In_28, ~name_3~0=v_~name_3~0_In_25, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_36|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_20|, ~break_15~0=v_~break_15~0_In_20, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_Out_26|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_14|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_20|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_26|, ~i_13~0=v_~i_13~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_14|, ~result_12~0=v_~result_12~0_Out_62, thread3Thread1of1ForFork0_#t~ite15#1=|v_thread3Thread1of1ForFork0_#t~ite15#1_Out_20|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_14|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_minus_~b#1, ~result_12~0, thread3Thread1of1ForFork0_#t~ite15#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [1347] L74-4-->L74-4: Formula: (let ((.cse1 (= v_~current_10~0_Out_38 v_~name_1~0_In_23))) (let ((.cse2 (ite .cse1 1 v_~break_11~0_In_11))) (let ((.cse0 (and (= v_~current_10~0_Out_38 v_~name_3~0_In_20) (= .cse2 0)))) (and (= (ite .cse0 (- 1) (ite .cse1 1 v_~result_8~0_In_9)) v_~result_8~0_Out_50) (= v_~break_11~0_Out_42 (ite .cse0 1 .cse2)) (= v_~current_10~0_Out_38 (select (select |v_#memory_int_In_30| v_~nondet_0~0.base_In_14) (+ (* v_~i_9~0_In_8 4) v_~nondet_0~0.offset_In_14))) (= (ite (and (< v_~i_9~0_In_8 3) (= v_~break_11~0_In_11 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_24|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_34| 0)) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_3| 256) 0)) (= v_~i_9~0_Out_24 (+ v_~i_9~0_In_8 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_34| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_24|))))) InVars {~name_3~0=v_~name_3~0_In_20, ~break_11~0=v_~break_11~0_In_11, ~name_1~0=v_~name_1~0_In_23, #memory_int=|v_#memory_int_In_30|, ~result_8~0=v_~result_8~0_In_9, ~nondet_0~0.base=v_~nondet_0~0.base_In_14, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_3|, ~i_9~0=v_~i_9~0_In_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_In_14} OutVars{~name_3~0=v_~name_3~0_In_20, ~name_1~0=v_~name_1~0_In_23, ~current_10~0=v_~current_10~0_Out_38, ~result_8~0=v_~result_8~0_Out_50, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_24|, ~nondet_0~0.base=v_~nondet_0~0.base_In_14, ~nondet_0~0.offset=v_~nondet_0~0.offset_In_14, ~break_11~0=v_~break_11~0_Out_42, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_Out_12|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_34|, #memory_int=|v_#memory_int_In_30|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_Out_8|, ~i_9~0=v_~i_9~0_Out_24} AuxVars[] AssignedVars[~break_11~0, thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~current_10~0, thread2Thread1of1ForFork2_#t~post8#1, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet6#1, ~i_9~0] [2022-12-06 05:07:25,193 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:25,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 946 [2022-12-06 05:07:25,194 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 121 transitions, 1798 flow [2022-12-06 05:07:25,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:25,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:25,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:25,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 05:07:25,194 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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:25,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:25,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1101344380, now seen corresponding path program 1 times [2022-12-06 05:07:25,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:25,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688466437] [2022-12-06 05:07:25,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:25,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:25,674 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:25,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:25,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688466437] [2022-12-06 05:07:25,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688466437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:25,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:25,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:07:25,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685389314] [2022-12-06 05:07:25,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:25,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:07:25,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:25,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:07:25,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:07:25,675 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:07:25,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 121 transitions, 1798 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:25,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:25,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:07:25,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:26,336 INFO L130 PetriNetUnfolder]: 2447/4029 cut-off events. [2022-12-06 05:07:26,337 INFO L131 PetriNetUnfolder]: For 31812/31812 co-relation queries the response was YES. [2022-12-06 05:07:26,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19761 conditions, 4029 events. 2447/4029 cut-off events. For 31812/31812 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 23456 event pairs, 1108 based on Foata normal form. 8/3790 useless extension candidates. Maximal degree in co-relation 18193. Up to 2070 conditions per place. [2022-12-06 05:07:26,353 INFO L137 encePairwiseOnDemand]: 35/40 looper letters, 126 selfloop transitions, 18 changer transitions 1/145 dead transitions. [2022-12-06 05:07:26,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 145 transitions, 2210 flow [2022-12-06 05:07:26,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:07:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:07:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-06 05:07:26,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.325 [2022-12-06 05:07:26,368 INFO L175 Difference]: Start difference. First operand has 124 places, 121 transitions, 1798 flow. Second operand 5 states and 65 transitions. [2022-12-06 05:07:26,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 145 transitions, 2210 flow [2022-12-06 05:07:26,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 145 transitions, 2185 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 05:07:26,428 INFO L231 Difference]: Finished difference. Result has 127 places, 121 transitions, 1812 flow [2022-12-06 05:07:26,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1773, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1812, PETRI_PLACES=127, PETRI_TRANSITIONS=121} [2022-12-06 05:07:26,429 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2022-12-06 05:07:26,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:26,429 INFO L89 Accepts]: Start accepts. Operand has 127 places, 121 transitions, 1812 flow [2022-12-06 05:07:26,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:26,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:26,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 121 transitions, 1812 flow [2022-12-06 05:07:26,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 121 transitions, 1812 flow [2022-12-06 05:07:26,490 INFO L130 PetriNetUnfolder]: 123/625 cut-off events. [2022-12-06 05:07:26,490 INFO L131 PetriNetUnfolder]: For 4782/4898 co-relation queries the response was YES. [2022-12-06 05:07:26,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 625 events. 123/625 cut-off events. For 4782/4898 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5283 event pairs, 12 based on Foata normal form. 5/556 useless extension candidates. Maximal degree in co-relation 2080. Up to 98 conditions per place. [2022-12-06 05:07:26,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 121 transitions, 1812 flow [2022-12-06 05:07:26,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-06 05:07:26,648 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1372] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (= v_~name_2~0_127 v_~name_1~0_133)) (.cse1 (= v_~break_7~0_147 0))) (and (= |v_thread1Thread1of1ForFork1_#res#1.base_19| 0) (= (ite .cse0 1 0) v_~break_7~0_147) (= v_~result_4~0_150 (ite .cse0 0 v_~result_4~0_152)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_26| |v_thread1Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_62| 256) 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_24| |v_thread1Thread1of1ForFork1_minus_#in~b#1_23|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_47|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_48| |v_thread1Thread1of1ForFork1_minus_~a#1_47|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_44| |v_thread1Thread1of1ForFork1_minus_#res#1_43|) (= v_~i_5~0_113 0) (not .cse1) (= |v_thread1Thread1of1ForFork1_#res#1.offset_19| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| (ite (not (and .cse1 (< v_~i_5~0_113 3))) 1 0)))) InVars {~name_2~0=v_~name_2~0_127, ~result_4~0=v_~result_4~0_152, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_24|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_26|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_48|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_44|, ~name_1~0=v_~name_1~0_133, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_62|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_48|} OutVars{~name_2~0=v_~name_2~0_127, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_25|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_43|, ~name_1~0=v_~name_1~0_133, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_45|, thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_41|, ~result_4~0=v_~result_4~0_150, ~break_7~0=v_~break_7~0_147, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_23|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_47|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_19|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_47|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_19|, ~i_5~0=v_~i_5~0_113, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_#t~ite5#1, ~result_4~0, ~break_7~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, ~i_5~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1398] $Ultimate##0-->L96-4: Formula: (let ((.cse9 (select |v_#memory_int_251| v_~nondet_0~0.base_166))) (let ((.cse5 (select .cse9 v_~nondet_0~0.offset_166))) (let ((.cse12 (= .cse5 v_~name_2~0_195)) (.cse13 (= v_~name_2~0_195 v_~name_3~0_192))) (let ((.cse14 (ite .cse12 1 (ite .cse13 1 0)))) (let ((.cse11 (and (= .cse14 0) (= .cse5 v_~name_3~0_192))) (.cse8 (= v_~name_3~0_192 v_~name_1~0_198))) (let ((.cse7 (= v_~current_10~0_132 v_~name_1~0_198)) (.cse4 (ite .cse8 1 0)) (.cse10 (= v_~name_2~0_195 v_~current_14~0_118)) (.cse6 (ite .cse11 1 .cse14))) (let ((.cse3 (ite .cse10 1 .cse6)) (.cse1 (ite .cse7 1 .cse4))) (let ((.cse0 (and (= v_~name_3~0_192 v_~current_10~0_132) (= .cse1 0))) (.cse2 (and (= 0 .cse3) (= v_~current_14~0_118 v_~name_3~0_192)))) (and (= (ite .cse0 1 .cse1) v_~break_11~0_221) (not (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_131| 256) 0)) (= (ite .cse2 1 .cse3) v_~break_15~0_213) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_163| 0)) (= (ite (= .cse4 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_157|) (= .cse5 v_~current_10~0_132) (= v_~i_13~0_173 2) (= v_~i_9~0_177 1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_185| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_157|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141| (ite (= .cse6 0) 1 0)) (= v_~result_8~0_262 (ite .cse0 (- 1) (ite .cse7 1 (ite .cse8 0 v_~result_8~0_263)))) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_142| 256) 0)) (not (= 0 (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_130| 256))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_185| 0)) (= v_~current_14~0_118 (select .cse9 (+ v_~nondet_0~0.offset_166 4))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_163| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141|) (= (ite .cse2 (- 1) (ite .cse10 1 (ite .cse11 (- 1) (ite .cse12 1 (ite .cse13 0 v_~result_12~0_268))))) v_~result_12~0_266)))))))))) InVars {~name_2~0=v_~name_2~0_195, ~name_3~0=v_~name_3~0_192, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_131|, ~name_1~0=v_~name_1~0_198, #memory_int=|v_#memory_int_251|, ~result_8~0=v_~result_8~0_263, ~result_12~0=v_~result_12~0_268, ~nondet_0~0.base=v_~nondet_0~0.base_166, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_142|, ~nondet_0~0.offset=v_~nondet_0~0.offset_166} OutVars{~name_2~0=v_~name_2~0_195, ~name_3~0=v_~name_3~0_192, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141|, ~current_14~0=v_~current_14~0_118, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_163|, ~name_1~0=v_~name_1~0_198, ~current_10~0=v_~current_10~0_132, ~break_15~0=v_~break_15~0_213, ~result_8~0=v_~result_8~0_262, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_157|, ~nondet_0~0.base=v_~nondet_0~0.base_166, ~nondet_0~0.offset=v_~nondet_0~0.offset_166, ~break_11~0=v_~break_11~0_221, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_71|, thread3Thread1of1ForFork0_#t~post13#1=|v_thread3Thread1of1ForFork0_#t~post13#1_43|, ~i_13~0=v_~i_13~0_173, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_185|, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_49|, ~result_12~0=v_~result_12~0_266, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_61|, ~i_9~0=v_~i_9~0_177} AuxVars[|v_thread3Thread1of1ForFork0_#t~nondet11#1_130|] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~current_14~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~current_10~0, ~break_15~0, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~break_11~0, thread2Thread1of1ForFork2_#t~mem7#1, thread3Thread1of1ForFork0_#t~post13#1, ~i_13~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, ~result_12~0, thread3Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork2_#t~nondet6#1, ~i_9~0] [2022-12-06 05:07:27,136 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:27,137 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 708 [2022-12-06 05:07:27,137 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 1859 flow [2022-12-06 05:07:27,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:27,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:27,137 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:27,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 05:07:27,137 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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:27,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:27,138 INFO L85 PathProgramCache]: Analyzing trace with hash 705078640, now seen corresponding path program 1 times [2022-12-06 05:07:27,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:27,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098123495] [2022-12-06 05:07:27,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:27,760 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:27,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:27,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098123495] [2022-12-06 05:07:27,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098123495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:27,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:27,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:07:27,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21672255] [2022-12-06 05:07:27,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:27,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:07:27,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:27,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:07:27,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:07:27,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:07:27,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 1859 flow. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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:27,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:27,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:07:27,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:28,382 INFO L130 PetriNetUnfolder]: 2486/4082 cut-off events. [2022-12-06 05:07:28,382 INFO L131 PetriNetUnfolder]: For 32683/32683 co-relation queries the response was YES. [2022-12-06 05:07:28,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20280 conditions, 4082 events. 2486/4082 cut-off events. For 32683/32683 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 23772 event pairs, 1164 based on Foata normal form. 4/3829 useless extension candidates. Maximal degree in co-relation 18690. Up to 2070 conditions per place. [2022-12-06 05:07:28,401 INFO L137 encePairwiseOnDemand]: 34/41 looper letters, 128 selfloop transitions, 20 changer transitions 0/148 dead transitions. [2022-12-06 05:07:28,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 148 transitions, 2272 flow [2022-12-06 05:07:28,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:07:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:07:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 05:07:28,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33170731707317075 [2022-12-06 05:07:28,403 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 1859 flow. Second operand 5 states and 68 transitions. [2022-12-06 05:07:28,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 148 transitions, 2272 flow [2022-12-06 05:07:28,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 148 transitions, 2231 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 05:07:28,472 INFO L231 Difference]: Finished difference. Result has 129 places, 124 transitions, 1866 flow [2022-12-06 05:07:28,473 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1781, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1866, PETRI_PLACES=129, PETRI_TRANSITIONS=124} [2022-12-06 05:07:28,473 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 99 predicate places. [2022-12-06 05:07:28,473 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:28,473 INFO L89 Accepts]: Start accepts. Operand has 129 places, 124 transitions, 1866 flow [2022-12-06 05:07:28,474 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:28,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:28,474 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 124 transitions, 1866 flow [2022-12-06 05:07:28,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 124 transitions, 1866 flow [2022-12-06 05:07:28,539 INFO L130 PetriNetUnfolder]: 128/640 cut-off events. [2022-12-06 05:07:28,539 INFO L131 PetriNetUnfolder]: For 4798/4914 co-relation queries the response was YES. [2022-12-06 05:07:28,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 640 events. 128/640 cut-off events. For 4798/4914 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5430 event pairs, 13 based on Foata normal form. 5/568 useless extension candidates. Maximal degree in co-relation 2189. Up to 99 conditions per place. [2022-12-06 05:07:28,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 124 transitions, 1866 flow [2022-12-06 05:07:28,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 1098 [2022-12-06 05:07:30,163 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1372] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (= v_~name_2~0_127 v_~name_1~0_133)) (.cse1 (= v_~break_7~0_147 0))) (and (= |v_thread1Thread1of1ForFork1_#res#1.base_19| 0) (= (ite .cse0 1 0) v_~break_7~0_147) (= v_~result_4~0_150 (ite .cse0 0 v_~result_4~0_152)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_26| |v_thread1Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_62| 256) 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_24| |v_thread1Thread1of1ForFork1_minus_#in~b#1_23|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_47|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_48| |v_thread1Thread1of1ForFork1_minus_~a#1_47|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_44| |v_thread1Thread1of1ForFork1_minus_#res#1_43|) (= v_~i_5~0_113 0) (not .cse1) (= |v_thread1Thread1of1ForFork1_#res#1.offset_19| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| (ite (not (and .cse1 (< v_~i_5~0_113 3))) 1 0)))) InVars {~name_2~0=v_~name_2~0_127, ~result_4~0=v_~result_4~0_152, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_24|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_26|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_48|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_44|, ~name_1~0=v_~name_1~0_133, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_62|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_48|} OutVars{~name_2~0=v_~name_2~0_127, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_25|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_43|, ~name_1~0=v_~name_1~0_133, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_45|, thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_41|, ~result_4~0=v_~result_4~0_150, ~break_7~0=v_~break_7~0_147, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_23|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_47|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_19|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_47|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_19|, ~i_5~0=v_~i_5~0_113, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_#t~ite5#1, ~result_4~0, ~break_7~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, ~i_5~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1400] $Ultimate##0-->L74-4: Formula: (let ((.cse1 (select |v_#memory_int_253| v_~nondet_0~0.base_168))) (let ((.cse14 (select .cse1 v_~nondet_0~0.offset_168))) (let ((.cse8 (= .cse14 v_~name_1~0_200)) (.cse9 (= v_~name_3~0_194 v_~name_1~0_200))) (let ((.cse13 (ite .cse8 1 (ite .cse9 1 0)))) (let ((.cse7 (and (= .cse13 0) (= .cse14 v_~name_3~0_194))) (.cse4 (= v_~name_2~0_197 v_~name_3~0_194))) (let ((.cse3 (= v_~name_2~0_197 v_~current_14~0_122)) (.cse0 (ite .cse4 1 0)) (.cse6 (= v_~current_10~0_134 v_~name_1~0_200)) (.cse11 (ite .cse7 1 .cse13))) (let ((.cse12 (ite .cse6 1 .cse11)) (.cse10 (ite .cse3 1 .cse0))) (let ((.cse2 (and (= .cse10 0) (= v_~current_14~0_122 v_~name_3~0_194))) (.cse5 (and (= v_~name_3~0_194 v_~current_10~0_134) (= .cse12 0)))) (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145| (ite (and (< v_~i_13~0_177 4) (= .cse0 0)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_187| 0)) (= (select .cse1 (+ v_~nondet_0~0.offset_168 4)) v_~current_10~0_134) (= (ite .cse2 (- 1) (ite .cse3 1 (ite .cse4 0 v_~result_12~0_273))) v_~result_12~0_272) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_147| 256) 0)) (= v_~result_8~0_266 (ite .cse5 (- 1) (ite .cse6 1 (ite .cse7 (- 1) (ite .cse8 1 (ite .cse9 0 v_~result_8~0_268)))))) (= (ite .cse2 1 .cse10) v_~break_15~0_217) (= (ite (= .cse11 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_159|) (not (= (mod |v_thread3Thread1of1ForFork0_#t~nondet11#1_136| 256) 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_167| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_167| 0)) (= (ite .cse5 1 .cse12) v_~break_11~0_223) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_187| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_159|) (= v_~i_13~0_177 1) (= v_~current_14~0_122 (select .cse1 (+ (* v_~i_13~0_177 4) (- 4) v_~nondet_0~0.offset_168))) (= 2 v_~i_9~0_179) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_146| 256) 0))))))))))) InVars {~name_2~0=v_~name_2~0_197, ~name_3~0=v_~name_3~0_194, thread3Thread1of1ForFork0_#t~nondet11#1=|v_thread3Thread1of1ForFork0_#t~nondet11#1_136|, ~name_1~0=v_~name_1~0_200, #memory_int=|v_#memory_int_253|, ~result_8~0=v_~result_8~0_268, ~result_12~0=v_~result_12~0_273, ~nondet_0~0.base=v_~nondet_0~0.base_168, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_147|, ~nondet_0~0.offset=v_~nondet_0~0.offset_168} OutVars{~name_2~0=v_~name_2~0_197, ~name_3~0=v_~name_3~0_194, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145|, ~current_14~0=v_~current_14~0_122, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_167|, ~name_1~0=v_~name_1~0_200, ~current_10~0=v_~current_10~0_134, ~break_15~0=v_~break_15~0_217, ~result_8~0=v_~result_8~0_266, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_159|, ~nondet_0~0.base=v_~nondet_0~0.base_168, ~nondet_0~0.offset=v_~nondet_0~0.offset_168, ~break_11~0=v_~break_11~0_223, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_73|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_187|, thread3Thread1of1ForFork0_#t~post13#1=|v_thread3Thread1of1ForFork0_#t~post13#1_47|, ~i_13~0=v_~i_13~0_177, #memory_int=|v_#memory_int_253|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_51|, ~result_12~0=v_~result_12~0_272, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_65|, ~i_9~0=v_~i_9~0_179} AuxVars[|v_thread2Thread1of1ForFork2_#t~nondet6#1_146|] AssignedVars[thread3Thread1of1ForFork0_#t~nondet11#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~current_14~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~current_10~0, ~break_15~0, ~result_8~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~break_11~0, thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post13#1, ~i_13~0, thread2Thread1of1ForFork2_#t~post8#1, ~result_12~0, thread3Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork2_#t~nondet6#1, ~i_9~0] [2022-12-06 05:07:30,603 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:30,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2131 [2022-12-06 05:07:30,604 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 125 transitions, 1914 flow [2022-12-06 05:07:30,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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:30,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:30,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:30,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:07:30,605 INFO L420 AbstractCegarLoop]: === Iteration 29 === 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:30,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1041554217, now seen corresponding path program 1 times [2022-12-06 05:07:30,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:30,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442615990] [2022-12-06 05:07:30,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:30,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:31,078 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:31,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:31,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442615990] [2022-12-06 05:07:31,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442615990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:31,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:31,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:07:31,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043535756] [2022-12-06 05:07:31,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:31,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:07:31,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:31,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:07:31,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:07:31,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:07:31,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 125 transitions, 1914 flow. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:31,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:31,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:07:31,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:31,737 INFO L130 PetriNetUnfolder]: 2533/4169 cut-off events. [2022-12-06 05:07:31,737 INFO L131 PetriNetUnfolder]: For 32299/32299 co-relation queries the response was YES. [2022-12-06 05:07:31,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20478 conditions, 4169 events. 2533/4169 cut-off events. For 32299/32299 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 24457 event pairs, 1184 based on Foata normal form. 8/3910 useless extension candidates. Maximal degree in co-relation 18905. Up to 2070 conditions per place. [2022-12-06 05:07:31,755 INFO L137 encePairwiseOnDemand]: 35/41 looper letters, 132 selfloop transitions, 21 changer transitions 0/153 dead transitions. [2022-12-06 05:07:31,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 153 transitions, 2330 flow [2022-12-06 05:07:31,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:07:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:07:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-06 05:07:31,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34146341463414637 [2022-12-06 05:07:31,756 INFO L175 Difference]: Start difference. First operand has 130 places, 125 transitions, 1914 flow. Second operand 5 states and 70 transitions. [2022-12-06 05:07:31,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 153 transitions, 2330 flow [2022-12-06 05:07:31,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 153 transitions, 2307 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:07:31,813 INFO L231 Difference]: Finished difference. Result has 133 places, 124 transitions, 1892 flow [2022-12-06 05:07:31,813 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1892, PETRI_PLACES=133, PETRI_TRANSITIONS=124} [2022-12-06 05:07:31,813 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places. [2022-12-06 05:07:31,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:31,813 INFO L89 Accepts]: Start accepts. Operand has 133 places, 124 transitions, 1892 flow [2022-12-06 05:07:31,814 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:31,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:31,814 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 124 transitions, 1892 flow [2022-12-06 05:07:31,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 124 transitions, 1892 flow [2022-12-06 05:07:31,877 INFO L130 PetriNetUnfolder]: 128/652 cut-off events. [2022-12-06 05:07:31,877 INFO L131 PetriNetUnfolder]: For 4913/5033 co-relation queries the response was YES. [2022-12-06 05:07:31,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 652 events. 128/652 cut-off events. For 4913/5033 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5598 event pairs, 13 based on Foata normal form. 5/580 useless extension candidates. Maximal degree in co-relation 2262. Up to 101 conditions per place. [2022-12-06 05:07:31,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 124 transitions, 1892 flow [2022-12-06 05:07:31,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 1102 [2022-12-06 05:07:31,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 05:07:31,884 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork2_#t~nondet6#1_149 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:07:31,887 INFO L158 Benchmark]: Toolchain (without parser) took 53039.12ms. Allocated memory was 194.0MB in the beginning and 762.3MB in the end (delta: 568.3MB). Free memory was 170.0MB in the beginning and 443.7MB in the end (delta: -273.6MB). Peak memory consumption was 295.5MB. Max. memory is 8.0GB. [2022-12-06 05:07:31,887 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory was 170.6MB in the beginning and 170.6MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:07:31,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.80ms. Allocated memory is still 194.0MB. Free memory was 170.0MB in the beginning and 157.2MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 05:07:31,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.82ms. Allocated memory is still 194.0MB. Free memory was 157.2MB in the beginning and 154.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 05:07:31,889 INFO L158 Benchmark]: Boogie Preprocessor took 50.95ms. Allocated memory is still 194.0MB. Free memory was 154.6MB in the beginning and 152.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:07:31,889 INFO L158 Benchmark]: RCFGBuilder took 519.19ms. Allocated memory is still 194.0MB. Free memory was 152.5MB in the beginning and 126.8MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 05:07:31,889 INFO L158 Benchmark]: TraceAbstraction took 52178.16ms. Allocated memory was 194.0MB in the beginning and 762.3MB in the end (delta: 568.3MB). Free memory was 126.3MB in the beginning and 443.7MB in the end (delta: -317.4MB). Peak memory consumption was 251.5MB. Max. memory is 8.0GB. [2022-12-06 05:07:31,890 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 194.0MB. Free memory was 170.6MB in the beginning and 170.6MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.80ms. Allocated memory is still 194.0MB. Free memory was 170.0MB in the beginning and 157.2MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.82ms. Allocated memory is still 194.0MB. Free memory was 157.2MB in the beginning and 154.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.95ms. Allocated memory is still 194.0MB. Free memory was 154.6MB in the beginning and 152.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 519.19ms. Allocated memory is still 194.0MB. Free memory was 152.5MB in the beginning and 126.8MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 52178.16ms. Allocated memory was 194.0MB in the beginning and 762.3MB in the end (delta: 568.3MB). Free memory was 126.3MB in the beginning and 443.7MB in the end (delta: -317.4MB). Peak memory consumption was 251.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.8s, 312 PlacesBefore, 30 PlacesAfterwards, 328 TransitionsBefore, 24 TransitionsAfterwards, 27528 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 111 TrivialYvCompositions, 171 ConcurrentYvCompositions, 22 ChoiceCompositions, 304 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17613, independent: 17605, independent conditional: 17605, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17613, independent: 17605, independent conditional: 0, independent unconditional: 17605, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17613, independent: 17605, independent conditional: 0, independent unconditional: 17605, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17613, independent: 17605, independent conditional: 0, independent unconditional: 17605, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15631, independent: 15623, independent conditional: 0, independent unconditional: 15623, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15631, independent: 15623, independent conditional: 0, independent unconditional: 15623, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17613, independent: 1982, independent conditional: 0, independent unconditional: 1982, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15631, unknown conditional: 0, unknown unconditional: 15631] , Statistics on independence cache: Total cache size (in pairs): 33839, Positive cache size: 33831, Positive conditional cache size: 0, Positive unconditional cache size: 33831, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, 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: 1.3s, 27 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 1.9s, 27 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 1.8s, 27 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.5s, 34 PlacesBefore, 32 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 16, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 38, independent conditional: 16, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 16, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 38, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 19, unknown conditional: 8, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 19, Positive conditional cache size: 8, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 31, independent conditional: 22, independent unconditional: 9, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 22, independent unconditional: 9, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 20, independent conditional: 11, independent unconditional: 9, 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: 21, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 21, unknown conditional: 12, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 41, Positive conditional cache size: 20, Positive unconditional cache size: 21, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 28, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 58, Positive conditional cache size: 36, Positive unconditional cache size: 22, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 41 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 27, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 74, Positive conditional cache size: 51, Positive unconditional cache size: 23, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, 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: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 74, Positive conditional cache size: 51, Positive unconditional cache size: 23, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 12, independent unconditional: 0, 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: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 87, Positive conditional cache size: 63, Positive unconditional cache size: 24, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.4s, 51 PlacesBefore, 50 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 46, independent conditional: 35, independent unconditional: 11, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 46, independent conditional: 35, independent unconditional: 11, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 46, independent conditional: 35, independent unconditional: 11, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 2, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 54, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 13, unknown conditional: 2, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 102, Positive conditional cache size: 65, Positive unconditional cache size: 37, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 49 PlacesBefore, 49 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 25, independent conditional: 14, independent unconditional: 11, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 14, independent unconditional: 11, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 24, independent conditional: 13, independent unconditional: 11, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 106, Positive conditional cache size: 68, Positive unconditional cache size: 38, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, 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: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 106, Positive conditional cache size: 68, Positive unconditional cache size: 38, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, 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: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 106, Positive conditional cache size: 68, Positive unconditional cache size: 38, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 11, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 16, independent conditional: 14, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 15, unknown conditional: 13, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 119, Positive conditional cache size: 79, Positive unconditional cache size: 40, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 44, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 37, independent conditional: 30, independent unconditional: 7, dependent: 13, dependent conditional: 9, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 37, independent conditional: 30, independent unconditional: 7, dependent: 13, dependent conditional: 9, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 12, independent unconditional: 3, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 9, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 22, independent conditional: 18, independent unconditional: 4, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 21, unknown conditional: 16, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 134, Positive conditional cache size: 91, Positive unconditional cache size: 43, Negative cache size: 10, Negative conditional cache size: 8, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 69 PlacesBefore, 70 PlacesAfterwards, 55 TransitionsBefore, 56 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 91, independent conditional: 91, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 107, independent: 91, independent conditional: 91, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 91, independent conditional: 77, independent unconditional: 14, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 91, independent conditional: 77, independent unconditional: 14, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 111, independent: 84, independent conditional: 70, independent unconditional: 14, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 142, Positive conditional cache size: 99, Positive unconditional cache size: 43, Negative cache size: 10, Negative conditional cache size: 8, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 73 PlacesBefore, 74 PlacesAfterwards, 54 TransitionsBefore, 55 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 84, independent conditional: 71, independent unconditional: 13, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 84, independent conditional: 71, independent unconditional: 13, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 79, independent conditional: 66, independent unconditional: 13, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 149, Positive conditional cache size: 106, Positive unconditional cache size: 43, Negative cache size: 10, Negative conditional cache size: 8, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 80 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 53, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 43, independent conditional: 27, independent unconditional: 16, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 43, independent conditional: 27, independent unconditional: 16, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 61, independent: 39, independent conditional: 23, independent unconditional: 16, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 153, Positive conditional cache size: 110, Positive unconditional cache size: 43, Negative cache size: 10, Negative conditional cache size: 8, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 89 PlacesBefore, 90 PlacesAfterwards, 80 TransitionsBefore, 82 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, independent: 91, independent conditional: 91, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 103, independent: 91, independent conditional: 91, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 115, independent: 91, independent conditional: 79, independent unconditional: 12, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 115, independent: 91, independent conditional: 79, independent unconditional: 12, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 115, independent: 81, independent conditional: 69, independent unconditional: 12, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 167, Positive conditional cache size: 122, Positive unconditional cache size: 45, Negative cache size: 10, Negative conditional cache size: 8, Negative unconditional cache size: 2, 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.3s, 96 PlacesBefore, 97 PlacesAfterwards, 82 TransitionsBefore, 84 TransitionsAfterwards, 748 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 60, independent conditional: 54, independent unconditional: 6, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 60, independent conditional: 54, independent unconditional: 6, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 84, independent: 53, independent conditional: 47, independent unconditional: 6, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 178, Positive conditional cache size: 131, Positive unconditional cache size: 47, Negative cache size: 10, Negative conditional cache size: 8, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 94 PlacesBefore, 94 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 774 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, 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: 57, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 180, Positive conditional cache size: 132, Positive unconditional cache size: 48, Negative cache size: 10, Negative conditional cache size: 8, Negative unconditional cache size: 2, 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, 99 PlacesBefore, 99 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 822 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 181, Positive conditional cache size: 133, Positive unconditional cache size: 48, Negative cache size: 10, Negative conditional cache size: 8, Negative unconditional cache size: 2, 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, 107 PlacesBefore, 108 PlacesAfterwards, 101 TransitionsBefore, 102 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 94, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 84, independent conditional: 64, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 84, independent conditional: 64, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 104, independent: 77, independent conditional: 58, independent unconditional: 19, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 188, Positive conditional cache size: 139, Positive unconditional cache size: 49, Negative cache size: 10, Negative conditional cache size: 8, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 115 PlacesBefore, 114 PlacesAfterwards, 109 TransitionsBefore, 108 TransitionsAfterwards, 992 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 80, independent conditional: 60, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 80, independent conditional: 60, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 75, independent conditional: 55, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 195, Positive conditional cache size: 144, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 8, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 118 PlacesBefore, 118 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 1010 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 89, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 79, independent conditional: 59, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 79, independent conditional: 59, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 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: 99, independent: 76, independent conditional: 56, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 198, Positive conditional cache size: 147, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 8, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 124 PlacesBefore, 124 PlacesAfterwards, 121 TransitionsBefore, 121 TransitionsAfterwards, 1078 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, independent: 90, independent conditional: 70, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, independent: 90, independent conditional: 70, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, independent: 85, independent conditional: 65, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 205, Positive conditional cache size: 152, Positive unconditional cache size: 53, Negative cache size: 10, Negative conditional cache size: 8, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 126 PlacesBefore, 127 PlacesAfterwards, 121 TransitionsBefore, 122 TransitionsAfterwards, 1078 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 83, independent conditional: 83, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 93, independent: 83, independent conditional: 83, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103, independent: 83, independent conditional: 63, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103, independent: 83, independent conditional: 63, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 103, independent: 75, independent conditional: 55, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 213, Positive conditional cache size: 160, Positive unconditional cache size: 53, Negative cache size: 10, Negative conditional cache size: 8, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 129 PlacesBefore, 130 PlacesAfterwards, 124 TransitionsBefore, 125 TransitionsAfterwards, 1098 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 89, independent conditional: 89, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 89, independent conditional: 89, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 109, independent: 89, independent conditional: 79, independent unconditional: 10, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 109, independent: 89, independent conditional: 79, independent unconditional: 10, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 109, independent: 75, independent conditional: 65, independent unconditional: 10, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 227, Positive conditional cache size: 174, Positive unconditional cache size: 53, Negative cache size: 10, Negative conditional cache size: 8, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 1 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork2_#t~nondet6#1_149 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork2_#t~nondet6#1_149 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:07:31,913 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...