/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:06:36,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:06:36,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:06:36,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:06:36,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:06:36,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:06:36,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:06:36,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:06:36,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:06:36,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:06:36,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:06:36,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:06:36,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:06:36,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:06:36,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:06:36,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:06:36,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:06:36,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:06:36,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:06:36,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:06:36,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:06:36,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:06:36,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:06:36,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:06:36,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:06:36,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:06:36,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:06:36,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:06:36,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:06:36,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:06:36,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:06:36,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:06:36,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:06:36,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:06:36,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:06:36,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:06:36,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:06:36,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:06:36,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:06:36,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:06:36,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:06:36,301 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:06:36,334 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:06:36,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:06:36,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:06:36,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:06:36,337 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:06:36,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:06:36,337 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:06:36,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:06:36,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:06:36,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:06:36,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:06:36,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:06:36,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:06:36,339 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:06:36,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:06:36,339 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:06:36,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:06:36,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:06:36,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:06:36,340 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:06:36,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:06:36,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:06:36,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:06:36,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:06:36,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:06:36,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:06:36,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:06:36,341 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:06:36,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 12:06:36,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:06:36,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:06:36,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:06:36,657 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:06:36,657 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:06:36,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2022-12-13 12:06:37,730 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:06:37,997 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:06:37,997 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2022-12-13 12:06:38,023 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9244c223/209134aa2f384a53b2e6266b6d550d89/FLAG5465d692b [2022-12-13 12:06:38,038 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9244c223/209134aa2f384a53b2e6266b6d550d89 [2022-12-13 12:06:38,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:06:38,041 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:06:38,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:06:38,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:06:38,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:06:38,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:06:38" (1/1) ... [2022-12-13 12:06:38,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2febb049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:38, skipping insertion in model container [2022-12-13 12:06:38,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:06:38" (1/1) ... [2022-12-13 12:06:38,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:06:38,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:06:38,697 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i[76084,76097] [2022-12-13 12:06:38,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:06:38,757 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:06:38,801 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i[76084,76097] [2022-12-13 12:06:38,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:06:38,895 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:06:38,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:38 WrapperNode [2022-12-13 12:06:38,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:06:38,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:06:38,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:06:38,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:06:38,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:38" (1/1) ... [2022-12-13 12:06:38,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:38" (1/1) ... [2022-12-13 12:06:38,953 INFO L138 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 134 [2022-12-13 12:06:38,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:06:38,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:06:38,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:06:38,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:06:38,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:38" (1/1) ... [2022-12-13 12:06:38,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:38" (1/1) ... [2022-12-13 12:06:38,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:38" (1/1) ... [2022-12-13 12:06:38,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:38" (1/1) ... [2022-12-13 12:06:38,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:38" (1/1) ... [2022-12-13 12:06:38,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:38" (1/1) ... [2022-12-13 12:06:38,997 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:38" (1/1) ... [2022-12-13 12:06:38,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:38" (1/1) ... [2022-12-13 12:06:39,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:06:39,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:06:39,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:06:39,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:06:39,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:38" (1/1) ... [2022-12-13 12:06:39,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:06:39,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:06:39,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:06:39,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:06:39,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:06:39,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:06:39,091 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 12:06:39,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:06:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 12:06:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:06:39,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:06:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-13 12:06:39,092 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-13 12:06:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:06:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:06:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:06:39,094 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:06:39,420 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:06:39,423 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:06:39,681 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:06:39,713 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:06:39,714 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:06:39,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:06:39 BoogieIcfgContainer [2022-12-13 12:06:39,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:06:39,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:06:39,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:06:39,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:06:39,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:06:38" (1/3) ... [2022-12-13 12:06:39,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d68cb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:06:39, skipping insertion in model container [2022-12-13 12:06:39,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:38" (2/3) ... [2022-12-13 12:06:39,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d68cb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:06:39, skipping insertion in model container [2022-12-13 12:06:39,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:06:39" (3/3) ... [2022-12-13 12:06:39,729 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2022-12-13 12:06:39,747 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:06:39,747 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-13 12:06:39,747 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:06:39,828 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 12:06:39,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 173 transitions, 362 flow [2022-12-13 12:06:39,960 INFO L130 PetriNetUnfolder]: 10/211 cut-off events. [2022-12-13 12:06:39,960 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:06:39,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 211 events. 10/211 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 357 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 124. Up to 4 conditions per place. [2022-12-13 12:06:39,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 173 transitions, 362 flow [2022-12-13 12:06:39,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 161 transitions, 334 flow [2022-12-13 12:06:39,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:39,998 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 161 transitions, 334 flow [2022-12-13 12:06:40,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 161 transitions, 334 flow [2022-12-13 12:06:40,058 INFO L130 PetriNetUnfolder]: 7/192 cut-off events. [2022-12-13 12:06:40,059 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:06:40,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 192 events. 7/192 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 298 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 114. Up to 4 conditions per place. [2022-12-13 12:06:40,064 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 161 transitions, 334 flow [2022-12-13 12:06:40,065 INFO L226 LiptonReduction]: Number of co-enabled transitions 2392 [2022-12-13 12:07:11,438 INFO L241 LiptonReduction]: Total number of compositions: 134 [2022-12-13 12:07:11,456 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:07:11,462 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;@34584e46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:07:11,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 12:07:11,463 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:07:11,463 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:07:11,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:11,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 12:07:11,464 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:11,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:11,468 INFO L85 PathProgramCache]: Analyzing trace with hash 595, now seen corresponding path program 1 times [2022-12-13 12:07:11,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:11,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686166177] [2022-12-13 12:07:11,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:11,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:11,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:11,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686166177] [2022-12-13 12:07:11,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686166177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:11,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:11,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 12:07:11,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920454587] [2022-12-13 12:07:11,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:11,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:07:11,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:11,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:07:11,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:07:11,736 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 49 [2022-12-13 12:07:11,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 110 flow. Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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-13 12:07:11,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:11,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 49 [2022-12-13 12:07:11,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:12,116 INFO L130 PetriNetUnfolder]: 1332/2421 cut-off events. [2022-12-13 12:07:12,116 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-13 12:07:12,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4625 conditions, 2421 events. 1332/2421 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 16675 event pairs, 1331 based on Foata normal form. 111/1455 useless extension candidates. Maximal degree in co-relation 4467. Up to 2166 conditions per place. [2022-12-13 12:07:12,134 INFO L137 encePairwiseOnDemand]: 46/49 looper letters, 38 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2022-12-13 12:07:12,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 180 flow [2022-12-13 12:07:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:07:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:07:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2022-12-13 12:07:12,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5816326530612245 [2022-12-13 12:07:12,148 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 110 flow. Second operand 2 states and 57 transitions. [2022-12-13 12:07:12,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 180 flow [2022-12-13 12:07:12,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 172 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:07:12,153 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 96 flow [2022-12-13 12:07:12,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2022-12-13 12:07:12,159 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2022-12-13 12:07:12,160 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:12,160 INFO L89 Accepts]: Start accepts. Operand has 48 places, 46 transitions, 96 flow [2022-12-13 12:07:12,163 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:12,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:12,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 46 transitions, 96 flow [2022-12-13 12:07:12,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 46 transitions, 96 flow [2022-12-13 12:07:12,179 INFO L130 PetriNetUnfolder]: 1/52 cut-off events. [2022-12-13 12:07:12,180 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:07:12,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 52 events. 1/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 162 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:07:12,185 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 46 transitions, 96 flow [2022-12-13 12:07:12,185 INFO L226 LiptonReduction]: Number of co-enabled transitions 832 [2022-12-13 12:07:16,568 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:16,570 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:16,575 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:16,576 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:42,933 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:07:42,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30775 [2022-12-13 12:07:42,935 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 94 flow [2022-12-13 12:07:42,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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-13 12:07:42,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:42,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 12:07:42,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:07:42,936 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:42,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash 18534052, now seen corresponding path program 1 times [2022-12-13 12:07:42,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:42,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939373060] [2022-12-13 12:07:42,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:42,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:43,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:43,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:43,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939373060] [2022-12-13 12:07:43,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939373060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:43,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:43,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:07:43,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624039543] [2022-12-13 12:07:43,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:43,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:07:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:43,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:07:43,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:07:43,413 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 45 [2022-12-13 12:07:43,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:43,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:43,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 45 [2022-12-13 12:07:43,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:43,978 INFO L130 PetriNetUnfolder]: 2867/4717 cut-off events. [2022-12-13 12:07:43,978 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 12:07:43,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9364 conditions, 4717 events. 2867/4717 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 29200 event pairs, 1362 based on Foata normal form. 0/2701 useless extension candidates. Maximal degree in co-relation 409. Up to 3155 conditions per place. [2022-12-13 12:07:44,001 INFO L137 encePairwiseOnDemand]: 36/45 looper letters, 60 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2022-12-13 12:07:44,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 282 flow [2022-12-13 12:07:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:07:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:07:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-12-13 12:07:44,005 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2022-12-13 12:07:44,006 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 94 flow. Second operand 3 states and 78 transitions. [2022-12-13 12:07:44,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 282 flow [2022-12-13 12:07:44,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:07:44,008 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 144 flow [2022-12-13 12:07:44,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2022-12-13 12:07:44,009 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2022-12-13 12:07:44,009 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:44,009 INFO L89 Accepts]: Start accepts. Operand has 49 places, 51 transitions, 144 flow [2022-12-13 12:07:44,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:44,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:44,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 51 transitions, 144 flow [2022-12-13 12:07:44,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 144 flow [2022-12-13 12:07:44,034 INFO L130 PetriNetUnfolder]: 63/251 cut-off events. [2022-12-13 12:07:44,034 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 12:07:44,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 251 events. 63/251 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1493 event pairs, 37 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 117. Up to 108 conditions per place. [2022-12-13 12:07:44,036 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 51 transitions, 144 flow [2022-12-13 12:07:44,036 INFO L226 LiptonReduction]: Number of co-enabled transitions 946 [2022-12-13 12:07:48,497 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:48,498 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4489 [2022-12-13 12:07:48,498 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 144 flow [2022-12-13 12:07:48,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:48,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:48,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:07:48,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:07:48,499 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:48,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:48,500 INFO L85 PathProgramCache]: Analyzing trace with hash 574555670, now seen corresponding path program 1 times [2022-12-13 12:07:48,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:48,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088184312] [2022-12-13 12:07:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:48,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:48,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:48,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088184312] [2022-12-13 12:07:48,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088184312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:48,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:48,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:07:48,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365838817] [2022-12-13 12:07:48,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:48,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:07:48,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:48,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:07:48,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:07:48,671 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 45 [2022-12-13 12:07:48,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:48,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:48,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 45 [2022-12-13 12:07:48,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:49,263 INFO L130 PetriNetUnfolder]: 3105/5142 cut-off events. [2022-12-13 12:07:49,263 INFO L131 PetriNetUnfolder]: For 776/776 co-relation queries the response was YES. [2022-12-13 12:07:49,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11824 conditions, 5142 events. 3105/5142 cut-off events. For 776/776 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 32616 event pairs, 1638 based on Foata normal form. 277/3501 useless extension candidates. Maximal degree in co-relation 2898. Up to 3519 conditions per place. [2022-12-13 12:07:49,288 INFO L137 encePairwiseOnDemand]: 37/45 looper letters, 64 selfloop transitions, 13 changer transitions 2/82 dead transitions. [2022-12-13 12:07:49,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 396 flow [2022-12-13 12:07:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:07:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:07:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-13 12:07:49,291 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5703703703703704 [2022-12-13 12:07:49,291 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 144 flow. Second operand 3 states and 77 transitions. [2022-12-13 12:07:49,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 396 flow [2022-12-13 12:07:49,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 82 transitions, 382 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:07:49,308 INFO L231 Difference]: Finished difference. Result has 51 places, 61 transitions, 243 flow [2022-12-13 12:07:49,309 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=51, PETRI_TRANSITIONS=61} [2022-12-13 12:07:49,310 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2022-12-13 12:07:49,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:49,310 INFO L89 Accepts]: Start accepts. Operand has 51 places, 61 transitions, 243 flow [2022-12-13 12:07:49,312 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:49,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:49,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 61 transitions, 243 flow [2022-12-13 12:07:49,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 61 transitions, 243 flow [2022-12-13 12:07:49,350 INFO L130 PetriNetUnfolder]: 159/420 cut-off events. [2022-12-13 12:07:49,350 INFO L131 PetriNetUnfolder]: For 137/139 co-relation queries the response was YES. [2022-12-13 12:07:49,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 420 events. 159/420 cut-off events. For 137/139 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2575 event pairs, 36 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 317. Up to 235 conditions per place. [2022-12-13 12:07:49,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 61 transitions, 243 flow [2022-12-13 12:07:49,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 1126 [2022-12-13 12:07:49,406 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:49,407 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:49,410 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:49,411 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:49,612 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_59|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_86|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_541|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_597|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_49|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_541|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [557] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_101 28))) (and (= (store |v_#memory_$Pointer$.base_256| v_my_callbackThread1of1ForFork0_~data~0.base_101 (store (select |v_#memory_$Pointer$.base_256| v_my_callbackThread1of1ForFork0_~data~0.base_101) .cse0 (select (select |v_#memory_$Pointer$.base_255| v_my_callbackThread1of1ForFork0_~data~0.base_101) .cse0))) |v_#memory_$Pointer$.base_255|) (= (store |v_#memory_int_315| v_my_callbackThread1of1ForFork0_~data~0.base_101 (store (select |v_#memory_int_315| v_my_callbackThread1of1ForFork0_~data~0.base_101) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_40| 1))) |v_#memory_int_314|) (= |v_#memory_$Pointer$.offset_255| (store |v_#memory_$Pointer$.offset_256| v_my_callbackThread1of1ForFork0_~data~0.base_101 (store (select |v_#memory_$Pointer$.offset_256| v_my_callbackThread1of1ForFork0_~data~0.base_101) .cse0 (select (select |v_#memory_$Pointer$.offset_255| v_my_callbackThread1of1ForFork0_~data~0.base_101) .cse0)))))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_101, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_40|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_256|, #memory_int=|v_#memory_int_315|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_101, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_256|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_101, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_255|, #memory_int=|v_#memory_int_314|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_101, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_255|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:07:49,617 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_59|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_86|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_541|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_597|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_49|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_541|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [484] L1710-1-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_53 24))) (and (= (store |v_#memory_int_131| v_my_callbackThread1of1ForFork0_~data~0.base_53 (store (select |v_#memory_int_131| v_my_callbackThread1of1ForFork0_~data~0.base_53) .cse0 1)) |v_#memory_int_130|) (= (store |v_#memory_$Pointer$.offset_94| v_my_callbackThread1of1ForFork0_~data~0.base_53 (store (select |v_#memory_$Pointer$.offset_94| v_my_callbackThread1of1ForFork0_~data~0.base_53) .cse0 (select (select |v_#memory_$Pointer$.offset_93| v_my_callbackThread1of1ForFork0_~data~0.base_53) .cse0))) |v_#memory_$Pointer$.offset_93|) (= (store |v_#memory_$Pointer$.base_94| v_my_callbackThread1of1ForFork0_~data~0.base_53 (store (select |v_#memory_$Pointer$.base_94| v_my_callbackThread1of1ForFork0_~data~0.base_53) .cse0 (select (select |v_#memory_$Pointer$.base_93| v_my_callbackThread1of1ForFork0_~data~0.base_53) .cse0))) |v_#memory_$Pointer$.base_93|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_94|, #memory_int=|v_#memory_int_131|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_53, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_94|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_93|, #memory_int=|v_#memory_int_130|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_21|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_53, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_93|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#t~nondet31, #memory_$Pointer$.offset] [2022-12-13 12:07:49,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_59|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_86|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_541|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_597|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_49|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_541|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [391] L1712-->L1712-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_11 28))) (and (= (store |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork1_~data~0.base_11 (store (select |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.base_19| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.base_19|) (= |v_#memory_int_32| (store |v_#memory_int_33| v_my_callbackThread1of1ForFork1_~data~0.base_11 (store (select |v_#memory_int_33| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_3| 1)))) (= (store |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork1_~data~0.base_11 (store (select |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.offset_19| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.offset_19|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_3|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_11, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_11, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_20|, #memory_int=|v_#memory_int_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_20|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_3|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_11, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_11, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, #memory_int=|v_#memory_int_32|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:07:49,626 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_59|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_86|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_541|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_597|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_49|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_541|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [406] L1710-1-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_17 24))) (and (= (store |v_#memory_$Pointer$.base_22| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_$Pointer$.base_22| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 (select (select |v_#memory_$Pointer$.base_21| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0))) |v_#memory_$Pointer$.base_21|) (= (store |v_#memory_int_37| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_int_37| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 1)) |v_#memory_int_36|) (= (store |v_#memory_$Pointer$.offset_22| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_$Pointer$.offset_22| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 (select (select |v_#memory_$Pointer$.offset_21| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0))) |v_#memory_$Pointer$.offset_21|))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_17, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_17, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_22|, #memory_int=|v_#memory_int_37|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_22|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_17, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_17, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_21|, #memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_7|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_21|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#t~nondet31, #memory_$Pointer$.offset] [2022-12-13 12:07:49,630 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_59|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_86|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_541|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_597|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_49|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_541|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [440] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_37 28))) (and (= (store |v_#memory_$Pointer$.offset_48| v_my_callbackThread1of1ForFork1_~data~0.base_37 (store (select |v_#memory_$Pointer$.offset_48| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0 (select (select |v_#memory_$Pointer$.offset_47| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0))) |v_#memory_$Pointer$.offset_47|) (= (store |v_#memory_int_69| v_my_callbackThread1of1ForFork1_~data~0.base_37 (store (select |v_#memory_int_69| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_16| 1))) |v_#memory_int_68|) (= (store |v_#memory_$Pointer$.base_48| v_my_callbackThread1of1ForFork1_~data~0.base_37 (store (select |v_#memory_$Pointer$.base_48| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0 (select (select |v_#memory_$Pointer$.base_47| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0))) |v_#memory_$Pointer$.base_47|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_16|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_37, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_37, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_48|, #memory_int=|v_#memory_int_69|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_48|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_37, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_37, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_47|, #memory_int=|v_#memory_int_68|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_47|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:07:49,634 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_59|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_86|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_541|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_597|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_49|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_541|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [378] L1712-->L1712-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_11 28))) (and (= (store |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.base_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.base_19|) (= (store |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_3| 1))) |v_#memory_int_32|) (= (store |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.offset_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.offset_19|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_20|, #memory_int=|v_#memory_int_33|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_20|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, #memory_int=|v_#memory_int_32|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:07:49,647 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:07:49,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 339 [2022-12-13 12:07:49,649 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 60 transitions, 253 flow [2022-12-13 12:07:49,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:49,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:49,649 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:49,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:07:49,649 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:49,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:49,650 INFO L85 PathProgramCache]: Analyzing trace with hash -358633641, now seen corresponding path program 1 times [2022-12-13 12:07:49,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:49,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151356794] [2022-12-13 12:07:49,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:49,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:49,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:49,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151356794] [2022-12-13 12:07:49,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151356794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:49,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:49,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:07:49,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129598389] [2022-12-13 12:07:49,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:49,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:07:49,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:49,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:07:49,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:07:49,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 48 [2022-12-13 12:07:49,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 60 transitions, 253 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:49,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:49,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 48 [2022-12-13 12:07:49,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:49,862 INFO L130 PetriNetUnfolder]: 352/713 cut-off events. [2022-12-13 12:07:49,862 INFO L131 PetriNetUnfolder]: For 566/622 co-relation queries the response was YES. [2022-12-13 12:07:49,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1626 conditions, 713 events. 352/713 cut-off events. For 566/622 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3903 event pairs, 352 based on Foata normal form. 166/595 useless extension candidates. Maximal degree in co-relation 1621. Up to 627 conditions per place. [2022-12-13 12:07:49,866 INFO L137 encePairwiseOnDemand]: 41/48 looper letters, 20 selfloop transitions, 0 changer transitions 10/37 dead transitions. [2022-12-13 12:07:49,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 162 flow [2022-12-13 12:07:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:07:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:07:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2022-12-13 12:07:49,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2022-12-13 12:07:49,870 INFO L175 Difference]: Start difference. First operand has 50 places, 60 transitions, 253 flow. Second operand 2 states and 53 transitions. [2022-12-13 12:07:49,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 162 flow [2022-12-13 12:07:49,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 150 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 12:07:49,873 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 68 flow [2022-12-13 12:07:49,873 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2022-12-13 12:07:49,874 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-12-13 12:07:49,874 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:49,875 INFO L89 Accepts]: Start accepts. Operand has 43 places, 27 transitions, 68 flow [2022-12-13 12:07:49,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:49,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:49,876 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 27 transitions, 68 flow [2022-12-13 12:07:49,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 27 transitions, 68 flow [2022-12-13 12:07:49,882 INFO L130 PetriNetUnfolder]: 6/60 cut-off events. [2022-12-13 12:07:49,883 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:07:49,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 60 events. 6/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 181 event pairs, 6 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 57. Up to 18 conditions per place. [2022-12-13 12:07:49,884 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 27 transitions, 68 flow [2022-12-13 12:07:49,884 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 12:07:49,889 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:49,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 12:07:49,894 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 68 flow [2022-12-13 12:07:49,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:49,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:49,895 INFO L214 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-13 12:07:49,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:07:49,895 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:49,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:49,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1078101691, now seen corresponding path program 1 times [2022-12-13 12:07:49,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:49,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484900514] [2022-12-13 12:07:49,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:49,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:52,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:52,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484900514] [2022-12-13 12:07:52,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484900514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:52,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:52,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 12:07:52,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598338514] [2022-12-13 12:07:52,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:52,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 12:07:52,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:52,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 12:07:52,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:07:52,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-13 12:07:52,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 68 flow. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:52,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:52,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-13 12:07:52,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:53,318 INFO L130 PetriNetUnfolder]: 419/806 cut-off events. [2022-12-13 12:07:53,318 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-13 12:07:53,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 806 events. 419/806 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4005 event pairs, 40 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 408. Up to 377 conditions per place. [2022-12-13 12:07:53,322 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 74 selfloop transitions, 32 changer transitions 36/144 dead transitions. [2022-12-13 12:07:53,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 144 transitions, 654 flow [2022-12-13 12:07:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 12:07:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 12:07:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 179 transitions. [2022-12-13 12:07:53,331 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3683127572016461 [2022-12-13 12:07:53,331 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 68 flow. Second operand 18 states and 179 transitions. [2022-12-13 12:07:53,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 144 transitions, 654 flow [2022-12-13 12:07:53,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 144 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:07:53,338 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 293 flow [2022-12-13 12:07:53,338 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=293, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2022-12-13 12:07:53,340 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2022-12-13 12:07:53,341 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:53,341 INFO L89 Accepts]: Start accepts. Operand has 58 places, 55 transitions, 293 flow [2022-12-13 12:07:53,343 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:53,343 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:53,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 55 transitions, 293 flow [2022-12-13 12:07:53,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 55 transitions, 293 flow [2022-12-13 12:07:53,360 INFO L130 PetriNetUnfolder]: 27/139 cut-off events. [2022-12-13 12:07:53,361 INFO L131 PetriNetUnfolder]: For 90/95 co-relation queries the response was YES. [2022-12-13 12:07:53,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 139 events. 27/139 cut-off events. For 90/95 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 686 event pairs, 3 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 339. Up to 39 conditions per place. [2022-12-13 12:07:53,362 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 55 transitions, 293 flow [2022-12-13 12:07:53,362 INFO L226 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-13 12:07:53,375 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:53,376 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:53,379 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:53,380 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:53,382 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [377] L1711-1-->L1712: Formula: (= |v_my_callbackThread1of1ForFork0_#t~mem32_1| (select (select |v_#memory_int_31| v_my_callbackThread1of1ForFork0_~data~0.base_9) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_9 28))) InVars {#memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_9, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_9} OutVars{#memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_9, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_1|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_9} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#t~mem32] and [406] L1710-1-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_17 24))) (and (= (store |v_#memory_$Pointer$.base_22| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_$Pointer$.base_22| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 (select (select |v_#memory_$Pointer$.base_21| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0))) |v_#memory_$Pointer$.base_21|) (= (store |v_#memory_int_37| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_int_37| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 1)) |v_#memory_int_36|) (= (store |v_#memory_$Pointer$.offset_22| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_$Pointer$.offset_22| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 (select (select |v_#memory_$Pointer$.offset_21| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0))) |v_#memory_$Pointer$.offset_21|))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_17, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_17, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_22|, #memory_int=|v_#memory_int_37|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_22|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_17, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_17, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_21|, #memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_7|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_21|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#t~nondet31, #memory_$Pointer$.offset] [2022-12-13 12:07:53,459 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.base_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40| (select (select |v_#memory_int_595| |v_~#t1~0.base_41|) |v_~#t1~0.offset_41|)) (= (store |v_#length_118| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_117|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87| 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|) (= (store |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1) |v_#valid_176|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|) (= 0 (select |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, ~#t1~0.base=|v_~#t1~0.base_41|, #valid=|v_#valid_177|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, #memory_int=|v_#memory_int_595|, ~#t1~0.offset=|v_~#t1~0.offset_41|, #length=|v_#length_118|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_58|, ~#t1~0.offset=|v_~#t1~0.offset_41|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_57|, ~#t1~0.base=|v_~#t1~0.base_41|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_44|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_100|, #length=|v_#length_117|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_47|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|, #valid=|v_#valid_176|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_58|, #memory_int=|v_#memory_int_595|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [561] L1712-1-->my_callbackEXIT: Formula: (and (= |v_#pthreadsMutex_193| (store |v_#pthreadsMutex_194| v_my_callbackThread1of1ForFork0_~data~0.base_105 (store (select |v_#pthreadsMutex_194| v_my_callbackThread1of1ForFork0_~data~0.base_105) v_my_callbackThread1of1ForFork0_~data~0.offset_105 0))) (= |v_my_callbackThread1of1ForFork0_#res.base_9| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_9| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_194|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_105, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_105} OutVars{#pthreadsMutex=|v_#pthreadsMutex_193|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_105, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_9|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_45|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_9|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_105} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] [2022-12-13 12:07:53,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L1711-1-->L1712: Formula: (= |v_my_callbackThread1of1ForFork1_#t~mem32_1| (select (select |v_#memory_int_31| v_my_callbackThread1of1ForFork1_~data~0.base_9) (+ v_my_callbackThread1of1ForFork1_~data~0.offset_9 28))) InVars {#memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_9, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_9} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_1|, #memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_9, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_9} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32] and [561] L1712-1-->my_callbackEXIT: Formula: (and (= |v_#pthreadsMutex_193| (store |v_#pthreadsMutex_194| v_my_callbackThread1of1ForFork0_~data~0.base_105 (store (select |v_#pthreadsMutex_194| v_my_callbackThread1of1ForFork0_~data~0.base_105) v_my_callbackThread1of1ForFork0_~data~0.offset_105 0))) (= |v_my_callbackThread1of1ForFork0_#res.base_9| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_9| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_194|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_105, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_105} OutVars{#pthreadsMutex=|v_#pthreadsMutex_193|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_105, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_9|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_45|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_9|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_105} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] [2022-12-13 12:07:53,664 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:53,665 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-13 12:07:53,672 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [561] L1712-1-->my_callbackEXIT: Formula: (and (= |v_#pthreadsMutex_193| (store |v_#pthreadsMutex_194| v_my_callbackThread1of1ForFork0_~data~0.base_105 (store (select |v_#pthreadsMutex_194| v_my_callbackThread1of1ForFork0_~data~0.base_105) v_my_callbackThread1of1ForFork0_~data~0.offset_105 0))) (= |v_my_callbackThread1of1ForFork0_#res.base_9| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_9| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_194|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_105, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_105} OutVars{#pthreadsMutex=|v_#pthreadsMutex_193|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_105, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_9|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_45|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_9|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_105} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] and [558] L1736-2-->ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_#memory_$Pointer$.offset_259| (store |v_#memory_$Pointer$.offset_260| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66| (store (select |v_#memory_$Pointer$.offset_260| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_58| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_35|))) (= (select (select |v_#memory_int_318| |v_ULTIMATE.start_main_~#data~1#1.base_119|) (+ |v_ULTIMATE.start_main_~#data~1#1.offset_119| 24)) |v_ULTIMATE.start_main_#t~mem46#1_43|) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_123| |v_ULTIMATE.start_ldv_assert_~expression#1_149|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_149| 0) (= (store |v_#memory_int_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66| (store (select |v_#memory_int_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_58| (select (select |v_#memory_int_318| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_58|))) |v_#memory_int_318|) (= (store |v_#memory_$Pointer$.base_260| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66| (store (select |v_#memory_$Pointer$.base_260| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_58| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_35|)) |v_#memory_$Pointer$.base_259|) (= (store |v_#valid_125| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66| 0) |v_#valid_124|) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_123| (ite (= |v_ULTIMATE.start_main_#t~mem46#1_43| 1) 1 0))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_58|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_260|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_35|, #valid=|v_#valid_125|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_35|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_119|, #memory_int=|v_#memory_int_319|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_260|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_119|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_149|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_259|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_119|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_30|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_123|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_43|, #valid=|v_#valid_124|, #memory_int=|v_#memory_int_318|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_259|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_119|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_main_#t~mem46#1, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, #memory_$Pointer$.offset] [2022-12-13 12:07:53,797 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:53,798 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-13 12:07:53,805 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] L1711-1-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_240 28))) (and (= (store |v_#memory_$Pointer$.offset_628| v_my_callbackThread1of1ForFork1_~data~0.base_240 (store (select |v_#memory_$Pointer$.offset_628| v_my_callbackThread1of1ForFork1_~data~0.base_240) .cse0 (select (select |v_#memory_$Pointer$.offset_627| v_my_callbackThread1of1ForFork1_~data~0.base_240) .cse0))) |v_#memory_$Pointer$.offset_627|) (= (store |v_#memory_$Pointer$.base_628| v_my_callbackThread1of1ForFork1_~data~0.base_240 (store (select |v_#memory_$Pointer$.base_628| v_my_callbackThread1of1ForFork1_~data~0.base_240) .cse0 (select (select |v_#memory_$Pointer$.base_627| v_my_callbackThread1of1ForFork1_~data~0.base_240) .cse0))) |v_#memory_$Pointer$.base_627|) (= (store |v_#memory_int_693| v_my_callbackThread1of1ForFork1_~data~0.base_240 (let ((.cse1 (select |v_#memory_int_693| v_my_callbackThread1of1ForFork1_~data~0.base_240))) (store .cse1 .cse0 (+ (select .cse1 .cse0) 1)))) |v_#memory_int_692|))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_240, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_240, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_628|, #memory_int=|v_#memory_int_693|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_628|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_115|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_240, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_240, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_627|, #memory_int=|v_#memory_int_692|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_627|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] and [591] L1712-1-->ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_#valid_195| (store |v_#valid_196| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_105| 0)) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_186| (ite (= |v_ULTIMATE.start_main_#t~mem46#1_73| 1) 1 0)) (= |v_#memory_$Pointer$.base_631| (store |v_#memory_$Pointer$.base_632| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_105| (store (select |v_#memory_$Pointer$.base_632| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_105|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_95| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_66|))) (= (store |v_#memory_int_699| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_105| (store (select |v_#memory_int_699| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_105|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_95| (select (select |v_#memory_int_698| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_105|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_95|))) |v_#memory_int_698|) (= (store |v_#memory_$Pointer$.offset_632| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_105| (store (select |v_#memory_$Pointer$.offset_632| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_105|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_95| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_66|)) |v_#memory_$Pointer$.offset_631|) (= (store |v_#pthreadsMutex_416| v_my_callbackThread1of1ForFork0_~data~0.base_266 (store (select |v_#pthreadsMutex_416| v_my_callbackThread1of1ForFork0_~data~0.base_266) v_my_callbackThread1of1ForFork0_~data~0.offset_266 0)) |v_#pthreadsMutex_415|) (= |v_my_callbackThread1of1ForFork0_#res.base_40| 0) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_186| |v_ULTIMATE.start_ldv_assert_~expression#1_223|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_223| 0) (= (select (select |v_#memory_int_698| |v_ULTIMATE.start_main_~#data~1#1.base_235|) (+ |v_ULTIMATE.start_main_~#data~1#1.offset_235| 24)) |v_ULTIMATE.start_main_#t~mem46#1_73|) (= |v_my_callbackThread1of1ForFork0_#res.offset_40| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_416|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_632|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_105|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_66|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_235|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_266, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_95|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_266, #valid=|v_#valid_196|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_66|, #memory_int=|v_#memory_int_699|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_632|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_235|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_415|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_223|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_149|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_631|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_235|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_51|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_186|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_266, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_266, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_40|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_73|, #valid=|v_#valid_195|, #memory_int=|v_#memory_int_698|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_631|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_235|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_ldv_assert_~expression#1, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, my_callbackThread1of1ForFork0_#res.base, ULTIMATE.start_main_#t~mem46#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] [2022-12-13 12:07:54,033 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_172| v_my_callbackThread1of1ForFork1_~data~0.base_101))) (and (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_13|) (= v_my_callbackThread1of1ForFork1_~data~0.base_101 v_my_callbackThread1of1ForFork1_~__mptr~0.base_17) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_101 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_17) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (store |v_#pthreadsMutex_172| v_my_callbackThread1of1ForFork1_~data~0.base_101 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_101 1)) |v_#pthreadsMutex_171|) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_101) 0) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_13|) (= v_~my_dev~0.offset_54 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_17) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_17 v_~my_dev~0.base_54))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_13|, #pthreadsMutex=|v_#pthreadsMutex_172|, ~my_dev~0.base=v_~my_dev~0.base_54, ~my_dev~0.offset=v_~my_dev~0.offset_54, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_13|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_13|, #pthreadsMutex=|v_#pthreadsMutex_171|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_101, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_101, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, ~my_dev~0.base=v_~my_dev~0.base_54, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_17, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_17, ~my_dev~0.offset=v_~my_dev~0.offset_54, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_13|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_#t~nondet31] and [561] L1712-1-->my_callbackEXIT: Formula: (and (= |v_#pthreadsMutex_193| (store |v_#pthreadsMutex_194| v_my_callbackThread1of1ForFork0_~data~0.base_105 (store (select |v_#pthreadsMutex_194| v_my_callbackThread1of1ForFork0_~data~0.base_105) v_my_callbackThread1of1ForFork0_~data~0.offset_105 0))) (= |v_my_callbackThread1of1ForFork0_#res.base_9| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_9| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_194|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_105, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_105} OutVars{#pthreadsMutex=|v_#pthreadsMutex_193|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_105, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_9|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_45|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_9|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_105} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] [2022-12-13 12:07:56,341 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:56,341 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:56,344 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:56,345 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:58,600 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 12:07:58,601 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5260 [2022-12-13 12:07:58,601 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 52 transitions, 304 flow [2022-12-13 12:07:58,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:58,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:58,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:58,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:07:58,602 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:58,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:58,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1642990345, now seen corresponding path program 1 times [2022-12-13 12:07:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:58,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868980025] [2022-12-13 12:07:58,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:59,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:59,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868980025] [2022-12-13 12:07:59,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868980025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:59,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:59,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:07:59,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831772890] [2022-12-13 12:07:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:59,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:07:59,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:59,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:07:59,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:07:59,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 12:07:59,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 304 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:59,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:59,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 12:07:59,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:59,567 INFO L130 PetriNetUnfolder]: 254/556 cut-off events. [2022-12-13 12:07:59,568 INFO L131 PetriNetUnfolder]: For 960/960 co-relation queries the response was YES. [2022-12-13 12:07:59,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1994 conditions, 556 events. 254/556 cut-off events. For 960/960 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2959 event pairs, 39 based on Foata normal form. 2/557 useless extension candidates. Maximal degree in co-relation 1908. Up to 226 conditions per place. [2022-12-13 12:07:59,572 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 85 selfloop transitions, 19 changer transitions 6/112 dead transitions. [2022-12-13 12:07:59,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 112 transitions, 852 flow [2022-12-13 12:07:59,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:07:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:07:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-13 12:07:59,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 12:07:59,574 INFO L175 Difference]: Start difference. First operand has 49 places, 52 transitions, 304 flow. Second operand 6 states and 80 transitions. [2022-12-13 12:07:59,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 112 transitions, 852 flow [2022-12-13 12:07:59,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 112 transitions, 824 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-13 12:07:59,581 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 375 flow [2022-12-13 12:07:59,581 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2022-12-13 12:07:59,583 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2022-12-13 12:07:59,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:59,583 INFO L89 Accepts]: Start accepts. Operand has 56 places, 54 transitions, 375 flow [2022-12-13 12:07:59,585 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:59,585 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:59,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 54 transitions, 375 flow [2022-12-13 12:07:59,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 54 transitions, 375 flow [2022-12-13 12:07:59,607 INFO L130 PetriNetUnfolder]: 41/193 cut-off events. [2022-12-13 12:07:59,608 INFO L131 PetriNetUnfolder]: For 306/325 co-relation queries the response was YES. [2022-12-13 12:07:59,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 193 events. 41/193 cut-off events. For 306/325 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1129 event pairs, 7 based on Foata normal form. 3/185 useless extension candidates. Maximal degree in co-relation 555. Up to 61 conditions per place. [2022-12-13 12:07:59,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 54 transitions, 375 flow [2022-12-13 12:07:59,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-13 12:07:59,623 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:59,624 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 12:07:59,624 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 54 transitions, 375 flow [2022-12-13 12:07:59,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:59,625 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:59,625 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:59,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:07:59,625 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:59,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:59,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1842521493, now seen corresponding path program 1 times [2022-12-13 12:07:59,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:59,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809127742] [2022-12-13 12:07:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:59,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:01,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:01,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809127742] [2022-12-13 12:08:01,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809127742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:01,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:01,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:08:01,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219603266] [2022-12-13 12:08:01,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:01,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 12:08:01,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:01,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 12:08:01,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-13 12:08:01,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-13 12:08:01,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 54 transitions, 375 flow. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:01,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:01,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-13 12:08:01,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:01,829 INFO L130 PetriNetUnfolder]: 288/633 cut-off events. [2022-12-13 12:08:01,829 INFO L131 PetriNetUnfolder]: For 1773/1773 co-relation queries the response was YES. [2022-12-13 12:08:01,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2489 conditions, 633 events. 288/633 cut-off events. For 1773/1773 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3360 event pairs, 105 based on Foata normal form. 1/633 useless extension candidates. Maximal degree in co-relation 2454. Up to 494 conditions per place. [2022-12-13 12:08:01,835 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 61 selfloop transitions, 18 changer transitions 20/101 dead transitions. [2022-12-13 12:08:01,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 101 transitions, 871 flow [2022-12-13 12:08:01,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:08:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 12:08:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2022-12-13 12:08:01,836 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36324786324786323 [2022-12-13 12:08:01,836 INFO L175 Difference]: Start difference. First operand has 52 places, 54 transitions, 375 flow. Second operand 9 states and 85 transitions. [2022-12-13 12:08:01,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 101 transitions, 871 flow [2022-12-13 12:08:01,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 101 transitions, 826 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-13 12:08:01,842 INFO L231 Difference]: Finished difference. Result has 60 places, 63 transitions, 491 flow [2022-12-13 12:08:01,842 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=491, PETRI_PLACES=60, PETRI_TRANSITIONS=63} [2022-12-13 12:08:01,843 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2022-12-13 12:08:01,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:01,843 INFO L89 Accepts]: Start accepts. Operand has 60 places, 63 transitions, 491 flow [2022-12-13 12:08:01,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:01,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:01,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 63 transitions, 491 flow [2022-12-13 12:08:01,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 63 transitions, 491 flow [2022-12-13 12:08:01,872 INFO L130 PetriNetUnfolder]: 61/258 cut-off events. [2022-12-13 12:08:01,872 INFO L131 PetriNetUnfolder]: For 571/591 co-relation queries the response was YES. [2022-12-13 12:08:01,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 258 events. 61/258 cut-off events. For 571/591 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1635 event pairs, 9 based on Foata normal form. 5/252 useless extension candidates. Maximal degree in co-relation 864. Up to 92 conditions per place. [2022-12-13 12:08:01,875 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 63 transitions, 491 flow [2022-12-13 12:08:01,875 INFO L226 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-13 12:08:01,888 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:08:01,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 12:08:01,889 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 63 transitions, 491 flow [2022-12-13 12:08:01,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:01,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:01,889 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:01,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:08:01,890 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:01,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1915162279, now seen corresponding path program 2 times [2022-12-13 12:08:01,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:01,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610483840] [2022-12-13 12:08:01,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:01,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:02,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:02,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610483840] [2022-12-13 12:08:02,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610483840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:02,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:02,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:08:02,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360151314] [2022-12-13 12:08:02,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:02,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:08:02,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:02,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:08:02,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:08:02,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-13 12:08:02,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 63 transitions, 491 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:02,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:02,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-13 12:08:02,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:02,369 INFO L130 PetriNetUnfolder]: 267/618 cut-off events. [2022-12-13 12:08:02,369 INFO L131 PetriNetUnfolder]: For 1901/1911 co-relation queries the response was YES. [2022-12-13 12:08:02,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2516 conditions, 618 events. 267/618 cut-off events. For 1901/1911 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3514 event pairs, 52 based on Foata normal form. 13/622 useless extension candidates. Maximal degree in co-relation 2493. Up to 378 conditions per place. [2022-12-13 12:08:02,374 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 69 selfloop transitions, 7 changer transitions 2/85 dead transitions. [2022-12-13 12:08:02,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 85 transitions, 804 flow [2022-12-13 12:08:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:08:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:08:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-13 12:08:02,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2022-12-13 12:08:02,376 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 491 flow. Second operand 3 states and 47 transitions. [2022-12-13 12:08:02,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 85 transitions, 804 flow [2022-12-13 12:08:02,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 753 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-13 12:08:02,383 INFO L231 Difference]: Finished difference. Result has 54 places, 68 transitions, 510 flow [2022-12-13 12:08:02,383 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=54, PETRI_TRANSITIONS=68} [2022-12-13 12:08:02,385 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2022-12-13 12:08:02,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:02,385 INFO L89 Accepts]: Start accepts. Operand has 54 places, 68 transitions, 510 flow [2022-12-13 12:08:02,386 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:02,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:02,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 68 transitions, 510 flow [2022-12-13 12:08:02,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 68 transitions, 510 flow [2022-12-13 12:08:02,415 INFO L130 PetriNetUnfolder]: 72/293 cut-off events. [2022-12-13 12:08:02,416 INFO L131 PetriNetUnfolder]: For 582/597 co-relation queries the response was YES. [2022-12-13 12:08:02,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 293 events. 72/293 cut-off events. For 582/597 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1922 event pairs, 7 based on Foata normal form. 2/284 useless extension candidates. Maximal degree in co-relation 590. Up to 91 conditions per place. [2022-12-13 12:08:02,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 68 transitions, 510 flow [2022-12-13 12:08:02,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-13 12:08:04,582 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:08:04,585 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2200 [2022-12-13 12:08:04,585 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 68 transitions, 510 flow [2022-12-13 12:08:04,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:04,585 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:04,585 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:04,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:08:04,585 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:04,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:04,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1607045497, now seen corresponding path program 3 times [2022-12-13 12:08:04,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:04,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995985450] [2022-12-13 12:08:04,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:04,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:06,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-13 12:08:06,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:06,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995985450] [2022-12-13 12:08:06,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995985450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:06,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:06,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:08:06,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325975603] [2022-12-13 12:08:06,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:06,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 12:08:06,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:06,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 12:08:06,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-13 12:08:06,080 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-13 12:08:06,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 68 transitions, 510 flow. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:06,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:06,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-13 12:08:06,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:06,655 INFO L130 PetriNetUnfolder]: 321/736 cut-off events. [2022-12-13 12:08:06,655 INFO L131 PetriNetUnfolder]: For 2285/2285 co-relation queries the response was YES. [2022-12-13 12:08:06,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 736 events. 321/736 cut-off events. For 2285/2285 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4267 event pairs, 136 based on Foata normal form. 1/736 useless extension candidates. Maximal degree in co-relation 1726. Up to 609 conditions per place. [2022-12-13 12:08:06,662 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 73 selfloop transitions, 18 changer transitions 23/116 dead transitions. [2022-12-13 12:08:06,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 116 transitions, 1066 flow [2022-12-13 12:08:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:08:06,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 12:08:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2022-12-13 12:08:06,663 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2022-12-13 12:08:06,663 INFO L175 Difference]: Start difference. First operand has 54 places, 68 transitions, 510 flow. Second operand 9 states and 84 transitions. [2022-12-13 12:08:06,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 116 transitions, 1066 flow [2022-12-13 12:08:06,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 116 transitions, 1050 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:08:06,670 INFO L231 Difference]: Finished difference. Result has 68 places, 81 transitions, 707 flow [2022-12-13 12:08:06,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=707, PETRI_PLACES=68, PETRI_TRANSITIONS=81} [2022-12-13 12:08:06,671 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2022-12-13 12:08:06,671 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:06,671 INFO L89 Accepts]: Start accepts. Operand has 68 places, 81 transitions, 707 flow [2022-12-13 12:08:06,672 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:06,672 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:06,672 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 81 transitions, 707 flow [2022-12-13 12:08:06,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 81 transitions, 707 flow [2022-12-13 12:08:06,706 INFO L130 PetriNetUnfolder]: 76/313 cut-off events. [2022-12-13 12:08:06,706 INFO L131 PetriNetUnfolder]: For 905/921 co-relation queries the response was YES. [2022-12-13 12:08:06,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 313 events. 76/313 cut-off events. For 905/921 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2027 event pairs, 4 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 1128. Up to 92 conditions per place. [2022-12-13 12:08:06,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 81 transitions, 707 flow [2022-12-13 12:08:06,710 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 12:08:06,716 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:08:06,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 12:08:06,717 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 81 transitions, 707 flow [2022-12-13 12:08:06,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:06,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:06,718 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:06,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:08:06,718 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:06,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:06,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1737003114, now seen corresponding path program 1 times [2022-12-13 12:08:06,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:06,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624823103] [2022-12-13 12:08:06,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:06,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:06,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624823103] [2022-12-13 12:08:06,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624823103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:06,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:06,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:08:06,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810055620] [2022-12-13 12:08:06,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:06,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:08:06,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:06,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:08:06,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:08:06,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-13 12:08:06,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 81 transitions, 707 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:06,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:06,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-13 12:08:06,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:07,069 INFO L130 PetriNetUnfolder]: 56/198 cut-off events. [2022-12-13 12:08:07,069 INFO L131 PetriNetUnfolder]: For 981/981 co-relation queries the response was YES. [2022-12-13 12:08:07,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 198 events. 56/198 cut-off events. For 981/981 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 866 event pairs, 25 based on Foata normal form. 9/207 useless extension candidates. Maximal degree in co-relation 859. Up to 140 conditions per place. [2022-12-13 12:08:07,071 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 38 selfloop transitions, 5 changer transitions 9/55 dead transitions. [2022-12-13 12:08:07,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 55 transitions, 530 flow [2022-12-13 12:08:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:08:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:08:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-13 12:08:07,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2022-12-13 12:08:07,073 INFO L175 Difference]: Start difference. First operand has 65 places, 81 transitions, 707 flow. Second operand 3 states and 35 transitions. [2022-12-13 12:08:07,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 55 transitions, 530 flow [2022-12-13 12:08:07,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 455 flow, removed 33 selfloop flow, removed 6 redundant places. [2022-12-13 12:08:07,076 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 262 flow [2022-12-13 12:08:07,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2022-12-13 12:08:07,077 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2022-12-13 12:08:07,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:07,077 INFO L89 Accepts]: Start accepts. Operand has 62 places, 43 transitions, 262 flow [2022-12-13 12:08:07,078 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:07,078 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:07,078 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 43 transitions, 262 flow [2022-12-13 12:08:07,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 43 transitions, 262 flow [2022-12-13 12:08:07,089 INFO L130 PetriNetUnfolder]: 10/100 cut-off events. [2022-12-13 12:08:07,090 INFO L131 PetriNetUnfolder]: For 221/223 co-relation queries the response was YES. [2022-12-13 12:08:07,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 100 events. 10/100 cut-off events. For 221/223 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 409 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 211. Up to 20 conditions per place. [2022-12-13 12:08:07,091 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 43 transitions, 262 flow [2022-12-13 12:08:07,091 INFO L226 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-13 12:08:07,096 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:07,097 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:07,099 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:07,099 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:07,184 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.base_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40| (select (select |v_#memory_int_595| |v_~#t1~0.base_41|) |v_~#t1~0.offset_41|)) (= (store |v_#length_118| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_117|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87| 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|) (= (store |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1) |v_#valid_176|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|) (= 0 (select |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, ~#t1~0.base=|v_~#t1~0.base_41|, #valid=|v_#valid_177|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, #memory_int=|v_#memory_int_595|, ~#t1~0.offset=|v_~#t1~0.offset_41|, #length=|v_#length_118|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_58|, ~#t1~0.offset=|v_~#t1~0.offset_41|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_57|, ~#t1~0.base=|v_~#t1~0.base_41|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_44|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_100|, #length=|v_#length_117|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_47|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|, #valid=|v_#valid_176|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_58|, #memory_int=|v_#memory_int_595|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [406] L1710-1-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_17 24))) (and (= (store |v_#memory_$Pointer$.base_22| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_$Pointer$.base_22| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 (select (select |v_#memory_$Pointer$.base_21| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0))) |v_#memory_$Pointer$.base_21|) (= (store |v_#memory_int_37| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_int_37| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 1)) |v_#memory_int_36|) (= (store |v_#memory_$Pointer$.offset_22| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_$Pointer$.offset_22| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 (select (select |v_#memory_$Pointer$.offset_21| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0))) |v_#memory_$Pointer$.offset_21|))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_17, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_17, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_22|, #memory_int=|v_#memory_int_37|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_22|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_17, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_17, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_21|, #memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_7|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_21|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#t~nondet31, #memory_$Pointer$.offset] [2022-12-13 12:08:07,327 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L1711-1-->L1712-1: Formula: (let ((.cse0 (select |v_#memory_int_678| v_my_callbackThread1of1ForFork0_~data~0.base_254)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_254 28))) (and (= |v_my_callbackThread1of1ForFork0_#t~mem32_136| (select .cse0 .cse1)) (= (store |v_#memory_$Pointer$.base_618| v_my_callbackThread1of1ForFork0_~data~0.base_254 (store (select |v_#memory_$Pointer$.base_618| v_my_callbackThread1of1ForFork0_~data~0.base_254) .cse1 (select (select |v_#memory_$Pointer$.base_617| v_my_callbackThread1of1ForFork0_~data~0.base_254) .cse1))) |v_#memory_$Pointer$.base_617|) (= (store |v_#memory_int_678| v_my_callbackThread1of1ForFork0_~data~0.base_254 (store .cse0 .cse1 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_136| 1))) |v_#memory_int_677|) (= (store |v_#memory_$Pointer$.offset_618| v_my_callbackThread1of1ForFork0_~data~0.base_254 (store (select |v_#memory_$Pointer$.offset_618| v_my_callbackThread1of1ForFork0_~data~0.base_254) .cse1 (select (select |v_#memory_$Pointer$.offset_617| v_my_callbackThread1of1ForFork0_~data~0.base_254) .cse1))) |v_#memory_$Pointer$.offset_617|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_254, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_618|, #memory_int=|v_#memory_int_678|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_254, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_618|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_254, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_136|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_617|, #memory_int=|v_#memory_int_677|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_254, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_617|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] and [519] L1726-4-->L1727-3: Formula: (and (= (store |v_#memory_int_213| |v_~#t2~0.base_19| (store (select |v_#memory_int_213| |v_~#t2~0.base_19|) |v_~#t2~0.offset_19| |v_ULTIMATE.start_my_drv_probe_#t~pre38#1_23|)) |v_#memory_int_212|) (= (store |v_#memory_$Pointer$.base_162| |v_~#t2~0.base_19| (store (select |v_#memory_$Pointer$.base_162| |v_~#t2~0.base_19|) |v_~#t2~0.offset_19| (select (select |v_#memory_$Pointer$.base_161| |v_~#t2~0.base_19|) |v_~#t2~0.offset_19|))) |v_#memory_$Pointer$.base_161|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_$Pointer$.offset_162| |v_~#t2~0.base_19| (store (select |v_#memory_$Pointer$.offset_162| |v_~#t2~0.base_19|) |v_~#t2~0.offset_19| (select (select |v_#memory_$Pointer$.offset_161| |v_~#t2~0.base_19|) |v_~#t2~0.offset_19|))) |v_#memory_$Pointer$.offset_161|) (= |v_#pthreadsForks_24| |v_ULTIMATE.start_my_drv_probe_#t~pre38#1_23|)) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_162|, #pthreadsForks=|v_#pthreadsForks_24|, ~#t2~0.offset=|v_~#t2~0.offset_19|, #memory_int=|v_#memory_int_213|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_162|, ~#t2~0.base=|v_~#t2~0.base_19|} OutVars{ULTIMATE.start_my_drv_probe_#t~nondet37#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet37#1_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_161|, #pthreadsForks=|v_#pthreadsForks_23|, ~#t2~0.offset=|v_~#t2~0.offset_19|, #memory_int=|v_#memory_int_212|, ULTIMATE.start_my_drv_probe_#t~pre36#1=|v_ULTIMATE.start_my_drv_probe_#t~pre36#1_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_161|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_23|, ~#t2~0.base=|v_~#t2~0.base_19|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~nondet37#1, #memory_$Pointer$.base, #pthreadsForks, #memory_int, ULTIMATE.start_my_drv_probe_#t~pre36#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] [2022-12-13 12:08:07,487 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [599] L1711-1-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_310 28))) (and (= |v_my_callbackThread1of1ForFork0_#res.offset_48| 0) (= (store |v_#pthreadsMutex_436| v_my_callbackThread1of1ForFork0_~data~0.base_310 (store (select |v_#pthreadsMutex_436| v_my_callbackThread1of1ForFork0_~data~0.base_310) v_my_callbackThread1of1ForFork0_~data~0.offset_310 0)) |v_#pthreadsMutex_435|) (= |v_#memory_$Pointer$.offset_763| (store |v_#memory_$Pointer$.offset_764| v_my_callbackThread1of1ForFork0_~data~0.base_310 (store (select |v_#memory_$Pointer$.offset_764| v_my_callbackThread1of1ForFork0_~data~0.base_310) .cse0 (select (select |v_#memory_$Pointer$.offset_763| v_my_callbackThread1of1ForFork0_~data~0.base_310) .cse0)))) (= (store |v_#memory_int_828| v_my_callbackThread1of1ForFork0_~data~0.base_310 (let ((.cse1 (select |v_#memory_int_828| v_my_callbackThread1of1ForFork0_~data~0.base_310))) (store .cse1 .cse0 (+ (select .cse1 .cse0) 1)))) |v_#memory_int_827|) (= |v_my_callbackThread1of1ForFork0_#res.base_48| 0) (= (store |v_#memory_$Pointer$.base_764| v_my_callbackThread1of1ForFork0_~data~0.base_310 (store (select |v_#memory_$Pointer$.base_764| v_my_callbackThread1of1ForFork0_~data~0.base_310) .cse0 (select (select |v_#memory_$Pointer$.base_763| v_my_callbackThread1of1ForFork0_~data~0.base_310) .cse0))) |v_#memory_$Pointer$.base_763|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_436|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_310, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_764|, #memory_int=|v_#memory_int_828|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_310, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_764|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_435|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_310, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_48|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_177|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_763|, #memory_int=|v_#memory_int_827|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_48|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_310, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_763|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [519] L1726-4-->L1727-3: Formula: (and (= (store |v_#memory_int_213| |v_~#t2~0.base_19| (store (select |v_#memory_int_213| |v_~#t2~0.base_19|) |v_~#t2~0.offset_19| |v_ULTIMATE.start_my_drv_probe_#t~pre38#1_23|)) |v_#memory_int_212|) (= (store |v_#memory_$Pointer$.base_162| |v_~#t2~0.base_19| (store (select |v_#memory_$Pointer$.base_162| |v_~#t2~0.base_19|) |v_~#t2~0.offset_19| (select (select |v_#memory_$Pointer$.base_161| |v_~#t2~0.base_19|) |v_~#t2~0.offset_19|))) |v_#memory_$Pointer$.base_161|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_$Pointer$.offset_162| |v_~#t2~0.base_19| (store (select |v_#memory_$Pointer$.offset_162| |v_~#t2~0.base_19|) |v_~#t2~0.offset_19| (select (select |v_#memory_$Pointer$.offset_161| |v_~#t2~0.base_19|) |v_~#t2~0.offset_19|))) |v_#memory_$Pointer$.offset_161|) (= |v_#pthreadsForks_24| |v_ULTIMATE.start_my_drv_probe_#t~pre38#1_23|)) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_162|, #pthreadsForks=|v_#pthreadsForks_24|, ~#t2~0.offset=|v_~#t2~0.offset_19|, #memory_int=|v_#memory_int_213|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_162|, ~#t2~0.base=|v_~#t2~0.base_19|} OutVars{ULTIMATE.start_my_drv_probe_#t~nondet37#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet37#1_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_161|, #pthreadsForks=|v_#pthreadsForks_23|, ~#t2~0.offset=|v_~#t2~0.offset_19|, #memory_int=|v_#memory_int_212|, ULTIMATE.start_my_drv_probe_#t~pre36#1=|v_ULTIMATE.start_my_drv_probe_#t~pre36#1_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_161|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_23|, ~#t2~0.base=|v_~#t2~0.base_19|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~nondet37#1, #memory_$Pointer$.base, #pthreadsForks, #memory_int, ULTIMATE.start_my_drv_probe_#t~pre36#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] [2022-12-13 12:08:07,676 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [598] L1711-1-->L1727-3: Formula: (let ((.cse2 (select |v_#memory_int_823| v_my_callbackThread1of1ForFork0_~data~0.base_308)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_308 28))) (and (= |v_#pthreadsForks_50| |v_ULTIMATE.start_my_drv_probe_#t~pre38#1_107|) (= |v_#memory_$Pointer$.offset_757| (store |v_#memory_$Pointer$.offset_758| |v_~#t2~0.base_70| (store (select |v_#memory_$Pointer$.offset_758| |v_~#t2~0.base_70|) |v_~#t2~0.offset_67| (select (select |v_#memory_$Pointer$.offset_757| |v_~#t2~0.base_70|) |v_~#t2~0.offset_67|)))) (= |v_#memory_$Pointer$.offset_758| (store |v_#memory_$Pointer$.offset_759| v_my_callbackThread1of1ForFork0_~data~0.base_308 (store (select |v_#memory_$Pointer$.offset_759| v_my_callbackThread1of1ForFork0_~data~0.base_308) .cse0 (select (select |v_#memory_$Pointer$.offset_758| v_my_callbackThread1of1ForFork0_~data~0.base_308) .cse0)))) (= (store |v_#memory_$Pointer$.base_759| v_my_callbackThread1of1ForFork0_~data~0.base_308 (store (select |v_#memory_$Pointer$.base_759| v_my_callbackThread1of1ForFork0_~data~0.base_308) .cse0 (select (select |v_#memory_$Pointer$.base_758| v_my_callbackThread1of1ForFork0_~data~0.base_308) .cse0))) |v_#memory_$Pointer$.base_758|) (= (let ((.cse1 (store |v_#memory_int_823| v_my_callbackThread1of1ForFork0_~data~0.base_308 (store .cse2 .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_175| 1))))) (store .cse1 |v_~#t2~0.base_70| (store (select .cse1 |v_~#t2~0.base_70|) |v_~#t2~0.offset_67| |v_ULTIMATE.start_my_drv_probe_#t~pre38#1_107|))) |v_#memory_int_821|) (= |v_my_callbackThread1of1ForFork0_#t~mem32_175| (select .cse2 .cse0)) (= (store |v_#memory_$Pointer$.base_758| |v_~#t2~0.base_70| (store (select |v_#memory_$Pointer$.base_758| |v_~#t2~0.base_70|) |v_~#t2~0.offset_67| (select (select |v_#memory_$Pointer$.base_757| |v_~#t2~0.base_70|) |v_~#t2~0.offset_67|))) |v_#memory_$Pointer$.base_757|) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_308, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_759|, #pthreadsForks=|v_#pthreadsForks_50|, ~#t2~0.offset=|v_~#t2~0.offset_67|, #memory_int=|v_#memory_int_823|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_308, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_759|, ~#t2~0.base=|v_~#t2~0.base_70|} OutVars{ULTIMATE.start_my_drv_probe_#t~nondet37#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet37#1_56|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_308, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_175|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_757|, #pthreadsForks=|v_#pthreadsForks_49|, ~#t2~0.offset=|v_~#t2~0.offset_67|, #memory_int=|v_#memory_int_821|, ULTIMATE.start_my_drv_probe_#t~pre36#1=|v_ULTIMATE.start_my_drv_probe_#t~pre36#1_68|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_308, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_757|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_107|, ~#t2~0.base=|v_~#t2~0.base_70|} AuxVars[|v_#memory_$Pointer$.base_758|, |v_#memory_$Pointer$.offset_758|] AssignedVars[ULTIMATE.start_my_drv_probe_#t~nondet37#1, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #pthreadsForks, #memory_int, ULTIMATE.start_my_drv_probe_#t~pre36#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [561] L1712-1-->my_callbackEXIT: Formula: (and (= |v_#pthreadsMutex_193| (store |v_#pthreadsMutex_194| v_my_callbackThread1of1ForFork0_~data~0.base_105 (store (select |v_#pthreadsMutex_194| v_my_callbackThread1of1ForFork0_~data~0.base_105) v_my_callbackThread1of1ForFork0_~data~0.offset_105 0))) (= |v_my_callbackThread1of1ForFork0_#res.base_9| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_9| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_194|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_105, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_105} OutVars{#pthreadsMutex=|v_#pthreadsMutex_193|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_105, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_9|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_45|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_9|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_105} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] [2022-12-13 12:08:08,181 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 12:08:08,182 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1105 [2022-12-13 12:08:08,182 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 288 flow [2022-12-13 12:08:08,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:08,182 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:08,182 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:08,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:08:08,183 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:08,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1987851340, now seen corresponding path program 1 times [2022-12-13 12:08:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:08,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475800435] [2022-12-13 12:08:08,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:08,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:09,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:09,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475800435] [2022-12-13 12:08:09,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475800435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:09,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:09,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 12:08:09,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994085081] [2022-12-13 12:08:09,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:09,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:08:09,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:09,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:08:09,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:08:09,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-13 12:08:09,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 288 flow. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:09,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:09,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-13 12:08:09,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:10,285 INFO L130 PetriNetUnfolder]: 52/157 cut-off events. [2022-12-13 12:08:10,286 INFO L131 PetriNetUnfolder]: For 610/610 co-relation queries the response was YES. [2022-12-13 12:08:10,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 157 events. 52/157 cut-off events. For 610/610 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 612 event pairs, 0 based on Foata normal form. 1/156 useless extension candidates. Maximal degree in co-relation 493. Up to 48 conditions per place. [2022-12-13 12:08:10,287 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 34 selfloop transitions, 15 changer transitions 15/65 dead transitions. [2022-12-13 12:08:10,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 533 flow [2022-12-13 12:08:10,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 12:08:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 12:08:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2022-12-13 12:08:10,289 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29259259259259257 [2022-12-13 12:08:10,289 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 288 flow. Second operand 10 states and 79 transitions. [2022-12-13 12:08:10,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 533 flow [2022-12-13 12:08:10,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 479 flow, removed 18 selfloop flow, removed 7 redundant places. [2022-12-13 12:08:10,292 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 305 flow [2022-12-13 12:08:10,292 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=305, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2022-12-13 12:08:10,293 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2022-12-13 12:08:10,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:10,293 INFO L89 Accepts]: Start accepts. Operand has 57 places, 38 transitions, 305 flow [2022-12-13 12:08:10,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:10,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:10,294 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 38 transitions, 305 flow [2022-12-13 12:08:10,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 38 transitions, 305 flow [2022-12-13 12:08:10,303 INFO L130 PetriNetUnfolder]: 10/75 cut-off events. [2022-12-13 12:08:10,303 INFO L131 PetriNetUnfolder]: For 267/274 co-relation queries the response was YES. [2022-12-13 12:08:10,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 75 events. 10/75 cut-off events. For 267/274 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 253 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 210. Up to 16 conditions per place. [2022-12-13 12:08:10,304 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 38 transitions, 305 flow [2022-12-13 12:08:10,304 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 12:08:10,311 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:10,312 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:10,314 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:10,314 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:10,424 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:10,425 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:10,427 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:10,427 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:10,745 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:10,746 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-12-13 12:08:10,749 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:10,749 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:10,752 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:10,753 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:10,754 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:10,755 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:15,685 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 12:08:15,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5393 [2022-12-13 12:08:15,686 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 318 flow [2022-12-13 12:08:15,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:15,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:15,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:15,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:08:15,686 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:15,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:15,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1064183892, now seen corresponding path program 1 times [2022-12-13 12:08:15,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:15,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675322163] [2022-12-13 12:08:15,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:15,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:16,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:16,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675322163] [2022-12-13 12:08:16,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675322163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:16,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:16,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 12:08:16,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480846628] [2022-12-13 12:08:16,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:16,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:08:16,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:16,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:08:16,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:08:16,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 12:08:16,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 318 flow. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:16,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:16,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 12:08:16,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:17,355 INFO L130 PetriNetUnfolder]: 35/121 cut-off events. [2022-12-13 12:08:17,355 INFO L131 PetriNetUnfolder]: For 640/640 co-relation queries the response was YES. [2022-12-13 12:08:17,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 121 events. 35/121 cut-off events. For 640/640 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 455 event pairs, 20 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 473. Up to 97 conditions per place. [2022-12-13 12:08:17,358 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 34 selfloop transitions, 13 changer transitions 1/49 dead transitions. [2022-12-13 12:08:17,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 49 transitions, 497 flow [2022-12-13 12:08:17,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:08:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 12:08:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-12-13 12:08:17,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2222222222222222 [2022-12-13 12:08:17,360 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 318 flow. Second operand 9 states and 50 transitions. [2022-12-13 12:08:17,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 49 transitions, 497 flow [2022-12-13 12:08:17,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 432 flow, removed 23 selfloop flow, removed 6 redundant places. [2022-12-13 12:08:17,363 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 352 flow [2022-12-13 12:08:17,364 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=352, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2022-12-13 12:08:17,364 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2022-12-13 12:08:17,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:17,364 INFO L89 Accepts]: Start accepts. Operand has 56 places, 41 transitions, 352 flow [2022-12-13 12:08:17,365 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:17,365 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:17,365 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 41 transitions, 352 flow [2022-12-13 12:08:17,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 41 transitions, 352 flow [2022-12-13 12:08:17,376 INFO L130 PetriNetUnfolder]: 9/73 cut-off events. [2022-12-13 12:08:17,376 INFO L131 PetriNetUnfolder]: For 251/259 co-relation queries the response was YES. [2022-12-13 12:08:17,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 73 events. 9/73 cut-off events. For 251/259 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 279 event pairs, 1 based on Foata normal form. 2/72 useless extension candidates. Maximal degree in co-relation 253. Up to 17 conditions per place. [2022-12-13 12:08:17,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 41 transitions, 352 flow [2022-12-13 12:08:17,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-13 12:08:17,382 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:17,383 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:17,384 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:17,384 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:17,737 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:17,738 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2022-12-13 12:08:17,740 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:17,741 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:17,744 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:17,744 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2022-12-13 12:08:17,746 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:17,747 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:17,748 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [603] L1712-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_300 28))) (and (= (store |v_#pthreadsMutex_452| v_my_callbackThread1of1ForFork1_~data~0.base_300 (store (select |v_#pthreadsMutex_452| v_my_callbackThread1of1ForFork1_~data~0.base_300) v_my_callbackThread1of1ForFork1_~data~0.offset_300 0)) |v_#pthreadsMutex_451|) (= |v_my_callbackThread1of1ForFork1_#res.base_56| 0) (= (store |v_#memory_$Pointer$.offset_788| v_my_callbackThread1of1ForFork1_~data~0.base_300 (store (select |v_#memory_$Pointer$.offset_788| v_my_callbackThread1of1ForFork1_~data~0.base_300) .cse0 (select (select |v_#memory_$Pointer$.offset_787| v_my_callbackThread1of1ForFork1_~data~0.base_300) .cse0))) |v_#memory_$Pointer$.offset_787|) (= |v_my_callbackThread1of1ForFork1_#res.offset_56| 0) (= (store |v_#memory_int_850| v_my_callbackThread1of1ForFork1_~data~0.base_300 (store (select |v_#memory_int_850| v_my_callbackThread1of1ForFork1_~data~0.base_300) .cse0 (+ 1 |v_my_callbackThread1of1ForFork1_#t~mem32_171|))) |v_#memory_int_849|) (= (store |v_#memory_$Pointer$.base_788| v_my_callbackThread1of1ForFork1_~data~0.base_300 (store (select |v_#memory_$Pointer$.base_788| v_my_callbackThread1of1ForFork1_~data~0.base_300) .cse0 (select (select |v_#memory_$Pointer$.base_787| v_my_callbackThread1of1ForFork1_~data~0.base_300) .cse0))) |v_#memory_$Pointer$.base_787|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_171|, #pthreadsMutex=|v_#pthreadsMutex_452|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_300, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_300, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_788|, #memory_int=|v_#memory_int_850|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_788|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_451|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_300, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_56|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_300, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_787|, #memory_int=|v_#memory_int_849|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_56|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_787|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, my_callbackThread1of1ForFork1_#res.base, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] and [613] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_525| v_my_callbackThread1of1ForFork0_~data~0.base_339)) (.cse5 (select |v_#memory_$Pointer$.offset_880| v_my_callbackThread1of1ForFork0_~data~0.base_339)) (.cse3 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_339 28)) (.cse4 (select |v_#memory_$Pointer$.base_880| v_my_callbackThread1of1ForFork0_~data~0.base_339)) (.cse2 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_339 24))) (and (= (store |v_#pthreadsMutex_525| v_my_callbackThread1of1ForFork0_~data~0.base_339 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_339 0)) |v_#pthreadsMutex_523|) (= |v_my_callbackThread1of1ForFork0_#res.offset_66| 0) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_339) 0) (= |v_#memory_int_934| (store |v_#memory_int_936| v_my_callbackThread1of1ForFork0_~data~0.base_339 (let ((.cse1 (select |v_#memory_int_936| v_my_callbackThread1of1ForFork0_~data~0.base_339))) (store (store .cse1 .cse2 1) .cse3 (+ (select .cse1 .cse3) 1))))) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_70 v_~my_dev~0.offset_160) (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_70 v_~my_dev~0.base_160) (= |v_my_callbackThread1of1ForFork0_#res.base_66| 0) (= |v_#memory_$Pointer$.base_879| (store |v_#memory_$Pointer$.base_880| v_my_callbackThread1of1ForFork0_~data~0.base_339 (store .cse4 .cse3 (select (select |v_#memory_$Pointer$.base_879| v_my_callbackThread1of1ForFork0_~data~0.base_339) .cse3)))) (= v_my_callbackThread1of1ForFork0_~data~0.base_339 v_my_callbackThread1of1ForFork0_~__mptr~0.base_70) (= |v_#memory_$Pointer$.offset_880| (store |v_#memory_$Pointer$.offset_881| v_my_callbackThread1of1ForFork0_~data~0.base_339 (store (select |v_#memory_$Pointer$.offset_881| v_my_callbackThread1of1ForFork0_~data~0.base_339) .cse2 (select .cse5 .cse2)))) (= .cse2 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_70) (= (store |v_#memory_$Pointer$.offset_880| v_my_callbackThread1of1ForFork0_~data~0.base_339 (store .cse5 .cse3 (select (select |v_#memory_$Pointer$.offset_879| v_my_callbackThread1of1ForFork0_~data~0.base_339) .cse3))) |v_#memory_$Pointer$.offset_879|) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_50| v_my_callbackThread1of1ForFork0_~arg.base_50) (= v_my_callbackThread1of1ForFork0_~arg.offset_50 |v_my_callbackThread1of1ForFork0_#in~arg.offset_50|) (= (store |v_#memory_$Pointer$.base_881| v_my_callbackThread1of1ForFork0_~data~0.base_339 (store (select |v_#memory_$Pointer$.base_881| v_my_callbackThread1of1ForFork0_~data~0.base_339) .cse2 (select .cse4 .cse2))) |v_#memory_$Pointer$.base_880|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_525|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_50|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_881|, ~my_dev~0.base=v_~my_dev~0.base_160, #memory_int=|v_#memory_int_936|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_50|, ~my_dev~0.offset=v_~my_dev~0.offset_160, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_881|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_523|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_205|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_879|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_50, ~my_dev~0.base=v_~my_dev~0.base_160, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_50|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_132|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_70, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_339, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_339, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_66|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_50|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_50, #memory_int=|v_#memory_int_934|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_70, ~my_dev~0.offset=v_~my_dev~0.offset_160, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_66|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_879|} AuxVars[|v_#memory_$Pointer$.offset_880|, |v_#memory_$Pointer$.base_880|] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] [2022-12-13 12:08:19,640 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:19,641 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:19,644 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:19,645 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-12-13 12:08:19,648 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:19,649 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:19,653 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:19,653 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:19,657 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:19,657 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-12-13 12:08:19,669 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:19,670 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:27,492 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 12:08:27,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10129 [2022-12-13 12:08:27,493 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 328 flow [2022-12-13 12:08:27,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:27,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:27,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:27,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:08:27,494 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:27,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:27,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1962233253, now seen corresponding path program 1 times [2022-12-13 12:08:27,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:27,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978602197] [2022-12-13 12:08:27,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:27,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:27,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:27,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978602197] [2022-12-13 12:08:27,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978602197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:27,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:27,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:08:27,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564937157] [2022-12-13 12:08:27,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:27,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:08:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:27,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:08:27,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:08:27,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 12:08:27,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 328 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:27,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:27,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 12:08:27,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:27,992 INFO L130 PetriNetUnfolder]: 34/116 cut-off events. [2022-12-13 12:08:27,992 INFO L131 PetriNetUnfolder]: For 408/408 co-relation queries the response was YES. [2022-12-13 12:08:27,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 116 events. 34/116 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 438 event pairs, 23 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 477. Up to 106 conditions per place. [2022-12-13 12:08:27,993 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 29 selfloop transitions, 5 changer transitions 5/40 dead transitions. [2022-12-13 12:08:27,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 40 transitions, 409 flow [2022-12-13 12:08:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:08:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:08:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-13 12:08:27,994 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33 [2022-12-13 12:08:27,994 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 328 flow. Second operand 4 states and 33 transitions. [2022-12-13 12:08:27,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 40 transitions, 409 flow [2022-12-13 12:08:27,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 366 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-12-13 12:08:27,996 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 267 flow [2022-12-13 12:08:27,996 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2022-12-13 12:08:27,997 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2022-12-13 12:08:27,997 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:27,997 INFO L89 Accepts]: Start accepts. Operand has 50 places, 35 transitions, 267 flow [2022-12-13 12:08:27,998 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:27,998 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:27,998 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 35 transitions, 267 flow [2022-12-13 12:08:27,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 35 transitions, 267 flow [2022-12-13 12:08:28,007 INFO L130 PetriNetUnfolder]: 8/63 cut-off events. [2022-12-13 12:08:28,007 INFO L131 PetriNetUnfolder]: For 146/149 co-relation queries the response was YES. [2022-12-13 12:08:28,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 63 events. 8/63 cut-off events. For 146/149 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 221 event pairs, 1 based on Foata normal form. 2/62 useless extension candidates. Maximal degree in co-relation 205. Up to 15 conditions per place. [2022-12-13 12:08:28,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 35 transitions, 267 flow [2022-12-13 12:08:28,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-13 12:08:28,009 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:08:28,010 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 12:08:28,010 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 267 flow [2022-12-13 12:08:28,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:28,010 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:28,010 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:28,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:08:28,010 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:28,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:28,011 INFO L85 PathProgramCache]: Analyzing trace with hash -994982530, now seen corresponding path program 1 times [2022-12-13 12:08:28,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:28,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261424676] [2022-12-13 12:08:28,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:28,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:28,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:28,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261424676] [2022-12-13 12:08:28,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261424676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:28,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:28,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:08:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35658240] [2022-12-13 12:08:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:28,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:08:28,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:28,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:08:28,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:08:28,421 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 12:08:28,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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-13 12:08:28,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:28,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 12:08:28,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:28,615 INFO L130 PetriNetUnfolder]: 33/111 cut-off events. [2022-12-13 12:08:28,615 INFO L131 PetriNetUnfolder]: For 254/254 co-relation queries the response was YES. [2022-12-13 12:08:28,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 111 events. 33/111 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 423 event pairs, 4 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 433. Up to 75 conditions per place. [2022-12-13 12:08:28,616 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 32 selfloop transitions, 11 changer transitions 0/44 dead transitions. [2022-12-13 12:08:28,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 392 flow [2022-12-13 12:08:28,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:08:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:08:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-13 12:08:28,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2022-12-13 12:08:28,618 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 267 flow. Second operand 5 states and 41 transitions. [2022-12-13 12:08:28,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 392 flow [2022-12-13 12:08:28,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 371 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 12:08:28,620 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 294 flow [2022-12-13 12:08:28,620 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2022-12-13 12:08:28,621 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2022-12-13 12:08:28,621 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:28,621 INFO L89 Accepts]: Start accepts. Operand has 50 places, 36 transitions, 294 flow [2022-12-13 12:08:28,622 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:28,622 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:28,622 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 36 transitions, 294 flow [2022-12-13 12:08:28,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 36 transitions, 294 flow [2022-12-13 12:08:28,634 INFO L130 PetriNetUnfolder]: 7/63 cut-off events. [2022-12-13 12:08:28,635 INFO L131 PetriNetUnfolder]: For 225/230 co-relation queries the response was YES. [2022-12-13 12:08:28,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 63 events. 7/63 cut-off events. For 225/230 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 225 event pairs, 0 based on Foata normal form. 2/64 useless extension candidates. Maximal degree in co-relation 192. Up to 15 conditions per place. [2022-12-13 12:08:28,635 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 36 transitions, 294 flow [2022-12-13 12:08:28,636 INFO L226 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-13 12:08:28,636 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:08:28,637 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 12:08:28,637 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 294 flow [2022-12-13 12:08:28,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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-13 12:08:28,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:28,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:28,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:08:28,638 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:28,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:28,639 INFO L85 PathProgramCache]: Analyzing trace with hash -994982516, now seen corresponding path program 1 times [2022-12-13 12:08:28,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:28,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442406474] [2022-12-13 12:08:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:29,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:29,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442406474] [2022-12-13 12:08:29,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442406474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:29,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:29,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:08:29,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074075681] [2022-12-13 12:08:29,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:29,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:08:29,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:29,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:08:29,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:08:29,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 12:08:29,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 294 flow. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:29,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:29,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 12:08:29,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:29,974 INFO L130 PetriNetUnfolder]: 32/110 cut-off events. [2022-12-13 12:08:29,974 INFO L131 PetriNetUnfolder]: For 386/386 co-relation queries the response was YES. [2022-12-13 12:08:29,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 110 events. 32/110 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 406 event pairs, 21 based on Foata normal form. 1/110 useless extension candidates. Maximal degree in co-relation 414. Up to 93 conditions per place. [2022-12-13 12:08:29,975 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 26 selfloop transitions, 5 changer transitions 11/43 dead transitions. [2022-12-13 12:08:29,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 43 transitions, 406 flow [2022-12-13 12:08:29,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:08:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:08:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-12-13 12:08:29,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.234375 [2022-12-13 12:08:29,976 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 294 flow. Second operand 8 states and 45 transitions. [2022-12-13 12:08:29,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 43 transitions, 406 flow [2022-12-13 12:08:29,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 43 transitions, 392 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 12:08:29,979 INFO L231 Difference]: Finished difference. Result has 57 places, 31 transitions, 240 flow [2022-12-13 12:08:29,979 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=240, PETRI_PLACES=57, PETRI_TRANSITIONS=31} [2022-12-13 12:08:29,980 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2022-12-13 12:08:29,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:29,980 INFO L89 Accepts]: Start accepts. Operand has 57 places, 31 transitions, 240 flow [2022-12-13 12:08:29,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:29,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:29,980 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 31 transitions, 240 flow [2022-12-13 12:08:29,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 31 transitions, 240 flow [2022-12-13 12:08:29,988 INFO L130 PetriNetUnfolder]: 6/50 cut-off events. [2022-12-13 12:08:29,988 INFO L131 PetriNetUnfolder]: For 140/143 co-relation queries the response was YES. [2022-12-13 12:08:29,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 50 events. 6/50 cut-off events. For 140/143 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 170 event pairs, 0 based on Foata normal form. 2/51 useless extension candidates. Maximal degree in co-relation 174. Up to 11 conditions per place. [2022-12-13 12:08:29,989 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 31 transitions, 240 flow [2022-12-13 12:08:29,989 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 12:08:29,995 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:29,996 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:29,998 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:29,999 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:30,332 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:08:30,333 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 353 [2022-12-13 12:08:30,333 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 234 flow [2022-12-13 12:08:30,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:30,333 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:30,333 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:30,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:08:30,333 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:30,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:30,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1104936851, now seen corresponding path program 1 times [2022-12-13 12:08:30,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:30,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308789864] [2022-12-13 12:08:30,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:30,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:30,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:30,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308789864] [2022-12-13 12:08:30,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308789864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:30,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:30,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:08:30,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342623516] [2022-12-13 12:08:30,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:30,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:08:30,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:30,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:08:30,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:08:30,789 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 12:08:30,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:30,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:30,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 12:08:30,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:31,102 INFO L130 PetriNetUnfolder]: 44/130 cut-off events. [2022-12-13 12:08:31,102 INFO L131 PetriNetUnfolder]: For 310/310 co-relation queries the response was YES. [2022-12-13 12:08:31,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 130 events. 44/130 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 506 event pairs, 4 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 496. Up to 52 conditions per place. [2022-12-13 12:08:31,103 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 30 selfloop transitions, 11 changer transitions 5/47 dead transitions. [2022-12-13 12:08:31,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 47 transitions, 416 flow [2022-12-13 12:08:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:08:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:08:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-13 12:08:31,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2022-12-13 12:08:31,105 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 234 flow. Second operand 6 states and 46 transitions. [2022-12-13 12:08:31,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 47 transitions, 416 flow [2022-12-13 12:08:31,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 366 flow, removed 16 selfloop flow, removed 8 redundant places. [2022-12-13 12:08:31,107 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 241 flow [2022-12-13 12:08:31,107 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2022-12-13 12:08:31,108 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -7 predicate places. [2022-12-13 12:08:31,108 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:31,108 INFO L89 Accepts]: Start accepts. Operand has 46 places, 32 transitions, 241 flow [2022-12-13 12:08:31,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:31,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:31,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 32 transitions, 241 flow [2022-12-13 12:08:31,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 32 transitions, 241 flow [2022-12-13 12:08:31,116 INFO L130 PetriNetUnfolder]: 8/57 cut-off events. [2022-12-13 12:08:31,117 INFO L131 PetriNetUnfolder]: For 183/184 co-relation queries the response was YES. [2022-12-13 12:08:31,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 57 events. 8/57 cut-off events. For 183/184 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 85. Up to 12 conditions per place. [2022-12-13 12:08:31,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 32 transitions, 241 flow [2022-12-13 12:08:31,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 12:08:31,122 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:31,123 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-13 12:08:31,129 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [617] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse3 (select |v_#memory_$Pointer$.base_926| v_my_callbackThread1of1ForFork0_~data~0.base_347)) (.cse2 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_347 28)) (.cse5 (select |v_#pthreadsMutex_545| v_my_callbackThread1of1ForFork0_~data~0.base_347)) (.cse4 (select |v_#memory_$Pointer$.offset_926| v_my_callbackThread1of1ForFork0_~data~0.base_347)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_347 24))) (and (= (store |v_#memory_int_962| v_my_callbackThread1of1ForFork0_~data~0.base_347 (let ((.cse0 (select |v_#memory_int_962| v_my_callbackThread1of1ForFork0_~data~0.base_347))) (store (store .cse0 .cse1 1) .cse2 (+ (select .cse0 .cse2) 1)))) |v_#memory_int_960|) (= |v_my_callbackThread1of1ForFork0_#res.offset_74| 0) (= (store |v_#memory_$Pointer$.base_927| v_my_callbackThread1of1ForFork0_~data~0.base_347 (store (select |v_#memory_$Pointer$.base_927| v_my_callbackThread1of1ForFork0_~data~0.base_347) .cse1 (select .cse3 .cse1))) |v_#memory_$Pointer$.base_926|) (= |v_#memory_$Pointer$.offset_925| (store |v_#memory_$Pointer$.offset_926| v_my_callbackThread1of1ForFork0_~data~0.base_347 (store .cse4 .cse2 (select (select |v_#memory_$Pointer$.offset_925| v_my_callbackThread1of1ForFork0_~data~0.base_347) .cse2)))) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_56| v_my_callbackThread1of1ForFork0_~arg.base_56) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_76 v_~my_dev~0.offset_166) (= .cse1 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_76) (= v_my_callbackThread1of1ForFork0_~data~0.base_347 v_my_callbackThread1of1ForFork0_~__mptr~0.base_76) (= |v_my_callbackThread1of1ForFork0_#res.base_74| 0) (= (store |v_#pthreadsMutex_545| v_my_callbackThread1of1ForFork0_~data~0.base_347 (store .cse5 v_my_callbackThread1of1ForFork0_~data~0.offset_347 0)) |v_#pthreadsMutex_543|) (= (store |v_#memory_$Pointer$.base_926| v_my_callbackThread1of1ForFork0_~data~0.base_347 (store .cse3 .cse2 (select (select |v_#memory_$Pointer$.base_925| v_my_callbackThread1of1ForFork0_~data~0.base_347) .cse2))) |v_#memory_$Pointer$.base_925|) (= v_my_callbackThread1of1ForFork0_~arg.offset_56 |v_my_callbackThread1of1ForFork0_#in~arg.offset_56|) (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_76 v_~my_dev~0.base_166) (= (select .cse5 v_my_callbackThread1of1ForFork0_~data~0.offset_347) 0) (= (store |v_#memory_$Pointer$.offset_927| v_my_callbackThread1of1ForFork0_~data~0.base_347 (store (select |v_#memory_$Pointer$.offset_927| v_my_callbackThread1of1ForFork0_~data~0.base_347) .cse1 (select .cse4 .cse1))) |v_#memory_$Pointer$.offset_926|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_545|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_56|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_927|, ~my_dev~0.base=v_~my_dev~0.base_166, #memory_int=|v_#memory_int_962|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_56|, ~my_dev~0.offset=v_~my_dev~0.offset_166, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_927|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_543|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_213|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_925|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_56, ~my_dev~0.base=v_~my_dev~0.base_166, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_56|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_138|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_76, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_347, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_347, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_74|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_56|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_56, #memory_int=|v_#memory_int_960|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_76, ~my_dev~0.offset=v_~my_dev~0.offset_166, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_74|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_925|} AuxVars[|v_#memory_$Pointer$.base_926|, |v_#memory_$Pointer$.offset_926|] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [572] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_364| |v_ULTIMATE.start_main_~#data~1#1.base_139|))) (and (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_147| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_57|) 1 0)) (= (store |v_#memory_$Pointer$.base_310| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78| (store (select |v_#memory_$Pointer$.base_310| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_70| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_47|)) |v_#memory_$Pointer$.base_309|) (= (store |v_#memory_int_365| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78| (store (select |v_#memory_int_365| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_70| (select (select |v_#memory_int_364| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_70|))) |v_#memory_int_364|) (= |v_ULTIMATE.start_main_#t~mem47#1_57| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_139| 28))) (= |v_ULTIMATE.start_ldv_assert_~expression#1_175| 0) (= |v_#valid_156| (store |v_#valid_157| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78| 0)) (not (= (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_139| 24)) 1) 1 0) 0)) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_147| |v_ULTIMATE.start_ldv_assert_~expression#1_175|) (= (store |v_#memory_$Pointer$.offset_310| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78| (store (select |v_#memory_$Pointer$.offset_310| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_70| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_47|)) |v_#memory_$Pointer$.offset_309|))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_70|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_310|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_47|, #valid=|v_#valid_157|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_47|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_139|, #memory_int=|v_#memory_int_365|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_310|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_139|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_175|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_309|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_57|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_139|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_36|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_147|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_364|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_309|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_139|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_main_#t~mem47#1, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~mem46#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:08:32,894 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:08:32,895 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1787 [2022-12-13 12:08:32,895 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 244 flow [2022-12-13 12:08:32,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:32,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:32,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:32,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:08:32,896 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:32,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1340647884, now seen corresponding path program 1 times [2022-12-13 12:08:32,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:32,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203503248] [2022-12-13 12:08:32,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:32,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:33,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:33,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203503248] [2022-12-13 12:08:33,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203503248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:33,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:33,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:08:33,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273892695] [2022-12-13 12:08:33,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:33,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:08:33,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:33,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:08:33,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:08:33,859 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 12:08:33,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 244 flow. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:33,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:33,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 12:08:33,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:34,333 INFO L130 PetriNetUnfolder]: 48/139 cut-off events. [2022-12-13 12:08:34,333 INFO L131 PetriNetUnfolder]: For 347/347 co-relation queries the response was YES. [2022-12-13 12:08:34,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 139 events. 48/139 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 553 event pairs, 8 based on Foata normal form. 1/139 useless extension candidates. Maximal degree in co-relation 222. Up to 38 conditions per place. [2022-12-13 12:08:34,334 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 28 selfloop transitions, 16 changer transitions 2/46 dead transitions. [2022-12-13 12:08:34,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 46 transitions, 366 flow [2022-12-13 12:08:34,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:08:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:08:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-12-13 12:08:34,335 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2760416666666667 [2022-12-13 12:08:34,335 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 244 flow. Second operand 8 states and 53 transitions. [2022-12-13 12:08:34,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 46 transitions, 366 flow [2022-12-13 12:08:34,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 346 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 12:08:34,337 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 266 flow [2022-12-13 12:08:34,337 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=266, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2022-12-13 12:08:34,337 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2022-12-13 12:08:34,337 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:34,337 INFO L89 Accepts]: Start accepts. Operand has 51 places, 32 transitions, 266 flow [2022-12-13 12:08:34,338 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:34,338 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:34,338 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 32 transitions, 266 flow [2022-12-13 12:08:34,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 32 transitions, 266 flow [2022-12-13 12:08:34,347 INFO L130 PetriNetUnfolder]: 7/61 cut-off events. [2022-12-13 12:08:34,347 INFO L131 PetriNetUnfolder]: For 240/241 co-relation queries the response was YES. [2022-12-13 12:08:34,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 61 events. 7/61 cut-off events. For 240/241 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 214 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 191. Up to 13 conditions per place. [2022-12-13 12:08:34,348 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 32 transitions, 266 flow [2022-12-13 12:08:34,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-13 12:08:36,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [611] $Ultimate##0-->L1727-3: Formula: (let ((.cse0 (select |v_#memory_$Pointer$.base_850| v_my_callbackThread1of1ForFork0_~data~0.base_335)) (.cse4 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_335 24)) (.cse5 (select |v_#memory_$Pointer$.offset_850| v_my_callbackThread1of1ForFork0_~data~0.base_335)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_335 28)) (.cse6 (select |v_#pthreadsMutex_501| v_my_callbackThread1of1ForFork0_~data~0.base_335))) (and (= v_my_callbackThread1of1ForFork0_~data~0.base_335 v_my_callbackThread1of1ForFork0_~__mptr~0.base_66) (= (store |v_#memory_$Pointer$.offset_851| |v_~#t2~0.base_85| (store (select |v_#memory_$Pointer$.offset_851| |v_~#t2~0.base_85|) |v_~#t2~0.offset_81| (select (select |v_#memory_$Pointer$.offset_849| |v_~#t2~0.base_85|) |v_~#t2~0.offset_81|))) |v_#memory_$Pointer$.offset_849|) (= (store |v_#memory_$Pointer$.base_850| v_my_callbackThread1of1ForFork0_~data~0.base_335 (store .cse0 .cse1 (select (select |v_#memory_$Pointer$.base_851| v_my_callbackThread1of1ForFork0_~data~0.base_335) .cse1))) |v_#memory_$Pointer$.base_851|) (= |v_#pthreadsForks_71| (+ |v_#pthreadsForks_72| 1)) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_66 v_~my_dev~0.offset_152) (= (let ((.cse2 (store |v_#memory_int_907| v_my_callbackThread1of1ForFork0_~data~0.base_335 (let ((.cse3 (select |v_#memory_int_907| v_my_callbackThread1of1ForFork0_~data~0.base_335))) (store (store .cse3 .cse4 1) .cse1 (+ (select .cse3 .cse1) 1)))))) (store .cse2 |v_~#t2~0.base_85| (store (select .cse2 |v_~#t2~0.base_85|) |v_~#t2~0.offset_81| |v_ULTIMATE.start_my_drv_probe_#t~pre38#1_122|))) |v_#memory_int_905|) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_46| v_my_callbackThread1of1ForFork0_~arg.base_46) (= (store |v_#memory_$Pointer$.offset_852| v_my_callbackThread1of1ForFork0_~data~0.base_335 (store (select |v_#memory_$Pointer$.offset_852| v_my_callbackThread1of1ForFork0_~data~0.base_335) .cse4 (select .cse5 .cse4))) |v_#memory_$Pointer$.offset_850|) (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_66 v_~my_dev~0.base_152) (= (select .cse6 v_my_callbackThread1of1ForFork0_~data~0.offset_335) 0) (= (store |v_#memory_$Pointer$.base_852| v_my_callbackThread1of1ForFork0_~data~0.base_335 (store (select |v_#memory_$Pointer$.base_852| v_my_callbackThread1of1ForFork0_~data~0.base_335) .cse4 (select .cse0 .cse4))) |v_#memory_$Pointer$.base_850|) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_66 .cse4) (= (store |v_#memory_$Pointer$.base_851| |v_~#t2~0.base_85| (store (select |v_#memory_$Pointer$.base_851| |v_~#t2~0.base_85|) |v_~#t2~0.offset_81| (select (select |v_#memory_$Pointer$.base_849| |v_~#t2~0.base_85|) |v_~#t2~0.offset_81|))) |v_#memory_$Pointer$.base_849|) (= |v_#pthreadsForks_72| |v_ULTIMATE.start_my_drv_probe_#t~pre38#1_122|) (= |v_#memory_$Pointer$.offset_851| (store |v_#memory_$Pointer$.offset_850| v_my_callbackThread1of1ForFork0_~data~0.base_335 (store .cse5 .cse1 (select (select |v_#memory_$Pointer$.offset_851| v_my_callbackThread1of1ForFork0_~data~0.base_335) .cse1)))) (= |v_my_callbackThread1of1ForFork0_#res.offset_62| 0) (= v_my_callbackThread1of1ForFork0_~arg.offset_46 |v_my_callbackThread1of1ForFork0_#in~arg.offset_46|) (= (store |v_#pthreadsMutex_501| v_my_callbackThread1of1ForFork0_~data~0.base_335 (store .cse6 v_my_callbackThread1of1ForFork0_~data~0.offset_335 0)) |v_#pthreadsMutex_499|) (= |v_my_callbackThread1of1ForFork0_#res.base_62| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_501|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_46|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_852|, #pthreadsForks=|v_#pthreadsForks_72|, ~#t2~0.offset=|v_~#t2~0.offset_81|, ~my_dev~0.base=v_~my_dev~0.base_152, #memory_int=|v_#memory_int_907|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_46|, ~my_dev~0.offset=v_~my_dev~0.offset_152, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_852|, ~#t2~0.base=|v_~#t2~0.base_85|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_499|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_201|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_849|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_46, ~my_dev~0.base=v_~my_dev~0.base_152, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_46|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_128|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_66, ULTIMATE.start_my_drv_probe_#t~pre36#1=|v_ULTIMATE.start_my_drv_probe_#t~pre36#1_79|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_335, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_122|, ULTIMATE.start_my_drv_probe_#t~nondet37#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet37#1_67|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_335, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_62|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_46|, #pthreadsForks=|v_#pthreadsForks_71|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_46, ~#t2~0.offset=|v_~#t2~0.offset_81|, #memory_int=|v_#memory_int_905|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_66, ~my_dev~0.offset=v_~my_dev~0.offset_152, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_62|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_849|, ~#t2~0.base=|v_~#t2~0.base_85|} AuxVars[|v_#memory_$Pointer$.base_851|, |v_#memory_$Pointer$.base_850|, |v_#memory_$Pointer$.offset_850|, |v_#memory_$Pointer$.offset_851|] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, ULTIMATE.start_my_drv_probe_#t~pre36#1, my_callbackThread1of1ForFork0_~data~0.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#t~nondet37#1, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_#res.base, #pthreadsForks, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [556] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_172| v_my_callbackThread1of1ForFork1_~data~0.base_101))) (and (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_13|) (= v_my_callbackThread1of1ForFork1_~data~0.base_101 v_my_callbackThread1of1ForFork1_~__mptr~0.base_17) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_101 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_17) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (store |v_#pthreadsMutex_172| v_my_callbackThread1of1ForFork1_~data~0.base_101 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_101 1)) |v_#pthreadsMutex_171|) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_101) 0) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_13|) (= v_~my_dev~0.offset_54 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_17) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_17 v_~my_dev~0.base_54))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_13|, #pthreadsMutex=|v_#pthreadsMutex_172|, ~my_dev~0.base=v_~my_dev~0.base_54, ~my_dev~0.offset=v_~my_dev~0.offset_54, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_13|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_13|, #pthreadsMutex=|v_#pthreadsMutex_171|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_101, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_101, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, ~my_dev~0.base=v_~my_dev~0.base_54, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_17, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_17, ~my_dev~0.offset=v_~my_dev~0.offset_54, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_13|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_#t~nondet31] [2022-12-13 12:08:39,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [609] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse5 (select |v_#pthreadsMutex_489| v_my_callbackThread1of1ForFork0_~data~0.base_331)) (.cse0 (select |v_#memory_$Pointer$.base_836| v_my_callbackThread1of1ForFork0_~data~0.base_331)) (.cse3 (select |v_#memory_$Pointer$.offset_836| v_my_callbackThread1of1ForFork0_~data~0.base_331)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_331 28)) (.cse2 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_331 24))) (and (= (store |v_#memory_$Pointer$.base_836| v_my_callbackThread1of1ForFork0_~data~0.base_331 (store .cse0 .cse1 (select (select |v_#memory_$Pointer$.base_835| v_my_callbackThread1of1ForFork0_~data~0.base_331) .cse1))) |v_#memory_$Pointer$.base_835|) (= |v_my_callbackThread1of1ForFork0_#res.offset_58| 0) (= (store |v_#memory_$Pointer$.offset_837| v_my_callbackThread1of1ForFork0_~data~0.base_331 (store (select |v_#memory_$Pointer$.offset_837| v_my_callbackThread1of1ForFork0_~data~0.base_331) .cse2 (select .cse3 .cse2))) |v_#memory_$Pointer$.offset_836|) (= |v_my_callbackThread1of1ForFork0_#res.base_58| 0) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_42| v_my_callbackThread1of1ForFork0_~arg.base_42) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_62 v_~my_dev~0.offset_148) (= v_my_callbackThread1of1ForFork0_~data~0.base_331 v_my_callbackThread1of1ForFork0_~__mptr~0.base_62) (= (store |v_#memory_int_895| v_my_callbackThread1of1ForFork0_~data~0.base_331 (let ((.cse4 (select |v_#memory_int_895| v_my_callbackThread1of1ForFork0_~data~0.base_331))) (store (store .cse4 .cse2 1) .cse1 (+ (select .cse4 .cse1) 1)))) |v_#memory_int_893|) (= (select .cse5 v_my_callbackThread1of1ForFork0_~data~0.offset_331) 0) (= (store |v_#pthreadsMutex_489| v_my_callbackThread1of1ForFork0_~data~0.base_331 (store .cse5 v_my_callbackThread1of1ForFork0_~data~0.offset_331 0)) |v_#pthreadsMutex_487|) (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_62 v_~my_dev~0.base_148) (= (store |v_#memory_$Pointer$.base_837| v_my_callbackThread1of1ForFork0_~data~0.base_331 (store (select |v_#memory_$Pointer$.base_837| v_my_callbackThread1of1ForFork0_~data~0.base_331) .cse2 (select .cse0 .cse2))) |v_#memory_$Pointer$.base_836|) (= (store |v_#memory_$Pointer$.offset_836| v_my_callbackThread1of1ForFork0_~data~0.base_331 (store .cse3 .cse1 (select (select |v_#memory_$Pointer$.offset_835| v_my_callbackThread1of1ForFork0_~data~0.base_331) .cse1))) |v_#memory_$Pointer$.offset_835|) (= v_my_callbackThread1of1ForFork0_~arg.offset_42 |v_my_callbackThread1of1ForFork0_#in~arg.offset_42|) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_62 .cse2))) InVars {#pthreadsMutex=|v_#pthreadsMutex_489|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_42|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_837|, ~my_dev~0.base=v_~my_dev~0.base_148, #memory_int=|v_#memory_int_895|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_42|, ~my_dev~0.offset=v_~my_dev~0.offset_148, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_837|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_487|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_197|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_835|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_42, ~my_dev~0.base=v_~my_dev~0.base_148, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_42|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_124|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_62, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_331, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_331, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_58|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_42|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_42, #memory_int=|v_#memory_int_893|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_62, ~my_dev~0.offset=v_~my_dev~0.offset_148, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_58|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_835|} AuxVars[|v_#memory_$Pointer$.base_836|, |v_#memory_$Pointer$.offset_836|] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [556] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_172| v_my_callbackThread1of1ForFork1_~data~0.base_101))) (and (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_13|) (= v_my_callbackThread1of1ForFork1_~data~0.base_101 v_my_callbackThread1of1ForFork1_~__mptr~0.base_17) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_101 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_17) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (store |v_#pthreadsMutex_172| v_my_callbackThread1of1ForFork1_~data~0.base_101 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_101 1)) |v_#pthreadsMutex_171|) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_101) 0) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_13|) (= v_~my_dev~0.offset_54 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_17) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_17 v_~my_dev~0.base_54))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_13|, #pthreadsMutex=|v_#pthreadsMutex_172|, ~my_dev~0.base=v_~my_dev~0.base_54, ~my_dev~0.offset=v_~my_dev~0.offset_54, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_13|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_13|, #pthreadsMutex=|v_#pthreadsMutex_171|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_101, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_101, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, ~my_dev~0.base=v_~my_dev~0.base_54, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_17, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_17, ~my_dev~0.offset=v_~my_dev~0.offset_54, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_13|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_#t~nondet31] [2022-12-13 12:08:41,186 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:41,186 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:41,188 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:41,188 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:58,773 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 12:08:58,774 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24437 [2022-12-13 12:08:58,774 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 275 flow [2022-12-13 12:08:58,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:58,774 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:58,774 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:58,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 12:08:58,775 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:58,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:58,775 INFO L85 PathProgramCache]: Analyzing trace with hash -969761010, now seen corresponding path program 1 times [2022-12-13 12:08:58,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:58,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608183115] [2022-12-13 12:08:58,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:58,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:59,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:59,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608183115] [2022-12-13 12:08:59,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608183115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:59,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:59,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:08:59,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292124452] [2022-12-13 12:08:59,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:59,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:08:59,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:59,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:08:59,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:08:59,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 12:08:59,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 275 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:59,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:59,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 12:08:59,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:59,542 INFO L130 PetriNetUnfolder]: 15/71 cut-off events. [2022-12-13 12:08:59,542 INFO L131 PetriNetUnfolder]: For 347/347 co-relation queries the response was YES. [2022-12-13 12:08:59,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 71 events. 15/71 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 234 event pairs, 2 based on Foata normal form. 1/71 useless extension candidates. Maximal degree in co-relation 272. Up to 40 conditions per place. [2022-12-13 12:08:59,543 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 19 selfloop transitions, 14 changer transitions 5/38 dead transitions. [2022-12-13 12:08:59,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 38 transitions, 382 flow [2022-12-13 12:08:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:08:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:08:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-12-13 12:08:59,544 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22666666666666666 [2022-12-13 12:08:59,544 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 275 flow. Second operand 6 states and 34 transitions. [2022-12-13 12:08:59,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 38 transitions, 382 flow [2022-12-13 12:08:59,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 38 transitions, 336 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-13 12:08:59,546 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 257 flow [2022-12-13 12:08:59,547 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2022-12-13 12:08:59,547 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2022-12-13 12:08:59,547 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:59,547 INFO L89 Accepts]: Start accepts. Operand has 47 places, 30 transitions, 257 flow [2022-12-13 12:08:59,548 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:59,548 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:59,548 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 30 transitions, 257 flow [2022-12-13 12:08:59,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 30 transitions, 257 flow [2022-12-13 12:08:59,555 INFO L130 PetriNetUnfolder]: 4/51 cut-off events. [2022-12-13 12:08:59,555 INFO L131 PetriNetUnfolder]: For 221/222 co-relation queries the response was YES. [2022-12-13 12:08:59,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 51 events. 4/51 cut-off events. For 221/222 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 152 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 164. Up to 12 conditions per place. [2022-12-13 12:08:59,556 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 30 transitions, 257 flow [2022-12-13 12:08:59,556 INFO L226 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-13 12:09:00,055 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:09:00,056 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 509 [2022-12-13 12:09:00,056 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 265 flow [2022-12-13 12:09:00,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:00,056 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:09:00,056 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:09:00,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 12:09:00,056 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:09:00,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:09:00,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1135755034, now seen corresponding path program 1 times [2022-12-13 12:09:00,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:09:00,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387725577] [2022-12-13 12:09:00,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:09:00,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:09:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:09:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:09:00,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:09:00,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387725577] [2022-12-13 12:09:00,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387725577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:09:00,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:09:00,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:09:00,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307386198] [2022-12-13 12:09:00,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:09:00,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:09:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:09:00,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:09:00,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:09:00,834 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 12:09:00,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 265 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:00,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:09:00,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 12:09:00,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:09:01,067 INFO L130 PetriNetUnfolder]: 9/63 cut-off events. [2022-12-13 12:09:01,068 INFO L131 PetriNetUnfolder]: For 320/320 co-relation queries the response was YES. [2022-12-13 12:09:01,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 63 events. 9/63 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 220 event pairs, 2 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 275. Up to 45 conditions per place. [2022-12-13 12:09:01,068 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 28 selfloop transitions, 6 changer transitions 5/39 dead transitions. [2022-12-13 12:09:01,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 39 transitions, 385 flow [2022-12-13 12:09:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:09:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:09:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-12-13 12:09:01,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26811594202898553 [2022-12-13 12:09:01,069 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 265 flow. Second operand 6 states and 37 transitions. [2022-12-13 12:09:01,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 39 transitions, 385 flow [2022-12-13 12:09:01,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 366 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 12:09:01,071 INFO L231 Difference]: Finished difference. Result has 51 places, 31 transitions, 270 flow [2022-12-13 12:09:01,071 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2022-12-13 12:09:01,072 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2022-12-13 12:09:01,072 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:09:01,072 INFO L89 Accepts]: Start accepts. Operand has 51 places, 31 transitions, 270 flow [2022-12-13 12:09:01,072 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:09:01,072 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:09:01,072 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 31 transitions, 270 flow [2022-12-13 12:09:01,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 31 transitions, 270 flow [2022-12-13 12:09:01,080 INFO L130 PetriNetUnfolder]: 4/51 cut-off events. [2022-12-13 12:09:01,081 INFO L131 PetriNetUnfolder]: For 234/236 co-relation queries the response was YES. [2022-12-13 12:09:01,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 51 events. 4/51 cut-off events. For 234/236 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 162 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 191. Up to 11 conditions per place. [2022-12-13 12:09:01,081 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 31 transitions, 270 flow [2022-12-13 12:09:01,081 INFO L226 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-13 12:09:01,082 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.base_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40| (select (select |v_#memory_int_595| |v_~#t1~0.base_41|) |v_~#t1~0.offset_41|)) (= (store |v_#length_118| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_117|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87| 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|) (= (store |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1) |v_#valid_176|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|) (= 0 (select |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, ~#t1~0.base=|v_~#t1~0.base_41|, #valid=|v_#valid_177|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, #memory_int=|v_#memory_int_595|, ~#t1~0.offset=|v_~#t1~0.offset_41|, #length=|v_#length_118|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_58|, ~#t1~0.offset=|v_~#t1~0.offset_41|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_57|, ~#t1~0.base=|v_~#t1~0.base_41|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_44|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_100|, #length=|v_#length_117|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_47|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|, #valid=|v_#valid_176|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_58|, #memory_int=|v_#memory_int_595|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [602] L1712-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_298 28))) (and (= (store |v_#memory_$Pointer$.offset_784| v_my_callbackThread1of1ForFork1_~data~0.base_298 (store (select |v_#memory_$Pointer$.offset_784| v_my_callbackThread1of1ForFork1_~data~0.base_298) .cse0 (select (select |v_#memory_$Pointer$.offset_783| v_my_callbackThread1of1ForFork1_~data~0.base_298) .cse0))) |v_#memory_$Pointer$.offset_783|) (= |v_#memory_int_845| (store |v_#memory_int_846| v_my_callbackThread1of1ForFork1_~data~0.base_298 (store (select |v_#memory_int_846| v_my_callbackThread1of1ForFork1_~data~0.base_298) .cse0 (+ 1 |v_my_callbackThread1of1ForFork1_#t~mem32_167|)))) (= (store |v_#memory_$Pointer$.base_784| v_my_callbackThread1of1ForFork1_~data~0.base_298 (store (select |v_#memory_$Pointer$.base_784| v_my_callbackThread1of1ForFork1_~data~0.base_298) .cse0 (select (select |v_#memory_$Pointer$.base_783| v_my_callbackThread1of1ForFork1_~data~0.base_298) .cse0))) |v_#memory_$Pointer$.base_783|) (= (store |v_#pthreadsMutex_448| v_my_callbackThread1of1ForFork1_~data~0.base_298 (store (select |v_#pthreadsMutex_448| v_my_callbackThread1of1ForFork1_~data~0.base_298) v_my_callbackThread1of1ForFork1_~data~0.offset_298 0)) |v_#pthreadsMutex_447|) (= |v_my_callbackThread1of1ForFork1_#res.base_54| 0) (= |v_my_callbackThread1of1ForFork1_#res.offset_54| 0))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_167|, #pthreadsMutex=|v_#pthreadsMutex_448|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_298, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_298, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_784|, #memory_int=|v_#memory_int_846|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_784|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_447|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_298, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_54|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_298, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_783|, #memory_int=|v_#memory_int_845|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_54|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_783|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, my_callbackThread1of1ForFork1_#res.base, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] [2022-12-13 12:09:01,340 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L1711-1-->L1712: Formula: (= |v_my_callbackThread1of1ForFork1_#t~mem32_1| (select (select |v_#memory_int_31| v_my_callbackThread1of1ForFork1_~data~0.base_9) (+ v_my_callbackThread1of1ForFork1_~data~0.offset_9 28))) InVars {#memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_9, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_9} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_1|, #memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_9, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_9} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32] and [628] L1727-4-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_409 28))) (and (= |v_#valid_318| (store |v_#valid_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_239| 1)) (= |v_ULTIMATE.start_main_~probe_ret~0#1_156| 0) (= (store |v_#pthreadsMutex_718| v_my_callbackThread1of1ForFork1_~data~0.base_409 (store (select |v_#pthreadsMutex_718| v_my_callbackThread1of1ForFork1_~data~0.base_409) v_my_callbackThread1of1ForFork1_~data~0.offset_409 0)) |v_#pthreadsMutex_717|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_113| |v_ULTIMATE.start_main_~probe_ret~0#1_156|) (= (store |v_#memory_$Pointer$.offset_1166| v_my_callbackThread1of1ForFork1_~data~0.base_409 (store (select |v_#memory_$Pointer$.offset_1166| v_my_callbackThread1of1ForFork1_~data~0.base_409) .cse0 (select (select |v_#memory_$Pointer$.offset_1165| v_my_callbackThread1of1ForFork1_~data~0.base_409) .cse0))) |v_#memory_$Pointer$.offset_1165|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_41| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_43|) (= (select |v_#valid_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_239|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_128| (select (select |v_#memory_int_1204| |v_~#t1~0.base_69|) |v_~#t1~0.offset_69|)) (= |v_my_callbackThread1of1ForFork1_#res.base_143| 0) (= |v_my_callbackThread1of1ForFork1_#res.offset_143| 0) (= (store |v_#length_174| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_239| 4) |v_#length_173|) (< |v_#StackHeapBarrier_80| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_239|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_331| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_41|) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_239| 0)) (= (store |v_#memory_int_1204| v_my_callbackThread1of1ForFork1_~data~0.base_409 (store (select |v_#memory_int_1204| v_my_callbackThread1of1ForFork1_~data~0.base_409) .cse0 (+ 1 |v_my_callbackThread1of1ForFork1_#t~mem32_328|))) |v_#memory_int_1203|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_187| 0) (= |v_ULTIMATE.start_main_~#data~1#1.base_331| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_41|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_41| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_43|) (= |v_#memory_$Pointer$.base_1165| (store |v_#memory_$Pointer$.base_1166| v_my_callbackThread1of1ForFork1_~data~0.base_409 (store (select |v_#memory_$Pointer$.base_1166| v_my_callbackThread1of1ForFork1_~data~0.base_409) .cse0 (select (select |v_#memory_$Pointer$.base_1165| v_my_callbackThread1of1ForFork1_~data~0.base_409) .cse0)))))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_328|, #pthreadsMutex=|v_#pthreadsMutex_718|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1166|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_331|, ~#t1~0.offset=|v_~#t1~0.offset_69|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_409, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_409, #StackHeapBarrier=|v_#StackHeapBarrier_80|, ~#t1~0.base=|v_~#t1~0.base_69|, #valid=|v_#valid_319|, #memory_int=|v_#memory_int_1204|, #length=|v_#length_174|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1166|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_331|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_128|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1165|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_239|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_98|, ~#t1~0.offset=|v_~#t1~0.offset_69|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_43|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_135|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_409, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_143|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_113|, ~#t1~0.base=|v_~#t1~0.base_69|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_142|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_195|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_156|, #length=|v_#length_173|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_103|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_143|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_41|, #pthreadsMutex=|v_#pthreadsMutex_717|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_43|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_195|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_331|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_141|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_409, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_187|, #StackHeapBarrier=|v_#StackHeapBarrier_80|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_41|, #valid=|v_#valid_318|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_98|, #memory_int=|v_#memory_int_1203|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1165|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_331|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, my_callbackThread1of1ForFork1_#res.base, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_main_~probe_ret~0#1, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1, my_callbackThread1of1ForFork1_#res.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:09:01,640 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:09:01,641 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 569 [2022-12-13 12:09:01,641 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 281 flow [2022-12-13 12:09:01,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:01,641 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:09:01,641 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:09:01,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 12:09:01,642 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:09:01,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:09:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash 533554368, now seen corresponding path program 1 times [2022-12-13 12:09:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:09:01,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054755402] [2022-12-13 12:09:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:09:01,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:09:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:09:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:09:02,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:09:02,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054755402] [2022-12-13 12:09:02,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054755402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:09:02,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:09:02,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:09:02,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878735457] [2022-12-13 12:09:02,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:09:02,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:09:02,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:09:02,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:09:02,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:09:02,413 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 12:09:02,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 281 flow. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:02,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:09:02,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 12:09:02,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:09:02,791 INFO L130 PetriNetUnfolder]: 7/60 cut-off events. [2022-12-13 12:09:02,791 INFO L131 PetriNetUnfolder]: For 331/331 co-relation queries the response was YES. [2022-12-13 12:09:02,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 60 events. 7/60 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 206 event pairs, 2 based on Foata normal form. 1/60 useless extension candidates. Maximal degree in co-relation 287. Up to 32 conditions per place. [2022-12-13 12:09:02,792 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 25 selfloop transitions, 8 changer transitions 7/40 dead transitions. [2022-12-13 12:09:02,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 40 transitions, 407 flow [2022-12-13 12:09:02,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:09:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:09:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-12-13 12:09:02,793 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2236024844720497 [2022-12-13 12:09:02,793 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 281 flow. Second operand 7 states and 36 transitions. [2022-12-13 12:09:02,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 40 transitions, 407 flow [2022-12-13 12:09:02,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 40 transitions, 392 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 12:09:02,795 INFO L231 Difference]: Finished difference. Result has 54 places, 31 transitions, 278 flow [2022-12-13 12:09:02,795 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=54, PETRI_TRANSITIONS=31} [2022-12-13 12:09:02,796 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2022-12-13 12:09:02,796 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:09:02,796 INFO L89 Accepts]: Start accepts. Operand has 54 places, 31 transitions, 278 flow [2022-12-13 12:09:02,796 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:09:02,796 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:09:02,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 31 transitions, 278 flow [2022-12-13 12:09:02,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 31 transitions, 278 flow [2022-12-13 12:09:02,804 INFO L130 PetriNetUnfolder]: 3/48 cut-off events. [2022-12-13 12:09:02,804 INFO L131 PetriNetUnfolder]: For 237/239 co-relation queries the response was YES. [2022-12-13 12:09:02,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 48 events. 3/48 cut-off events. For 237/239 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 144 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 190. Up to 10 conditions per place. [2022-12-13 12:09:02,805 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 31 transitions, 278 flow [2022-12-13 12:09:02,805 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 12:09:02,805 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:09:02,806 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 12:09:02,806 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 31 transitions, 278 flow [2022-12-13 12:09:02,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:02,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:09:02,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:09:02,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 12:09:02,807 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:09:02,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:09:02,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1851384906, now seen corresponding path program 1 times [2022-12-13 12:09:02,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:09:02,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320142100] [2022-12-13 12:09:02,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:09:02,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:09:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:09:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:09:03,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:09:03,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320142100] [2022-12-13 12:09:03,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320142100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:09:03,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:09:03,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:09:03,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477191336] [2022-12-13 12:09:03,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:09:03,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:09:03,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:09:03,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:09:03,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:09:03,536 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 12:09:03,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 31 transitions, 278 flow. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:03,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:09:03,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 12:09:03,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:09:03,907 INFO L130 PetriNetUnfolder]: 5/55 cut-off events. [2022-12-13 12:09:03,907 INFO L131 PetriNetUnfolder]: For 306/306 co-relation queries the response was YES. [2022-12-13 12:09:03,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 55 events. 5/55 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 170 event pairs, 3 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 271. Up to 39 conditions per place. [2022-12-13 12:09:03,908 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 24 selfloop transitions, 3 changer transitions 11/38 dead transitions. [2022-12-13 12:09:03,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 38 transitions, 392 flow [2022-12-13 12:09:03,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:09:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:09:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-12-13 12:09:03,909 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23129251700680273 [2022-12-13 12:09:03,909 INFO L175 Difference]: Start difference. First operand has 52 places, 31 transitions, 278 flow. Second operand 7 states and 34 transitions. [2022-12-13 12:09:03,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 38 transitions, 392 flow [2022-12-13 12:09:03,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 38 transitions, 376 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-13 12:09:03,911 INFO L231 Difference]: Finished difference. Result has 55 places, 26 transitions, 214 flow [2022-12-13 12:09:03,911 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=55, PETRI_TRANSITIONS=26} [2022-12-13 12:09:03,912 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2022-12-13 12:09:03,912 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:09:03,912 INFO L89 Accepts]: Start accepts. Operand has 55 places, 26 transitions, 214 flow [2022-12-13 12:09:03,912 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:09:03,912 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:09:03,913 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 26 transitions, 214 flow [2022-12-13 12:09:03,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 26 transitions, 214 flow [2022-12-13 12:09:03,918 INFO L130 PetriNetUnfolder]: 2/35 cut-off events. [2022-12-13 12:09:03,918 INFO L131 PetriNetUnfolder]: For 125/127 co-relation queries the response was YES. [2022-12-13 12:09:03,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 35 events. 2/35 cut-off events. For 125/127 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2022-12-13 12:09:03,919 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 26 transitions, 214 flow [2022-12-13 12:09:03,919 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 12:09:03,919 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.base_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40| (select (select |v_#memory_int_595| |v_~#t1~0.base_41|) |v_~#t1~0.offset_41|)) (= (store |v_#length_118| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_117|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87| 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|) (= (store |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1) |v_#valid_176|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|) (= 0 (select |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, ~#t1~0.base=|v_~#t1~0.base_41|, #valid=|v_#valid_177|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, #memory_int=|v_#memory_int_595|, ~#t1~0.offset=|v_~#t1~0.offset_41|, #length=|v_#length_118|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_58|, ~#t1~0.offset=|v_~#t1~0.offset_41|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_57|, ~#t1~0.base=|v_~#t1~0.base_41|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_44|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_100|, #length=|v_#length_117|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_47|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|, #valid=|v_#valid_176|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_58|, #memory_int=|v_#memory_int_595|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [603] L1712-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_300 28))) (and (= (store |v_#pthreadsMutex_452| v_my_callbackThread1of1ForFork1_~data~0.base_300 (store (select |v_#pthreadsMutex_452| v_my_callbackThread1of1ForFork1_~data~0.base_300) v_my_callbackThread1of1ForFork1_~data~0.offset_300 0)) |v_#pthreadsMutex_451|) (= |v_my_callbackThread1of1ForFork1_#res.base_56| 0) (= (store |v_#memory_$Pointer$.offset_788| v_my_callbackThread1of1ForFork1_~data~0.base_300 (store (select |v_#memory_$Pointer$.offset_788| v_my_callbackThread1of1ForFork1_~data~0.base_300) .cse0 (select (select |v_#memory_$Pointer$.offset_787| v_my_callbackThread1of1ForFork1_~data~0.base_300) .cse0))) |v_#memory_$Pointer$.offset_787|) (= |v_my_callbackThread1of1ForFork1_#res.offset_56| 0) (= (store |v_#memory_int_850| v_my_callbackThread1of1ForFork1_~data~0.base_300 (store (select |v_#memory_int_850| v_my_callbackThread1of1ForFork1_~data~0.base_300) .cse0 (+ 1 |v_my_callbackThread1of1ForFork1_#t~mem32_171|))) |v_#memory_int_849|) (= (store |v_#memory_$Pointer$.base_788| v_my_callbackThread1of1ForFork1_~data~0.base_300 (store (select |v_#memory_$Pointer$.base_788| v_my_callbackThread1of1ForFork1_~data~0.base_300) .cse0 (select (select |v_#memory_$Pointer$.base_787| v_my_callbackThread1of1ForFork1_~data~0.base_300) .cse0))) |v_#memory_$Pointer$.base_787|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_171|, #pthreadsMutex=|v_#pthreadsMutex_452|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_300, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_300, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_788|, #memory_int=|v_#memory_int_850|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_788|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_451|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_300, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_56|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_300, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_787|, #memory_int=|v_#memory_int_849|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_56|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_787|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, my_callbackThread1of1ForFork1_#res.base, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] [2022-12-13 12:09:04,209 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L1711-1-->L1712: Formula: (= |v_my_callbackThread1of1ForFork1_#t~mem32_1| (select (select |v_#memory_int_31| v_my_callbackThread1of1ForFork1_~data~0.base_9) (+ v_my_callbackThread1of1ForFork1_~data~0.offset_9 28))) InVars {#memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_9, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_9} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_1|, #memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_9, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_9} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32] and [630] L1727-4-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_413 28))) (and (= (store |v_#memory_$Pointer$.offset_1181| v_my_callbackThread1of1ForFork1_~data~0.base_413 (store (select |v_#memory_$Pointer$.offset_1181| v_my_callbackThread1of1ForFork1_~data~0.base_413) .cse0 (select (select |v_#memory_$Pointer$.offset_1180| v_my_callbackThread1of1ForFork1_~data~0.base_413) .cse0))) |v_#memory_$Pointer$.offset_1180|) (= (store |v_#memory_$Pointer$.base_1181| v_my_callbackThread1of1ForFork1_~data~0.base_413 (store (select |v_#memory_$Pointer$.base_1181| v_my_callbackThread1of1ForFork1_~data~0.base_413) .cse0 (select (select |v_#memory_$Pointer$.base_1180| v_my_callbackThread1of1ForFork1_~data~0.base_413) .cse0))) |v_#memory_$Pointer$.base_1180|) (= |v_my_callbackThread1of1ForFork1_#res.base_147| 0) (< |v_#StackHeapBarrier_84| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_243|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_45| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_47|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_45| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_47|) (= (store |v_#length_182| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_243| 4) |v_#length_181|) (= (select |v_#valid_327| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_243|) 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_335| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_45|) (= |v_my_callbackThread1of1ForFork1_#res.offset_147| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_243| 0)) (= |v_ULTIMATE.start_main_~#data~1#1.base_335| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_45|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_191| 0) (= |v_#memory_int_1211| (store |v_#memory_int_1212| v_my_callbackThread1of1ForFork1_~data~0.base_413 (store (select |v_#memory_int_1212| v_my_callbackThread1of1ForFork1_~data~0.base_413) .cse0 (+ 1 |v_my_callbackThread1of1ForFork1_#t~mem32_336|)))) (= |v_#pthreadsMutex_725| (store |v_#pthreadsMutex_726| v_my_callbackThread1of1ForFork1_~data~0.base_413 (store (select |v_#pthreadsMutex_726| v_my_callbackThread1of1ForFork1_~data~0.base_413) v_my_callbackThread1of1ForFork1_~data~0.offset_413 0))) (= |v_ULTIMATE.start_my_drv_probe_#res#1_117| |v_ULTIMATE.start_main_~probe_ret~0#1_160|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_160| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_132| (select (select |v_#memory_int_1212| |v_~#t1~0.base_73|) |v_~#t1~0.offset_73|)) (= (store |v_#valid_327| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_243| 1) |v_#valid_326|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_336|, #pthreadsMutex=|v_#pthreadsMutex_726|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1181|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_335|, ~#t1~0.offset=|v_~#t1~0.offset_73|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_413, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_413, #StackHeapBarrier=|v_#StackHeapBarrier_84|, ~#t1~0.base=|v_~#t1~0.base_73|, #valid=|v_#valid_327|, #memory_int=|v_#memory_int_1212|, #length=|v_#length_182|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1181|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_335|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_132|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1180|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_243|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_102|, ~#t1~0.offset=|v_~#t1~0.offset_73|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_47|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_139|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_413, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_147|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_117|, ~#t1~0.base=|v_~#t1~0.base_73|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_146|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_199|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_160|, #length=|v_#length_181|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_107|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_147|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_45|, #pthreadsMutex=|v_#pthreadsMutex_725|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_47|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_199|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_335|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_145|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_413, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_191|, #StackHeapBarrier=|v_#StackHeapBarrier_84|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_45|, #valid=|v_#valid_326|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_102|, #memory_int=|v_#memory_int_1211|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1180|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_335|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, my_callbackThread1of1ForFork1_#res.base, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_main_~probe_ret~0#1, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1, my_callbackThread1of1ForFork1_#res.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:09:04,490 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:09:04,491 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 579 [2022-12-13 12:09:04,491 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 26 transitions, 228 flow [2022-12-13 12:09:04,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:04,491 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:09:04,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:09:04,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 12:09:04,492 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:09:04,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:09:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash 347409321, now seen corresponding path program 1 times [2022-12-13 12:09:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:09:04,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226904616] [2022-12-13 12:09:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:09:04,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:09:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:09:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:09:05,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:09:05,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226904616] [2022-12-13 12:09:05,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226904616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:09:05,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:09:05,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:09:05,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647667257] [2022-12-13 12:09:05,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:09:05,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:09:05,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:09:05,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:09:05,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:09:05,225 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 12:09:05,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 26 transitions, 228 flow. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:05,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:09:05,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 12:09:05,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:09:05,593 INFO L130 PetriNetUnfolder]: 3/44 cut-off events. [2022-12-13 12:09:05,593 INFO L131 PetriNetUnfolder]: For 206/206 co-relation queries the response was YES. [2022-12-13 12:09:05,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 44 events. 3/44 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 105 event pairs, 1 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 206. Up to 15 conditions per place. [2022-12-13 12:09:05,594 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 22 selfloop transitions, 10 changer transitions 2/34 dead transitions. [2022-12-13 12:09:05,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 34 transitions, 339 flow [2022-12-13 12:09:05,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:09:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:09:05,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-12-13 12:09:05,595 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2357142857142857 [2022-12-13 12:09:05,595 INFO L175 Difference]: Start difference. First operand has 48 places, 26 transitions, 228 flow. Second operand 7 states and 33 transitions. [2022-12-13 12:09:05,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 34 transitions, 339 flow [2022-12-13 12:09:05,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 34 transitions, 297 flow, removed 12 selfloop flow, removed 8 redundant places. [2022-12-13 12:09:05,597 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 223 flow [2022-12-13 12:09:05,597 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2022-12-13 12:09:05,598 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2022-12-13 12:09:05,598 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:09:05,598 INFO L89 Accepts]: Start accepts. Operand has 47 places, 27 transitions, 223 flow [2022-12-13 12:09:05,598 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:09:05,598 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:09:05,598 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 27 transitions, 223 flow [2022-12-13 12:09:05,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 27 transitions, 223 flow [2022-12-13 12:09:05,604 INFO L130 PetriNetUnfolder]: 1/40 cut-off events. [2022-12-13 12:09:05,604 INFO L131 PetriNetUnfolder]: For 132/134 co-relation queries the response was YES. [2022-12-13 12:09:05,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 40 events. 1/40 cut-off events. For 132/134 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 116. Up to 8 conditions per place. [2022-12-13 12:09:05,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 27 transitions, 223 flow [2022-12-13 12:09:05,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-13 12:09:05,620 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] L1736-2-->ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_#memory_$Pointer$.offset_259| (store |v_#memory_$Pointer$.offset_260| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66| (store (select |v_#memory_$Pointer$.offset_260| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_58| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_35|))) (= (select (select |v_#memory_int_318| |v_ULTIMATE.start_main_~#data~1#1.base_119|) (+ |v_ULTIMATE.start_main_~#data~1#1.offset_119| 24)) |v_ULTIMATE.start_main_#t~mem46#1_43|) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_123| |v_ULTIMATE.start_ldv_assert_~expression#1_149|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_149| 0) (= (store |v_#memory_int_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66| (store (select |v_#memory_int_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_58| (select (select |v_#memory_int_318| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_58|))) |v_#memory_int_318|) (= (store |v_#memory_$Pointer$.base_260| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66| (store (select |v_#memory_$Pointer$.base_260| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_58| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_35|)) |v_#memory_$Pointer$.base_259|) (= (store |v_#valid_125| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66| 0) |v_#valid_124|) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_123| (ite (= |v_ULTIMATE.start_main_#t~mem46#1_43| 1) 1 0))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_58|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_260|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_66|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_35|, #valid=|v_#valid_125|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_35|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_119|, #memory_int=|v_#memory_int_319|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_260|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_119|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_149|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_259|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_119|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_30|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_123|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_43|, #valid=|v_#valid_124|, #memory_int=|v_#memory_int_318|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_259|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_119|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_main_#t~mem46#1, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, #memory_$Pointer$.offset] and [578] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.base_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40| (select (select |v_#memory_int_595| |v_~#t1~0.base_41|) |v_~#t1~0.offset_41|)) (= (store |v_#length_118| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_117|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87| 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|) (= (store |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1) |v_#valid_176|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|) (= 0 (select |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, ~#t1~0.base=|v_~#t1~0.base_41|, #valid=|v_#valid_177|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, #memory_int=|v_#memory_int_595|, ~#t1~0.offset=|v_~#t1~0.offset_41|, #length=|v_#length_118|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_58|, ~#t1~0.offset=|v_~#t1~0.offset_41|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_57|, ~#t1~0.base=|v_~#t1~0.base_41|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_44|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_100|, #length=|v_#length_117|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_47|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|, #valid=|v_#valid_176|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_58|, #memory_int=|v_#memory_int_595|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] [2022-12-13 12:09:05,855 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [627] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse3 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_368 28)) (.cse5 (select |v_#memory_$Pointer$.offset_1157| v_my_callbackThread1of1ForFork0_~data~0.base_368)) (.cse4 (select |v_#memory_$Pointer$.base_1157| v_my_callbackThread1of1ForFork0_~data~0.base_368)) (.cse2 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_368 24)) (.cse0 (select |v_#pthreadsMutex_713| v_my_callbackThread1of1ForFork0_~data~0.base_368))) (and (= v_my_callbackThread1of1ForFork0_~arg.offset_64 |v_my_callbackThread1of1ForFork0_#in~arg.offset_64|) (= |v_my_callbackThread1of1ForFork0_#res.base_85| 0) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_368) 0) (= (store |v_#memory_int_1199| v_my_callbackThread1of1ForFork0_~data~0.base_368 (let ((.cse1 (select |v_#memory_int_1199| v_my_callbackThread1of1ForFork0_~data~0.base_368))) (store (store .cse1 .cse2 1) .cse3 (+ (select .cse1 .cse3) 1)))) |v_#memory_int_1197|) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_64| v_my_callbackThread1of1ForFork0_~arg.base_64) (= |v_my_callbackThread1of1ForFork0_#res.offset_85| 0) (= (store |v_#memory_$Pointer$.base_1157| v_my_callbackThread1of1ForFork0_~data~0.base_368 (store .cse4 .cse3 (select (select |v_#memory_$Pointer$.base_1156| v_my_callbackThread1of1ForFork0_~data~0.base_368) .cse3))) |v_#memory_$Pointer$.base_1156|) (= (store |v_#memory_$Pointer$.offset_1157| v_my_callbackThread1of1ForFork0_~data~0.base_368 (store .cse5 .cse3 (select (select |v_#memory_$Pointer$.offset_1156| v_my_callbackThread1of1ForFork0_~data~0.base_368) .cse3))) |v_#memory_$Pointer$.offset_1156|) (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_84 v_~my_dev~0.base_218) (= (store |v_#memory_$Pointer$.offset_1158| v_my_callbackThread1of1ForFork0_~data~0.base_368 (store (select |v_#memory_$Pointer$.offset_1158| v_my_callbackThread1of1ForFork0_~data~0.base_368) .cse2 (select .cse5 .cse2))) |v_#memory_$Pointer$.offset_1157|) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_84 v_~my_dev~0.offset_218) (= |v_#memory_$Pointer$.base_1157| (store |v_#memory_$Pointer$.base_1158| v_my_callbackThread1of1ForFork0_~data~0.base_368 (store (select |v_#memory_$Pointer$.base_1158| v_my_callbackThread1of1ForFork0_~data~0.base_368) .cse2 (select .cse4 .cse2)))) (= .cse2 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_84) (= (store |v_#pthreadsMutex_713| v_my_callbackThread1of1ForFork0_~data~0.base_368 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_368 0)) |v_#pthreadsMutex_711|) (= v_my_callbackThread1of1ForFork0_~data~0.base_368 v_my_callbackThread1of1ForFork0_~__mptr~0.base_84))) InVars {#pthreadsMutex=|v_#pthreadsMutex_713|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_64|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1158|, ~my_dev~0.base=v_~my_dev~0.base_218, #memory_int=|v_#memory_int_1199|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_64|, ~my_dev~0.offset=v_~my_dev~0.offset_218, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1158|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_711|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_224|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1156|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_64, ~my_dev~0.base=v_~my_dev~0.base_218, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_64|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_146|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_84, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_368, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_368, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_85|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_64|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_64, #memory_int=|v_#memory_int_1197|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_84, ~my_dev~0.offset=v_~my_dev~0.offset_218, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_85|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1156|} AuxVars[|v_#memory_$Pointer$.base_1157|, |v_#memory_$Pointer$.offset_1157|] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [578] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.base_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40| (select (select |v_#memory_int_595| |v_~#t1~0.base_41|) |v_~#t1~0.offset_41|)) (= (store |v_#length_118| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_117|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87| 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|) (= (store |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1) |v_#valid_176|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|) (= 0 (select |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, ~#t1~0.base=|v_~#t1~0.base_41|, #valid=|v_#valid_177|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, #memory_int=|v_#memory_int_595|, ~#t1~0.offset=|v_~#t1~0.offset_41|, #length=|v_#length_118|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_58|, ~#t1~0.offset=|v_~#t1~0.offset_41|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_57|, ~#t1~0.base=|v_~#t1~0.base_41|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_44|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_100|, #length=|v_#length_117|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_47|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|, #valid=|v_#valid_176|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_58|, #memory_int=|v_#memory_int_595|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] [2022-12-13 12:09:06,799 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:09:06,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1202 [2022-12-13 12:09:06,800 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 228 flow [2022-12-13 12:09:06,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:06,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:09:06,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:09:06,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 12:09:06,800 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:09:06,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:09:06,801 INFO L85 PathProgramCache]: Analyzing trace with hash -813626660, now seen corresponding path program 1 times [2022-12-13 12:09:06,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:09:06,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998818771] [2022-12-13 12:09:06,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:09:06,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:09:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:09:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:09:07,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:09:07,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998818771] [2022-12-13 12:09:07,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998818771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:09:07,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:09:07,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:09:07,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836530080] [2022-12-13 12:09:07,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:09:07,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:09:07,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:09:07,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:09:07,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:09:07,511 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 12:09:07,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 228 flow. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:07,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:09:07,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 12:09:07,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:09:07,829 INFO L130 PetriNetUnfolder]: 2/44 cut-off events. [2022-12-13 12:09:07,830 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2022-12-13 12:09:07,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 44 events. 2/44 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 111 event pairs, 2 based on Foata normal form. 1/44 useless extension candidates. Maximal degree in co-relation 163. Up to 27 conditions per place. [2022-12-13 12:09:07,830 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 22 selfloop transitions, 5 changer transitions 5/32 dead transitions. [2022-12-13 12:09:07,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 32 transitions, 299 flow [2022-12-13 12:09:07,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:09:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:09:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-12-13 12:09:07,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24603174603174602 [2022-12-13 12:09:07,831 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 228 flow. Second operand 6 states and 31 transitions. [2022-12-13 12:09:07,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 32 transitions, 299 flow [2022-12-13 12:09:07,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 32 transitions, 265 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 12:09:07,833 INFO L231 Difference]: Finished difference. Result has 47 places, 25 transitions, 177 flow [2022-12-13 12:09:07,833 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=47, PETRI_TRANSITIONS=25} [2022-12-13 12:09:07,833 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2022-12-13 12:09:07,833 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:09:07,833 INFO L89 Accepts]: Start accepts. Operand has 47 places, 25 transitions, 177 flow [2022-12-13 12:09:07,834 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:09:07,834 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:09:07,834 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 25 transitions, 177 flow [2022-12-13 12:09:07,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 25 transitions, 177 flow [2022-12-13 12:09:07,840 INFO L130 PetriNetUnfolder]: 0/36 cut-off events. [2022-12-13 12:09:07,840 INFO L131 PetriNetUnfolder]: For 91/95 co-relation queries the response was YES. [2022-12-13 12:09:07,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 36 events. 0/36 cut-off events. For 91/95 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2022-12-13 12:09:07,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 25 transitions, 177 flow [2022-12-13 12:09:07,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-13 12:09:07,841 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:09:07,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 12:09:07,842 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 25 transitions, 177 flow [2022-12-13 12:09:07,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:07,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:09:07,842 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:09:07,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 12:09:07,843 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:09:07,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:09:07,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1258578629, now seen corresponding path program 1 times [2022-12-13 12:09:07,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:09:07,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683744813] [2022-12-13 12:09:07,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:09:07,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:09:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:09:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:09:08,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:09:08,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683744813] [2022-12-13 12:09:08,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683744813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:09:08,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:09:08,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:09:08,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455451085] [2022-12-13 12:09:08,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:09:08,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:09:08,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:09:08,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:09:08,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:09:08,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 12:09:08,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 25 transitions, 177 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:08,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:09:08,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 12:09:08,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:09:08,242 INFO L130 PetriNetUnfolder]: 2/39 cut-off events. [2022-12-13 12:09:08,242 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-13 12:09:08,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 39 events. 2/39 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 83 event pairs, 2 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 156. Up to 32 conditions per place. [2022-12-13 12:09:08,243 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 19 selfloop transitions, 4 changer transitions 4/27 dead transitions. [2022-12-13 12:09:08,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 27 transitions, 234 flow [2022-12-13 12:09:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:09:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:09:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-12-13 12:09:08,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3026315789473684 [2022-12-13 12:09:08,243 INFO L175 Difference]: Start difference. First operand has 46 places, 25 transitions, 177 flow. Second operand 4 states and 23 transitions. [2022-12-13 12:09:08,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 27 transitions, 234 flow [2022-12-13 12:09:08,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 27 transitions, 222 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-13 12:09:08,245 INFO L231 Difference]: Finished difference. Result has 43 places, 23 transitions, 148 flow [2022-12-13 12:09:08,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=23} [2022-12-13 12:09:08,245 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-12-13 12:09:08,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:09:08,245 INFO L89 Accepts]: Start accepts. Operand has 43 places, 23 transitions, 148 flow [2022-12-13 12:09:08,245 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:09:08,246 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:09:08,246 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 23 transitions, 148 flow [2022-12-13 12:09:08,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 23 transitions, 148 flow [2022-12-13 12:09:08,251 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-13 12:09:08,251 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-13 12:09:08,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 31 events. 0/31 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-12-13 12:09:08,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 23 transitions, 148 flow [2022-12-13 12:09:08,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-13 12:09:08,252 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:09:08,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 12:09:08,253 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 23 transitions, 148 flow [2022-12-13 12:09:08,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:08,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:09:08,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:09:08,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 12:09:08,253 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:09:08,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:09:08,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1250538086, now seen corresponding path program 1 times [2022-12-13 12:09:08,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:09:08,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311649043] [2022-12-13 12:09:08,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:09:08,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:09:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:09:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:09:08,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:09:08,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311649043] [2022-12-13 12:09:08,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311649043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:09:08,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:09:08,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:09:08,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473916395] [2022-12-13 12:09:08,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:09:08,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:09:08,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:09:08,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:09:08,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:09:08,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 12:09:08,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 23 transitions, 148 flow. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:08,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:09:08,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 12:09:08,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:09:09,348 INFO L130 PetriNetUnfolder]: 2/34 cut-off events. [2022-12-13 12:09:09,348 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-13 12:09:09,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 34 events. 2/34 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 2 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 127. Up to 18 conditions per place. [2022-12-13 12:09:09,348 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 13 selfloop transitions, 2 changer transitions 14/29 dead transitions. [2022-12-13 12:09:09,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 29 transitions, 229 flow [2022-12-13 12:09:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:09:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:09:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-12-13 12:09:09,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20833333333333334 [2022-12-13 12:09:09,349 INFO L175 Difference]: Start difference. First operand has 41 places, 23 transitions, 148 flow. Second operand 8 states and 30 transitions. [2022-12-13 12:09:09,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 29 transitions, 229 flow [2022-12-13 12:09:09,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 29 transitions, 209 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-13 12:09:09,350 INFO L231 Difference]: Finished difference. Result has 43 places, 15 transitions, 80 flow [2022-12-13 12:09:09,350 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=15} [2022-12-13 12:09:09,351 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-12-13 12:09:09,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:09:09,351 INFO L89 Accepts]: Start accepts. Operand has 43 places, 15 transitions, 80 flow [2022-12-13 12:09:09,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:09:09,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:09:09,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 15 transitions, 80 flow [2022-12-13 12:09:09,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 15 transitions, 80 flow [2022-12-13 12:09:09,355 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-13 12:09:09,355 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 12:09:09,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 16 events. 0/16 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-13 12:09:09,356 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 15 transitions, 80 flow [2022-12-13 12:09:09,356 INFO L226 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-13 12:09:09,360 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:09:09,361 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:09:09,363 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:09:09,363 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:09:09,505 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:09:09,506 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-13 12:09:09,506 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 14 transitions, 76 flow [2022-12-13 12:09:09,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:09,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:09:09,507 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:09:09,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 12:09:09,507 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:09:09,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:09:09,507 INFO L85 PathProgramCache]: Analyzing trace with hash 382362603, now seen corresponding path program 1 times [2022-12-13 12:09:09,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:09:09,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116750243] [2022-12-13 12:09:09,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:09:09,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:09:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:09:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:09:09,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:09:09,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116750243] [2022-12-13 12:09:09,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116750243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:09:09,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:09:09,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:09:09,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240647573] [2022-12-13 12:09:09,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:09:09,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:09:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:09:09,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:09:09,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:09:09,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-13 12:09:09,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 14 transitions, 76 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:09,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:09:09,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-13 12:09:09,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:09:09,975 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2022-12-13 12:09:09,975 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 12:09:09,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 16 events. 1/16 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 5 event pairs, 1 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 56. Up to 9 conditions per place. [2022-12-13 12:09:09,975 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 9 selfloop transitions, 4 changer transitions 1/14 dead transitions. [2022-12-13 12:09:09,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 14 transitions, 108 flow [2022-12-13 12:09:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:09:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:09:09,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-12-13 12:09:09,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21428571428571427 [2022-12-13 12:09:09,976 INFO L175 Difference]: Start difference. First operand has 32 places, 14 transitions, 76 flow. Second operand 5 states and 15 transitions. [2022-12-13 12:09:09,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 14 transitions, 108 flow [2022-12-13 12:09:09,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 14 transitions, 75 flow, removed 6 selfloop flow, removed 13 redundant places. [2022-12-13 12:09:09,977 INFO L231 Difference]: Finished difference. Result has 22 places, 13 transitions, 50 flow [2022-12-13 12:09:09,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=50, PETRI_PLACES=22, PETRI_TRANSITIONS=13} [2022-12-13 12:09:09,977 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -31 predicate places. [2022-12-13 12:09:09,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:09:09,982 INFO L89 Accepts]: Start accepts. Operand has 22 places, 13 transitions, 50 flow [2022-12-13 12:09:09,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:09:09,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:09:09,983 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 13 transitions, 50 flow [2022-12-13 12:09:09,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 13 transitions, 50 flow [2022-12-13 12:09:09,986 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-13 12:09:09,986 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 12:09:09,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 13 events. 0/13 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-13 12:09:09,986 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 13 transitions, 50 flow [2022-12-13 12:09:09,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 12:09:09,998 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [608] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_478| v_my_callbackThread1of1ForFork0_~data~0.base_326)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_326 24))) (and (= (store |v_#memory_$Pointer$.base_821| v_my_callbackThread1of1ForFork0_~data~0.base_326 (store (select |v_#memory_$Pointer$.base_821| v_my_callbackThread1of1ForFork0_~data~0.base_326) .cse0 (select (select |v_#memory_$Pointer$.base_820| v_my_callbackThread1of1ForFork0_~data~0.base_326) .cse0))) |v_#memory_$Pointer$.base_820|) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_37| v_my_callbackThread1of1ForFork0_~arg.base_37) (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_57 v_~my_dev~0.base_142) (= (select .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_326) 0) (= v_my_callbackThread1of1ForFork0_~arg.offset_37 |v_my_callbackThread1of1ForFork0_#in~arg.offset_37|) (= (store |v_#memory_$Pointer$.offset_821| v_my_callbackThread1of1ForFork0_~data~0.base_326 (store (select |v_#memory_$Pointer$.offset_821| v_my_callbackThread1of1ForFork0_~data~0.base_326) .cse0 (select (select |v_#memory_$Pointer$.offset_820| v_my_callbackThread1of1ForFork0_~data~0.base_326) .cse0))) |v_#memory_$Pointer$.offset_820|) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_57 .cse0) (= v_my_callbackThread1of1ForFork0_~data~0.base_326 v_my_callbackThread1of1ForFork0_~__mptr~0.base_57) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_57 v_~my_dev~0.offset_142) (= (store |v_#pthreadsMutex_478| v_my_callbackThread1of1ForFork0_~data~0.base_326 (store .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_326 1)) |v_#pthreadsMutex_477|) (= (store |v_#memory_int_881| v_my_callbackThread1of1ForFork0_~data~0.base_326 (store (select |v_#memory_int_881| v_my_callbackThread1of1ForFork0_~data~0.base_326) .cse0 1)) |v_#memory_int_880|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_37|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_821|, ~my_dev~0.base=v_~my_dev~0.base_142, #memory_int=|v_#memory_int_881|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_37|, ~my_dev~0.offset=v_~my_dev~0.offset_142, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_821|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_820|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_37, ~my_dev~0.base=v_~my_dev~0.base_142, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_37|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_117|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_57, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_326, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_326, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_37|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_37, #memory_int=|v_#memory_int_880|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_57, ~my_dev~0.offset=v_~my_dev~0.offset_142, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_820|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_~data~0.offset, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~data~0.base, #memory_$Pointer$.offset] and [578] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.base_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40| (select (select |v_#memory_int_595| |v_~#t1~0.base_41|) |v_~#t1~0.offset_41|)) (= (store |v_#length_118| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_117|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87| 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|) (= (store |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1) |v_#valid_176|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|) (= 0 (select |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, ~#t1~0.base=|v_~#t1~0.base_41|, #valid=|v_#valid_177|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, #memory_int=|v_#memory_int_595|, ~#t1~0.offset=|v_~#t1~0.offset_41|, #length=|v_#length_118|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_58|, ~#t1~0.offset=|v_~#t1~0.offset_41|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_57|, ~#t1~0.base=|v_~#t1~0.base_41|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_44|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_100|, #length=|v_#length_117|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_47|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|, #valid=|v_#valid_176|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_58|, #memory_int=|v_#memory_int_595|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] [2022-12-13 12:09:10,325 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [572] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_364| |v_ULTIMATE.start_main_~#data~1#1.base_139|))) (and (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_147| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_57|) 1 0)) (= (store |v_#memory_$Pointer$.base_310| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78| (store (select |v_#memory_$Pointer$.base_310| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_70| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_47|)) |v_#memory_$Pointer$.base_309|) (= (store |v_#memory_int_365| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78| (store (select |v_#memory_int_365| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_70| (select (select |v_#memory_int_364| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_70|))) |v_#memory_int_364|) (= |v_ULTIMATE.start_main_#t~mem47#1_57| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_139| 28))) (= |v_ULTIMATE.start_ldv_assert_~expression#1_175| 0) (= |v_#valid_156| (store |v_#valid_157| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78| 0)) (not (= (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_139| 24)) 1) 1 0) 0)) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_147| |v_ULTIMATE.start_ldv_assert_~expression#1_175|) (= (store |v_#memory_$Pointer$.offset_310| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78| (store (select |v_#memory_$Pointer$.offset_310| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_70| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_47|)) |v_#memory_$Pointer$.offset_309|))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_70|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_310|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_78|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_47|, #valid=|v_#valid_157|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_47|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_139|, #memory_int=|v_#memory_int_365|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_310|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_139|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_175|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_309|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_57|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_139|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_36|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_147|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_364|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_309|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_139|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_main_#t~mem47#1, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~mem46#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] and [578] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.base_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40| (select (select |v_#memory_int_595| |v_~#t1~0.base_41|) |v_~#t1~0.offset_41|)) (= (store |v_#length_118| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_117|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87| 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_215| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|) (= (store |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1) |v_#valid_176|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|) (= 0 (select |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, ~#t1~0.base=|v_~#t1~0.base_41|, #valid=|v_#valid_177|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, #memory_int=|v_#memory_int_595|, ~#t1~0.offset=|v_~#t1~0.offset_41|, #length=|v_#length_118|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_40|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_58|, ~#t1~0.offset=|v_~#t1~0.offset_41|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_15|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_57|, ~#t1~0.base=|v_~#t1~0.base_41|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_44|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_100|, #length=|v_#length_117|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_47|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_215|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_87|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_13|, #valid=|v_#valid_176|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_58|, #memory_int=|v_#memory_int_595|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_215|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] [2022-12-13 12:09:10,638 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:09:10,639 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:09:10,642 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:09:10,643 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:09:10,644 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [635] $Ultimate##0-->L1735: Formula: (let ((.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_372 24)) (.cse0 (select |v_#pthreadsMutex_754| v_my_callbackThread1of1ForFork0_~data~0.base_372))) (and (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_146| (select (select |v_#memory_int_1245| |v_~#t1~0.base_87|) |v_~#t1~0.offset_87|)) (= |v_#valid_358| (store |v_#valid_359| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_259| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_259| 0)) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_88 v_~my_dev~0.offset_228) (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_88 v_~my_dev~0.base_228) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_372) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_174| 0) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_68| v_my_callbackThread1of1ForFork0_~arg.base_68) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_207| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_59| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_61|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_351| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_59|) (= (store |v_#memory_int_1246| v_my_callbackThread1of1ForFork0_~data~0.base_372 (store (select |v_#memory_int_1246| v_my_callbackThread1of1ForFork0_~data~0.base_372) .cse1 1)) |v_#memory_int_1245|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_59| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_61|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_131| |v_ULTIMATE.start_main_~probe_ret~0#1_174|) (= (select |v_#valid_359| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_259|) 0) (< |v_#StackHeapBarrier_98| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_259|) (= |v_ULTIMATE.start_main_~#data~1#1.base_351| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_59|) (= |v_#memory_$Pointer$.base_1230| (store |v_#memory_$Pointer$.base_1231| v_my_callbackThread1of1ForFork0_~data~0.base_372 (store (select |v_#memory_$Pointer$.base_1231| v_my_callbackThread1of1ForFork0_~data~0.base_372) .cse1 (select (select |v_#memory_$Pointer$.base_1230| v_my_callbackThread1of1ForFork0_~data~0.base_372) .cse1)))) (= (store |v_#memory_$Pointer$.offset_1231| v_my_callbackThread1of1ForFork0_~data~0.base_372 (store (select |v_#memory_$Pointer$.offset_1231| v_my_callbackThread1of1ForFork0_~data~0.base_372) .cse1 (select (select |v_#memory_$Pointer$.offset_1230| v_my_callbackThread1of1ForFork0_~data~0.base_372) .cse1))) |v_#memory_$Pointer$.offset_1230|) (= v_my_callbackThread1of1ForFork0_~arg.offset_68 |v_my_callbackThread1of1ForFork0_#in~arg.offset_68|) (= v_my_callbackThread1of1ForFork0_~data~0.base_372 v_my_callbackThread1of1ForFork0_~__mptr~0.base_88) (= .cse1 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_88) (= (store |v_#length_210| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_259| 4) |v_#length_209|) (= (store |v_#pthreadsMutex_754| v_my_callbackThread1of1ForFork0_~data~0.base_372 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_372 1)) |v_#pthreadsMutex_753|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_754|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1231|, ~my_dev~0.base=v_~my_dev~0.base_228, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_351|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_68|, ~#t1~0.offset=|v_~#t1~0.offset_87|, #StackHeapBarrier=|v_#StackHeapBarrier_98|, ~#t1~0.base=|v_~#t1~0.base_87|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_68|, #valid=|v_#valid_359|, #memory_int=|v_#memory_int_1246|, #length=|v_#length_210|, ~my_dev~0.offset=v_~my_dev~0.offset_228, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1231|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_351|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_146|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_259|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1230|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_118|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_68|, ~#t1~0.offset=|v_~#t1~0.offset_87|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_150|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_88, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_372, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_61|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_153|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_131|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_372, ~#t1~0.base=|v_~#t1~0.base_87|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_160|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_213|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_174|, #length=|v_#length_209|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_121|, ~my_dev~0.offset=v_~my_dev~0.offset_228, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_59|, #pthreadsMutex=|v_#pthreadsMutex_753|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_61|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_213|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_68, ~my_dev~0.base=v_~my_dev~0.base_228, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_351|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_161|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_207|, #StackHeapBarrier=|v_#StackHeapBarrier_98|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_68|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_59|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_68, #valid=|v_#valid_358|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_118|, #memory_int=|v_#memory_int_1245|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_88, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1230|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_351|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, my_callbackThread1of1ForFork0_~data~0.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_main_~probe_ret~0#1, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, #pthreadsMutex, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, my_callbackThread1of1ForFork0_~arg.base, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, my_callbackThread1of1ForFork0_~arg.offset, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, #memory_$Pointer$.offset] and [605] L1711-1-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_320 28))) (and (= (store |v_#memory_$Pointer$.offset_806| v_my_callbackThread1of1ForFork0_~data~0.base_320 (store (select |v_#memory_$Pointer$.offset_806| v_my_callbackThread1of1ForFork0_~data~0.base_320) .cse0 (select (select |v_#memory_$Pointer$.offset_805| v_my_callbackThread1of1ForFork0_~data~0.base_320) .cse0))) |v_#memory_$Pointer$.offset_805|) (= (store |v_#memory_$Pointer$.base_806| v_my_callbackThread1of1ForFork0_~data~0.base_320 (store (select |v_#memory_$Pointer$.base_806| v_my_callbackThread1of1ForFork0_~data~0.base_320) .cse0 (select (select |v_#memory_$Pointer$.base_805| v_my_callbackThread1of1ForFork0_~data~0.base_320) .cse0))) |v_#memory_$Pointer$.base_805|) (= (store |v_#memory_int_869| v_my_callbackThread1of1ForFork0_~data~0.base_320 (let ((.cse1 (select |v_#memory_int_869| v_my_callbackThread1of1ForFork0_~data~0.base_320))) (store .cse1 .cse0 (+ (select .cse1 .cse0) 1)))) |v_#memory_int_868|) (= |v_my_callbackThread1of1ForFork0_#res.offset_54| 0) (= |v_my_callbackThread1of1ForFork0_#res.base_54| 0) (= (store |v_#pthreadsMutex_466| v_my_callbackThread1of1ForFork0_~data~0.base_320 (store (select |v_#pthreadsMutex_466| v_my_callbackThread1of1ForFork0_~data~0.base_320) v_my_callbackThread1of1ForFork0_~data~0.offset_320 0)) |v_#pthreadsMutex_465|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_466|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_320, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_806|, #memory_int=|v_#memory_int_869|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_320, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_806|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_465|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_320, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_54|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_189|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_805|, #memory_int=|v_#memory_int_868|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_54|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_320, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_805|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] [2022-12-13 12:09:11,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [636] L1736-2-->L1735: Formula: (let ((.cse1 (store |v_#valid_364| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_262| 0)) (.cse0 (select |v_#memory_int_1249| |v_ULTIMATE.start_main_~#data~1#1.base_353|))) (and (= (store |v_#memory_$Pointer$.offset_1235| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_262| (store (select |v_#memory_$Pointer$.offset_1235| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_262|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_210| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_121|)) |v_#memory_$Pointer$.offset_1234|) (< |v_#StackHeapBarrier_100| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_261|) (= (store |v_#memory_$Pointer$.base_1235| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_262| (store (select |v_#memory_$Pointer$.base_1235| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_262|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_210| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_121|)) |v_#memory_$Pointer$.base_1234|) (= (store |v_#length_214| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_261| 4) |v_#length_213|) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_261| 0)) (= |v_#memory_int_1249| (store |v_#memory_int_1250| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_262| (store (select |v_#memory_int_1250| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_262|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_210| (select (select |v_#memory_int_1249| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_262|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_210|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_194| |v_ULTIMATE.start_ldv_assert_~expression#1_231|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_209| 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_353| 28)) |v_ULTIMATE.start_main_#t~mem47#1_71|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_353| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_61|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_61| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_63|) (= 0 (select .cse1 |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_261|)) (= |v_ULTIMATE.start_main_~probe_ret~0#1_176| 0) (= (store .cse1 |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_261| 1) |v_#valid_362|) (= |v_ULTIMATE.start_main_~#data~1#1.base_353| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_61|) (not (= (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_353| 24)) 1) 1 0) 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_148| (select (select |v_#memory_int_1249| |v_~#t1~0.base_89|) |v_~#t1~0.offset_89|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_61| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_63|) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_194| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_71|) 1 0)) (= |v_ULTIMATE.start_my_drv_probe_#res#1_133| |v_ULTIMATE.start_main_~probe_ret~0#1_176|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_231| 0))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1235|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_262|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_121|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_353|, ~#t1~0.offset=|v_~#t1~0.offset_89|, #StackHeapBarrier=|v_#StackHeapBarrier_100|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_210|, ~#t1~0.base=|v_~#t1~0.base_89|, #valid=|v_#valid_364|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_121|, #memory_int=|v_#memory_int_1250|, #length=|v_#length_214|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1235|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_353|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_148|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_231|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_261|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1234|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_71|, ~#t1~0.offset=|v_~#t1~0.offset_89|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_63|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_155|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_133|, ~#t1~0.base=|v_~#t1~0.base_89|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_162|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_215|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_176|, #length=|v_#length_213|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_123|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_63|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_215|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_353|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_163|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_194|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_209|, #StackHeapBarrier=|v_#StackHeapBarrier_100|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_61|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_81|, #valid=|v_#valid_362|, #memory_int=|v_#memory_int_1249|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1234|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_353|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_ldv_assert_~expression#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_main_#t~mem47#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_main_~probe_ret~0#1, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_#t~mem46#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] and [605] L1711-1-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_320 28))) (and (= (store |v_#memory_$Pointer$.offset_806| v_my_callbackThread1of1ForFork0_~data~0.base_320 (store (select |v_#memory_$Pointer$.offset_806| v_my_callbackThread1of1ForFork0_~data~0.base_320) .cse0 (select (select |v_#memory_$Pointer$.offset_805| v_my_callbackThread1of1ForFork0_~data~0.base_320) .cse0))) |v_#memory_$Pointer$.offset_805|) (= (store |v_#memory_$Pointer$.base_806| v_my_callbackThread1of1ForFork0_~data~0.base_320 (store (select |v_#memory_$Pointer$.base_806| v_my_callbackThread1of1ForFork0_~data~0.base_320) .cse0 (select (select |v_#memory_$Pointer$.base_805| v_my_callbackThread1of1ForFork0_~data~0.base_320) .cse0))) |v_#memory_$Pointer$.base_805|) (= (store |v_#memory_int_869| v_my_callbackThread1of1ForFork0_~data~0.base_320 (let ((.cse1 (select |v_#memory_int_869| v_my_callbackThread1of1ForFork0_~data~0.base_320))) (store .cse1 .cse0 (+ (select .cse1 .cse0) 1)))) |v_#memory_int_868|) (= |v_my_callbackThread1of1ForFork0_#res.offset_54| 0) (= |v_my_callbackThread1of1ForFork0_#res.base_54| 0) (= (store |v_#pthreadsMutex_466| v_my_callbackThread1of1ForFork0_~data~0.base_320 (store (select |v_#pthreadsMutex_466| v_my_callbackThread1of1ForFork0_~data~0.base_320) v_my_callbackThread1of1ForFork0_~data~0.offset_320 0)) |v_#pthreadsMutex_465|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_466|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_320, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_806|, #memory_int=|v_#memory_int_869|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_320, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_806|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_465|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_320, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_54|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_189|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_805|, #memory_int=|v_#memory_int_868|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_54|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_320, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_805|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] [2022-12-13 12:09:12,276 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:09:12,277 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:09:12,280 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:09:12,280 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:09:12,747 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [639] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse3 (select |v_#memory_$Pointer$.base_1251| v_my_callbackThread1of1ForFork1_~data~0.base_427)) (.cse1 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_427 24)) (.cse5 (select |v_#memory_$Pointer$.offset_1251| v_my_callbackThread1of1ForFork1_~data~0.base_427)) (.cse2 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_427 28)) (.cse4 (select |v_#pthreadsMutex_769| v_my_callbackThread1of1ForFork1_~data~0.base_427))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_49 |v_my_callbackThread1of1ForFork1_#in~arg.offset_49|) (= |v_my_callbackThread1of1ForFork1_#res.offset_157| 0) (= v_my_callbackThread1of1ForFork1_~arg.base_49 |v_my_callbackThread1of1ForFork1_#in~arg.base_49|) (= |v_my_callbackThread1of1ForFork1_#res.base_157| 0) (= |v_#memory_int_1265| (store |v_#memory_int_1267| v_my_callbackThread1of1ForFork1_~data~0.base_427 (let ((.cse0 (select |v_#memory_int_1267| v_my_callbackThread1of1ForFork1_~data~0.base_427))) (store (store .cse0 .cse1 1) .cse2 (+ (select .cse0 .cse2) 1))))) (= (store |v_#memory_$Pointer$.base_1252| v_my_callbackThread1of1ForFork1_~data~0.base_427 (store (select |v_#memory_$Pointer$.base_1252| v_my_callbackThread1of1ForFork1_~data~0.base_427) .cse1 (select .cse3 .cse1))) |v_#memory_$Pointer$.base_1251|) (= (store |v_#pthreadsMutex_769| v_my_callbackThread1of1ForFork1_~data~0.base_427 (store .cse4 v_my_callbackThread1of1ForFork1_~data~0.offset_427 0)) |v_#pthreadsMutex_767|) (= (store |v_#memory_$Pointer$.base_1251| v_my_callbackThread1of1ForFork1_~data~0.base_427 (store .cse3 .cse2 (select (select |v_#memory_$Pointer$.base_1250| v_my_callbackThread1of1ForFork1_~data~0.base_427) .cse2))) |v_#memory_$Pointer$.base_1250|) (= v_~my_dev~0.offset_232 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_53) (= (store |v_#memory_$Pointer$.offset_1252| v_my_callbackThread1of1ForFork1_~data~0.base_427 (store (select |v_#memory_$Pointer$.offset_1252| v_my_callbackThread1of1ForFork1_~data~0.base_427) .cse1 (select .cse5 .cse1))) |v_#memory_$Pointer$.offset_1251|) (= v_my_callbackThread1of1ForFork1_~__mptr~0.offset_53 .cse1) (= (store |v_#memory_$Pointer$.offset_1251| v_my_callbackThread1of1ForFork1_~data~0.base_427 (store .cse5 .cse2 (select (select |v_#memory_$Pointer$.offset_1250| v_my_callbackThread1of1ForFork1_~data~0.base_427) .cse2))) |v_#memory_$Pointer$.offset_1250|) (= (select .cse4 v_my_callbackThread1of1ForFork1_~data~0.offset_427) 0) (= v_my_callbackThread1of1ForFork1_~data~0.base_427 v_my_callbackThread1of1ForFork1_~__mptr~0.base_53) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_53 v_~my_dev~0.base_232))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_49|, #pthreadsMutex=|v_#pthreadsMutex_769|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1252|, ~my_dev~0.base=v_~my_dev~0.base_232, #memory_int=|v_#memory_int_1267|, ~my_dev~0.offset=v_~my_dev~0.offset_232, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1252|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_49|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_349|, #pthreadsMutex=|v_#pthreadsMutex_767|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1250|, ~my_dev~0.base=v_~my_dev~0.base_232, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_49, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_53, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_93|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_49|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_49|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_427, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_157|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_427, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_49, #memory_int=|v_#memory_int_1265|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_53, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_157|, ~my_dev~0.offset=v_~my_dev~0.offset_232, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1250|} AuxVars[|v_#memory_$Pointer$.offset_1251|, |v_#memory_$Pointer$.base_1251|] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, #memory_$Pointer$.base, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_#res.base, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] and [637] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse6 (select |v_#memory_int_1255| v_my_callbackThread1of1ForFork0_~data~0.base_374)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_374 24))) (let ((.cse2 (select |v_#memory_$Pointer$.offset_1239| v_my_callbackThread1of1ForFork0_~data~0.base_374)) (.cse1 (select |v_#memory_$Pointer$.base_1239| v_my_callbackThread1of1ForFork0_~data~0.base_374)) (.cse3 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_374 28)) (.cse5 (store .cse6 .cse0 1)) (.cse4 (select |v_#pthreadsMutex_759| v_my_callbackThread1of1ForFork0_~data~0.base_374))) (and (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_90 v_~my_dev~0.base_230) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_213| 0) (< |v_#StackHeapBarrier_102| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_265|) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_70| v_my_callbackThread1of1ForFork0_~arg.base_70) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_90 v_~my_dev~0.offset_230) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_265| 0)) (= |v_#memory_$Pointer$.base_1239| (store |v_#memory_$Pointer$.base_1240| v_my_callbackThread1of1ForFork0_~data~0.base_374 (store (select |v_#memory_$Pointer$.base_1240| v_my_callbackThread1of1ForFork0_~data~0.base_374) .cse0 (select .cse1 .cse0)))) (= (select |v_#valid_369| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_265|) 0) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_90) (= |v_ULTIMATE.start_my_drv_probe_#res#1_135| |v_ULTIMATE.start_main_~probe_ret~0#1_178|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_355| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_63|) (= |v_my_callbackThread1of1ForFork0_#res.base_89| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_89| 0) (= |v_#valid_368| (store |v_#valid_369| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_265| 1)) (= (store |v_#memory_$Pointer$.offset_1239| v_my_callbackThread1of1ForFork0_~data~0.base_374 (store .cse2 .cse3 (select (select |v_#memory_$Pointer$.offset_1238| v_my_callbackThread1of1ForFork0_~data~0.base_374) .cse3))) |v_#memory_$Pointer$.offset_1238|) (= |v_ULTIMATE.start_main_~#data~1#1.base_355| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_63|) (= (store |v_#memory_$Pointer$.offset_1240| v_my_callbackThread1of1ForFork0_~data~0.base_374 (store (select |v_#memory_$Pointer$.offset_1240| v_my_callbackThread1of1ForFork0_~data~0.base_374) .cse0 (select .cse2 .cse0))) |v_#memory_$Pointer$.offset_1239|) (= (store |v_#memory_$Pointer$.base_1239| v_my_callbackThread1of1ForFork0_~data~0.base_374 (store .cse1 .cse3 (select (select |v_#memory_$Pointer$.base_1238| v_my_callbackThread1of1ForFork0_~data~0.base_374) .cse3))) |v_#memory_$Pointer$.base_1238|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_178| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_63| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_65|) (= (select .cse4 v_my_callbackThread1of1ForFork0_~data~0.offset_374) 0) (= (store |v_#length_218| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_265| 4) |v_#length_217|) (= v_my_callbackThread1of1ForFork0_~data~0.base_374 v_my_callbackThread1of1ForFork0_~__mptr~0.base_90) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_63| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_65|) (= (store |v_#memory_int_1255| v_my_callbackThread1of1ForFork0_~data~0.base_374 (store .cse5 .cse3 (+ (select .cse6 .cse3) 1))) |v_#memory_int_1253|) (= v_my_callbackThread1of1ForFork0_~arg.offset_70 |v_my_callbackThread1of1ForFork0_#in~arg.offset_70|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_150| (select (select (store |v_#memory_int_1255| v_my_callbackThread1of1ForFork0_~data~0.base_374 .cse5) |v_~#t1~0.base_91|) |v_~#t1~0.offset_91|)) (= |v_#pthreadsMutex_757| (store |v_#pthreadsMutex_759| v_my_callbackThread1of1ForFork0_~data~0.base_374 (store .cse4 v_my_callbackThread1of1ForFork0_~data~0.offset_374 0)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_759|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1240|, ~my_dev~0.base=v_~my_dev~0.base_230, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_70|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_355|, ~#t1~0.offset=|v_~#t1~0.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_102|, ~#t1~0.base=|v_~#t1~0.base_91|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_70|, #valid=|v_#valid_369|, #memory_int=|v_#memory_int_1255|, #length=|v_#length_218|, ~my_dev~0.offset=v_~my_dev~0.offset_230, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1240|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_355|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_150|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1238|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_265|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_124|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_70|, ~#t1~0.offset=|v_~#t1~0.offset_91|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_152|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_90, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_374, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_65|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_157|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_374, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_135|, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_89|, ~#t1~0.base=|v_~#t1~0.base_91|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_164|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_217|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_178|, #length=|v_#length_217|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_125|, ~my_dev~0.offset=v_~my_dev~0.offset_230, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_89|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_63|, #pthreadsMutex=|v_#pthreadsMutex_757|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_228|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_65|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_217|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_70, ~my_dev~0.base=v_~my_dev~0.base_230, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_355|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_167|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_213|, #StackHeapBarrier=|v_#StackHeapBarrier_102|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_70|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_63|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_70, #valid=|v_#valid_368|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_124|, #memory_int=|v_#memory_int_1253|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_90, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1238|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_355|} AuxVars[|v_#memory_$Pointer$.base_1239|, |v_#memory_$Pointer$.offset_1239|] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, my_callbackThread1of1ForFork0_~data~0.offset, ULTIMATE.start_my_drv_probe_#res#1, my_callbackThread1of1ForFork0_#res.base, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_main_~probe_ret~0#1, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1, my_callbackThread1of1ForFork0_#res.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, #pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, my_callbackThread1of1ForFork0_~arg.base, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, my_callbackThread1of1ForFork0_~arg.offset, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, #memory_$Pointer$.offset] [2022-12-13 12:09:23,259 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 12:09:23,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13278 [2022-12-13 12:09:23,260 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 12 transitions, 54 flow [2022-12-13 12:09:23,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:23,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:09:23,260 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:09:23,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 12:09:23,260 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:09:23,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:09:23,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1307609548, now seen corresponding path program 1 times [2022-12-13 12:09:23,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:09:23,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598659598] [2022-12-13 12:09:23,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:09:23,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:09:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:09:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:09:23,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:09:23,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598659598] [2022-12-13 12:09:23,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598659598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:09:23,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:09:23,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:09:23,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342534779] [2022-12-13 12:09:23,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:09:23,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:09:23,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:09:23,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:09:23,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:09:23,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 12 [2022-12-13 12:09:23,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 12 transitions, 54 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:23,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:09:23,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 12 [2022-12-13 12:09:23,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:09:23,911 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 12:09:23,911 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 12:09:23,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 9 events. 0/9 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 2 event pairs, 0 based on Foata normal form. 1/10 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-13 12:09:23,912 INFO L137 encePairwiseOnDemand]: 8/12 looper letters, 0 selfloop transitions, 0 changer transitions 9/9 dead transitions. [2022-12-13 12:09:23,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 9 transitions, 50 flow [2022-12-13 12:09:23,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:09:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:09:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-12-13 12:09:23,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20833333333333334 [2022-12-13 12:09:23,912 INFO L175 Difference]: Start difference. First operand has 21 places, 12 transitions, 54 flow. Second operand 4 states and 10 transitions. [2022-12-13 12:09:23,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 9 transitions, 50 flow [2022-12-13 12:09:23,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 9 transitions, 37 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 12:09:23,913 INFO L231 Difference]: Finished difference. Result has 14 places, 0 transitions, 0 flow [2022-12-13 12:09:23,913 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=14, PETRI_TRANSITIONS=0} [2022-12-13 12:09:23,913 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -39 predicate places. [2022-12-13 12:09:23,913 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:09:23,913 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 14 places, 0 transitions, 0 flow [2022-12-13 12:09:23,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 12:09:23,914 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:09:23,914 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:09:23,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 12:09:23,914 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 12:09:23,914 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 12:09:23,914 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:09:23,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 12:09:23,915 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 12:09:23,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:09:23,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-13 12:09:23,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-13 12:09:23,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-13 12:09:23,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-12-13 12:09:23,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-12-13 12:09:23,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-12-13 12:09:23,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-12-13 12:09:23,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-12-13 12:09:23,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 12:09:23,918 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:09:23,921 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:09:23,921 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:09:23,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:09:23 BasicIcfg [2022-12-13 12:09:23,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:09:23,924 INFO L158 Benchmark]: Toolchain (without parser) took 165882.36ms. Allocated memory was 177.2MB in the beginning and 317.7MB in the end (delta: 140.5MB). Free memory was 141.1MB in the beginning and 75.8MB in the end (delta: 65.3MB). Peak memory consumption was 206.7MB. Max. memory is 8.0GB. [2022-12-13 12:09:23,924 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:09:23,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 851.91ms. Allocated memory is still 177.2MB. Free memory was 141.1MB in the beginning and 86.9MB in the end (delta: 54.2MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2022-12-13 12:09:23,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.44ms. Allocated memory is still 177.2MB. Free memory was 86.9MB in the beginning and 83.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 12:09:23,924 INFO L158 Benchmark]: Boogie Preprocessor took 50.27ms. Allocated memory is still 177.2MB. Free memory was 83.3MB in the beginning and 80.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 12:09:23,925 INFO L158 Benchmark]: RCFGBuilder took 713.73ms. Allocated memory is still 177.2MB. Free memory was 80.6MB in the beginning and 152.4MB in the end (delta: -71.7MB). Peak memory consumption was 30.5MB. Max. memory is 8.0GB. [2022-12-13 12:09:23,925 INFO L158 Benchmark]: TraceAbstraction took 164202.10ms. Allocated memory was 177.2MB in the beginning and 317.7MB in the end (delta: 140.5MB). Free memory was 151.3MB in the beginning and 75.8MB in the end (delta: 75.5MB). Peak memory consumption was 216.0MB. Max. memory is 8.0GB. [2022-12-13 12:09:23,926 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 851.91ms. Allocated memory is still 177.2MB. Free memory was 141.1MB in the beginning and 86.9MB in the end (delta: 54.2MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.44ms. Allocated memory is still 177.2MB. Free memory was 86.9MB in the beginning and 83.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.27ms. Allocated memory is still 177.2MB. Free memory was 83.3MB in the beginning and 80.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 713.73ms. Allocated memory is still 177.2MB. Free memory was 80.6MB in the beginning and 152.4MB in the end (delta: -71.7MB). Peak memory consumption was 30.5MB. Max. memory is 8.0GB. * TraceAbstraction took 164202.10ms. Allocated memory was 177.2MB in the beginning and 317.7MB in the end (delta: 140.5MB). Free memory was 151.3MB in the beginning and 75.8MB in the end (delta: 75.5MB). Peak memory consumption was 216.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.4s, 161 PlacesBefore, 53 PlacesAfterwards, 161 TransitionsBefore, 49 TransitionsAfterwards, 2392 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 77 TrivialYvCompositions, 48 ConcurrentYvCompositions, 4 ChoiceCompositions, 134 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2459, independent: 2334, independent conditional: 2334, independent unconditional: 0, dependent: 105, dependent conditional: 105, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2459, independent: 2334, independent conditional: 0, independent unconditional: 2334, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2459, independent: 2334, independent conditional: 0, independent unconditional: 2334, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2459, independent: 2334, independent conditional: 0, independent unconditional: 2334, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1761, independent: 1714, independent conditional: 0, independent unconditional: 1714, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1761, independent: 1707, independent conditional: 0, independent unconditional: 1707, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17048, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 2050, dependent conditional: 0, dependent unconditional: 2050, unknown: 14912, unknown conditional: 0, unknown unconditional: 14912] ], Cache Queries: [ total: 2459, independent: 620, independent conditional: 0, independent unconditional: 620, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 1774, unknown conditional: 0, unknown unconditional: 1774] , Statistics on independence cache: Total cache size (in pairs): 3141, Positive cache size: 3101, Positive conditional cache size: 0, Positive unconditional cache size: 3101, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.7s, 47 PlacesBefore, 46 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 832 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 380, independent: 302, independent conditional: 302, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 380, independent: 302, independent conditional: 0, independent unconditional: 302, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 380, independent: 302, independent conditional: 0, independent unconditional: 302, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 380, independent: 302, independent conditional: 0, independent unconditional: 302, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 165, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 165, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30469, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 361, dependent conditional: 0, dependent unconditional: 361, unknown: 29964, unknown conditional: 0, unknown unconditional: 29964] ], Cache Queries: [ total: 380, independent: 167, independent conditional: 0, independent unconditional: 167, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 191, unknown conditional: 0, unknown unconditional: 191] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 135, Positive conditional cache size: 0, Positive unconditional cache size: 135, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 14, Unknown conditional cache size: 0, Unknown unconditional cache size: 14, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 49 PlacesBefore, 49 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 946 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, independent: 123, independent conditional: 123, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 145, independent: 123, independent conditional: 12, independent unconditional: 111, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 145, independent: 123, independent conditional: 12, independent unconditional: 111, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 145, independent: 123, independent conditional: 12, independent unconditional: 111, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, independent: 33, independent conditional: 4, independent unconditional: 29, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4455, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 153, dependent conditional: 77, dependent unconditional: 76, unknown: 4292, unknown conditional: 4292, unknown unconditional: 0] ], Cache Queries: [ total: 145, independent: 90, independent conditional: 8, independent unconditional: 82, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 43, unknown conditional: 11, unknown unconditional: 32] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 168, Positive conditional cache size: 4, Positive unconditional cache size: 164, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 16, Unknown conditional cache size: 2, Unknown unconditional cache size: 14, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 51 PlacesBefore, 50 PlacesAfterwards, 61 TransitionsBefore, 60 TransitionsAfterwards, 1126 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 892, independent: 790, independent conditional: 790, independent unconditional: 0, dependent: 99, dependent conditional: 99, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 892, independent: 790, independent conditional: 68, independent unconditional: 722, dependent: 99, dependent conditional: 6, dependent unconditional: 93, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 892, independent: 790, independent conditional: 68, independent unconditional: 722, dependent: 99, dependent conditional: 6, dependent unconditional: 93, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 892, independent: 790, independent conditional: 68, independent unconditional: 722, dependent: 99, dependent conditional: 6, dependent unconditional: 93, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 44, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 15, dependent conditional: 7, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 892, independent: 751, independent conditional: 68, independent unconditional: 683, dependent: 94, dependent conditional: 4, dependent unconditional: 90, unknown: 47, unknown conditional: 2, unknown unconditional: 45] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 249, Positive conditional cache size: 4, Positive unconditional cache size: 245, Negative cache size: 27, Negative conditional cache size: 5, Negative unconditional cache size: 22, Unknown cache size: 16, Unknown conditional cache size: 2, Unknown unconditional cache size: 14, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 283, Positive cache size: 254, Positive conditional cache size: 4, Positive unconditional cache size: 250, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 16, Unknown conditional cache size: 2, Unknown unconditional cache size: 14, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 52 PlacesBefore, 49 PlacesAfterwards, 55 TransitionsBefore, 52 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 51, independent conditional: 19, independent unconditional: 32, dependent: 23, dependent conditional: 9, dependent unconditional: 14, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 51, independent conditional: 19, independent unconditional: 32, dependent: 23, dependent conditional: 9, dependent unconditional: 14, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 51, independent conditional: 19, independent unconditional: 32, dependent: 23, dependent conditional: 9, dependent unconditional: 14, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 10, independent unconditional: 4, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4460, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 156, dependent conditional: 86, dependent unconditional: 70, unknown: 4296, unknown conditional: 0, unknown unconditional: 4296] ], Cache Queries: [ total: 80, independent: 37, independent conditional: 9, independent unconditional: 28, dependent: 19, dependent conditional: 6, dependent unconditional: 13, unknown: 24, unknown conditional: 13, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 319, Positive cache size: 286, Positive conditional cache size: 14, Positive unconditional cache size: 272, Negative cache size: 33, Negative conditional cache size: 8, Negative unconditional cache size: 25, Unknown cache size: 18, Unknown conditional cache size: 2, Unknown unconditional cache size: 16, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 75, independent: 56, independent conditional: 25, independent unconditional: 31, dependent: 16, dependent conditional: 11, dependent unconditional: 5, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 56, independent conditional: 25, independent unconditional: 31, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 56, independent conditional: 25, independent unconditional: 31, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 9, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 49, independent conditional: 22, independent unconditional: 27, dependent: 13, dependent conditional: 9, dependent unconditional: 4, unknown: 14, unknown conditional: 6, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 293, Positive conditional cache size: 17, Positive unconditional cache size: 276, Negative cache size: 37, Negative conditional cache size: 11, Negative unconditional cache size: 26, Unknown cache size: 18, Unknown conditional cache size: 2, Unknown unconditional cache size: 16, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 110, independent: 79, independent conditional: 18, independent unconditional: 61, dependent: 25, dependent conditional: 20, dependent unconditional: 5, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, independent: 79, independent conditional: 18, independent unconditional: 61, dependent: 25, dependent conditional: 20, dependent unconditional: 5, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, independent: 79, independent conditional: 18, independent unconditional: 61, dependent: 25, dependent conditional: 20, dependent unconditional: 5, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, independent: 76, independent conditional: 18, independent unconditional: 58, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 12, unknown conditional: 3, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 336, Positive cache size: 296, Positive conditional cache size: 17, Positive unconditional cache size: 279, Negative cache size: 40, Negative conditional cache size: 14, Negative unconditional cache size: 26, Unknown cache size: 18, Unknown conditional cache size: 2, Unknown unconditional cache size: 16, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 54 PlacesBefore, 54 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 25, dependent conditional: 23, dependent unconditional: 2, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 25, dependent conditional: 23, dependent unconditional: 2, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 25, dependent conditional: 23, dependent unconditional: 2, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2160, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2160, unknown conditional: 0, unknown unconditional: 2160] ], Cache Queries: [ total: 72, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 25, dependent conditional: 23, dependent unconditional: 2, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 336, Positive cache size: 296, Positive conditional cache size: 17, Positive unconditional cache size: 279, Negative cache size: 40, Negative conditional cache size: 14, Negative unconditional cache size: 26, Unknown cache size: 19, Unknown conditional cache size: 2, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 78, independent: 51, independent conditional: 26, independent unconditional: 25, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, independent: 51, independent conditional: 26, independent unconditional: 25, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, independent: 51, independent conditional: 26, independent unconditional: 25, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, independent: 49, independent conditional: 24, independent unconditional: 25, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 298, Positive conditional cache size: 19, Positive unconditional cache size: 279, Negative cache size: 41, Negative conditional cache size: 15, Negative unconditional cache size: 26, Unknown cache size: 19, Unknown conditional cache size: 2, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 57 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 38 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 146, independent: 117, independent conditional: 117, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 146, independent: 117, independent conditional: 34, independent unconditional: 83, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 146, independent: 117, independent conditional: 34, independent unconditional: 83, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 117, independent conditional: 34, independent unconditional: 83, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 146, independent: 109, independent conditional: 28, independent unconditional: 81, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 12, unknown conditional: 7, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 379, Positive cache size: 334, Positive conditional cache size: 25, Positive unconditional cache size: 309, Negative cache size: 45, Negative conditional cache size: 16, Negative unconditional cache size: 29, Unknown cache size: 19, Unknown conditional cache size: 2, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 53 PlacesBefore, 49 PlacesAfterwards, 38 TransitionsBefore, 35 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 129, independent conditional: 129, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 129, independent conditional: 56, independent unconditional: 73, dependent: 27, dependent conditional: 3, dependent unconditional: 24, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 129, independent conditional: 56, independent unconditional: 73, dependent: 27, dependent conditional: 3, dependent unconditional: 24, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 129, independent conditional: 56, independent unconditional: 73, dependent: 27, dependent conditional: 3, dependent unconditional: 24, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2434, independent: 205, independent conditional: 205, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 2163, unknown conditional: 2163, unknown unconditional: 0] ], Cache Queries: [ total: 159, independent: 127, independent conditional: 54, independent unconditional: 73, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 344, Positive conditional cache size: 27, Positive unconditional cache size: 317, Negative cache size: 46, Negative conditional cache size: 17, Negative unconditional cache size: 29, Unknown cache size: 20, Unknown conditional cache size: 3, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.1s, 56 PlacesBefore, 52 PlacesAfterwards, 41 TransitionsBefore, 37 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 53, independent: 36, independent conditional: 3, independent unconditional: 33, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, independent: 36, independent conditional: 3, independent unconditional: 33, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, independent: 36, independent conditional: 3, independent unconditional: 33, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 398, Positive cache size: 351, Positive conditional cache size: 30, Positive unconditional cache size: 321, Negative cache size: 47, Negative conditional cache size: 17, Negative unconditional cache size: 30, Unknown cache size: 20, Unknown conditional cache size: 3, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 36, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 11, dependent conditional: 1, dependent unconditional: 10, 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: 36, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 398, Positive cache size: 351, Positive conditional cache size: 30, Positive unconditional cache size: 321, Negative cache size: 47, Negative conditional cache size: 17, Negative unconditional cache size: 30, Unknown cache size: 20, Unknown conditional cache size: 3, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , 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: 18, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 398, Positive cache size: 351, Positive conditional cache size: 30, Positive unconditional cache size: 321, Negative cache size: 47, Negative conditional cache size: 17, Negative unconditional cache size: 30, Unknown cache size: 20, Unknown conditional cache size: 3, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 49 PlacesBefore, 48 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 2, unknown conditional: 2, 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: 34, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 399, Positive cache size: 352, Positive conditional cache size: 30, Positive unconditional cache size: 322, Negative cache size: 47, Negative conditional cache size: 17, Negative unconditional cache size: 30, Unknown cache size: 20, Unknown conditional cache size: 3, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 46 PlacesBefore, 46 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 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: 40, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 400, Positive cache size: 352, Positive conditional cache size: 30, Positive unconditional cache size: 322, Negative cache size: 48, Negative conditional cache size: 18, Negative unconditional cache size: 30, Unknown cache size: 20, Unknown conditional cache size: 3, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.4s, 49 PlacesBefore, 47 PlacesAfterwards, 32 TransitionsBefore, 30 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19692, independent: 506, independent conditional: 506, independent unconditional: 0, dependent: 2200, dependent conditional: 2200, dependent unconditional: 0, unknown: 16986, unknown conditional: 16986, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 437, Positive cache size: 382, Positive conditional cache size: 41, Positive unconditional cache size: 341, Negative cache size: 55, Negative conditional cache size: 25, Negative unconditional cache size: 30, Unknown cache size: 28, Unknown conditional cache size: 11, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 46 PlacesBefore, 46 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 12 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, 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: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 384, Positive conditional cache size: 42, Positive unconditional cache size: 342, Negative cache size: 55, Negative conditional cache size: 25, Negative unconditional cache size: 30, Unknown cache size: 28, Unknown conditional cache size: 11, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 49 PlacesBefore, 49 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 444, Positive cache size: 389, Positive conditional cache size: 43, Positive unconditional cache size: 346, Negative cache size: 55, Negative conditional cache size: 25, Negative unconditional cache size: 30, Unknown cache size: 28, Unknown conditional cache size: 11, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 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): 444, Positive cache size: 389, Positive conditional cache size: 43, Positive unconditional cache size: 346, Negative cache size: 55, Negative conditional cache size: 25, Negative unconditional cache size: 30, Unknown cache size: 28, Unknown conditional cache size: 11, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 48 PlacesBefore, 48 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 449, Positive cache size: 394, Positive conditional cache size: 44, Positive unconditional cache size: 350, Negative cache size: 55, Negative conditional cache size: 25, Negative unconditional cache size: 30, Unknown cache size: 28, Unknown conditional cache size: 11, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 47 PlacesBefore, 47 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 4 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): 449, Positive cache size: 394, Positive conditional cache size: 44, Positive unconditional cache size: 350, Negative cache size: 55, Negative conditional cache size: 25, Negative unconditional cache size: 30, Unknown cache size: 28, Unknown conditional cache size: 11, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 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): 449, Positive cache size: 394, Positive conditional cache size: 44, Positive unconditional cache size: 350, Negative cache size: 55, Negative conditional cache size: 25, Negative unconditional cache size: 30, Unknown cache size: 28, Unknown conditional cache size: 11, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 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): 449, Positive cache size: 394, Positive conditional cache size: 44, Positive unconditional cache size: 350, Negative cache size: 55, Negative conditional cache size: 25, Negative unconditional cache size: 30, Unknown cache size: 28, Unknown conditional cache size: 11, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ 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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 453, Positive cache size: 396, Positive conditional cache size: 44, Positive unconditional cache size: 352, Negative cache size: 57, Negative conditional cache size: 27, Negative unconditional cache size: 30, Unknown cache size: 28, Unknown conditional cache size: 11, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.3s, 22 PlacesBefore, 21 PlacesAfterwards, 13 TransitionsBefore, 12 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 455, Positive cache size: 398, Positive conditional cache size: 44, Positive unconditional cache size: 354, Negative cache size: 57, Negative conditional cache size: 27, Negative unconditional cache size: 30, Unknown cache size: 28, Unknown conditional cache size: 11, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 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): 455, Positive cache size: 398, Positive conditional cache size: 44, Positive unconditional cache size: 354, Negative cache size: 57, Negative conditional cache size: 27, Negative unconditional cache size: 30, Unknown cache size: 28, Unknown conditional cache size: 11, Unknown unconditional cache size: 17, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 181 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 164.1s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 31.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 535 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 535 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4519 IncrementalHoareTripleChecker+Invalid, 4752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 233 mSolverCounterUnsat, 39 mSDtfsCounter, 4519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=707occurred in iteration=9, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 6809 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 12:09:24,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...