/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:22:23,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:22:23,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:22:23,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:22:23,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:22:23,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:22:23,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:22:23,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:22:23,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:22:23,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:22:23,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:22:23,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:22:23,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:22:23,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:22:23,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:22:23,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:22:23,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:22:23,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:22:23,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:22:23,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:22:23,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:22:23,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:22:23,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:22:23,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:22:23,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:22:23,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:22:23,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:22:23,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:22:23,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:22:23,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:22:23,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:22:23,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:22:23,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:22:23,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:22:23,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:22:23,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:22:23,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:22:23,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:22:23,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:22:23,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:22:23,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:22:23,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:22:23,815 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:22:23,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:22:23,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:22:23,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:22:23,817 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:22:23,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:22:23,818 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:22:23,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:22:23,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:22:23,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:22:23,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:22:23,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:22:23,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:22:23,819 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:22:23,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:22:23,819 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:22:23,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:22:23,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:22:23,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:22:23,819 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:22:23,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:22:23,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:22:23,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:22:23,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:22:23,820 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:22:23,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:22:23,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:22:23,820 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:22:23,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:22:24,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:22:24,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:22:24,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:22:24,075 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:22:24,078 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:22:24,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2022-12-05 23:22:24,934 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:22:25,117 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:22:25,118 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2022-12-05 23:22:25,129 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31c1aab37/f23aec93877249f2a66affb62271464f/FLAGdd4736ebc [2022-12-05 23:22:25,144 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31c1aab37/f23aec93877249f2a66affb62271464f [2022-12-05 23:22:25,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:22:25,147 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:22:25,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:22:25,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:22:25,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:22:25,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:22:25" (1/1) ... [2022-12-05 23:22:25,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f69e12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:25, skipping insertion in model container [2022-12-05 23:22:25,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:22:25" (1/1) ... [2022-12-05 23:22:25,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:22:25,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:22:25,633 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-2_1-container_of.i[76077,76090] [2022-12-05 23:22:25,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:22:25,686 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:22:25,733 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-2_1-container_of.i[76077,76090] [2022-12-05 23:22:25,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:22:25,835 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:22:25,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:25 WrapperNode [2022-12-05 23:22:25,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:22:25,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:22:25,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:22:25,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:22:25,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:25" (1/1) ... [2022-12-05 23:22:25,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:25" (1/1) ... [2022-12-05 23:22:25,897 INFO L138 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 133 [2022-12-05 23:22:25,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:22:25,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:22:25,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:22:25,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:22:25,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:25" (1/1) ... [2022-12-05 23:22:25,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:25" (1/1) ... [2022-12-05 23:22:25,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:25" (1/1) ... [2022-12-05 23:22:25,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:25" (1/1) ... [2022-12-05 23:22:25,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:25" (1/1) ... [2022-12-05 23:22:25,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:25" (1/1) ... [2022-12-05 23:22:25,920 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:25" (1/1) ... [2022-12-05 23:22:25,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:25" (1/1) ... [2022-12-05 23:22:25,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:22:25,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:22:25,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:22:25,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:22:25,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:25" (1/1) ... [2022-12-05 23:22:25,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:22:25,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:22:25,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:22:25,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:22:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:22:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:22:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 23:22:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:22:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-05 23:22:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:22:25,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:22:25,999 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-05 23:22:25,999 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-05 23:22:25,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:22:25,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:22:25,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:22:26,000 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:22:26,251 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:22:26,253 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:22:26,507 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:22:26,513 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:22:26,513 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:22:26,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:22:26 BoogieIcfgContainer [2022-12-05 23:22:26,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:22:26,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:22:26,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:22:26,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:22:26,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:22:25" (1/3) ... [2022-12-05 23:22:26,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caf5e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:22:26, skipping insertion in model container [2022-12-05 23:22:26,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:25" (2/3) ... [2022-12-05 23:22:26,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caf5e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:22:26, skipping insertion in model container [2022-12-05 23:22:26,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:22:26" (3/3) ... [2022-12-05 23:22:26,526 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2022-12-05 23:22:26,539 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:22:26,539 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-05 23:22:26,539 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:22:26,612 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 23:22:26,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 174 transitions, 364 flow [2022-12-05 23:22:26,726 INFO L130 PetriNetUnfolder]: 10/212 cut-off events. [2022-12-05 23:22:26,726 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:22:26,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 212 events. 10/212 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 372 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 124. Up to 4 conditions per place. [2022-12-05 23:22:26,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 174 transitions, 364 flow [2022-12-05 23:22:26,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 162 transitions, 336 flow [2022-12-05 23:22:26,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:22:26,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 162 transitions, 336 flow [2022-12-05 23:22:26,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 162 transitions, 336 flow [2022-12-05 23:22:26,806 INFO L130 PetriNetUnfolder]: 7/193 cut-off events. [2022-12-05 23:22:26,806 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:22:26,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 193 events. 7/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 315 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 114. Up to 4 conditions per place. [2022-12-05 23:22:26,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 162 transitions, 336 flow [2022-12-05 23:22:26,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 2604 [2022-12-05 23:22:26,937 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:26,938 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:26,941 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:26,942 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:29,631 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:29,634 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:29,638 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:29,639 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:29,807 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:29,808 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:29,810 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:29,811 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:30,045 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:30,047 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:30,049 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:30,050 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:30,055 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:30,056 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-05 23:22:30,083 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:30,084 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:33,384 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:33,385 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:33,388 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:33,388 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:35,784 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:35,785 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-05 23:22:35,787 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:35,788 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:35,790 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:35,791 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-05 23:22:35,792 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:35,792 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:38,440 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:38,441 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:38,442 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:38,443 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:38,581 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:38,582 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:38,583 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:38,584 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:41,568 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:41,569 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:41,571 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:41,571 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:44,171 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:44,171 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:44,173 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:44,173 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:44,233 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:44,234 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-05 23:22:44,264 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:44,265 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:44,269 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:44,269 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-05 23:22:44,273 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:44,273 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:45,517 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:45,518 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:45,520 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:45,520 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:47,983 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:47,984 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:47,986 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:47,986 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:52,052 INFO L203 LiptonReduction]: Total number of compositions: 132 [2022-12-05 23:22:52,067 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:22:52,071 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;@27f08885, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:22:52,071 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-05 23:22:52,072 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:22:52,072 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:22:52,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:22:52,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-05 23:22:52,073 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-05 23:22:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:22:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash 586, now seen corresponding path program 1 times [2022-12-05 23:22:52,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:22:52,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810969100] [2022-12-05 23:22:52,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:22:52,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:22:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:22:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:22:52,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:22:52,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810969100] [2022-12-05 23:22:52,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810969100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:22:52,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:22:52,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-05 23:22:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769277659] [2022-12-05 23:22:52,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:22:52,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:22:52,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:22:52,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:22:52,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:22:52,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2022-12-05 23:22:52,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 82 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-05 23:22:52,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:22:52,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2022-12-05 23:22:52,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:22:52,432 INFO L130 PetriNetUnfolder]: 225/508 cut-off events. [2022-12-05 23:22:52,432 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-05 23:22:52,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 508 events. 225/508 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2817 event pairs, 224 based on Foata normal form. 25/419 useless extension candidates. Maximal degree in co-relation 855. Up to 403 conditions per place. [2022-12-05 23:22:52,439 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 25 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-12-05 23:22:52,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 126 flow [2022-12-05 23:22:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:22:52,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:22:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-12-05 23:22:52,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-05 23:22:52,448 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 82 flow. Second operand 2 states and 42 transitions. [2022-12-05 23:22:52,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 126 flow [2022-12-05 23:22:52,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:22:52,453 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 68 flow [2022-12-05 23:22:52,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2022-12-05 23:22:52,457 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2022-12-05 23:22:52,458 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:22:52,458 INFO L89 Accepts]: Start accepts. Operand has 34 places, 32 transitions, 68 flow [2022-12-05 23:22:52,460 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:22:52,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:22:52,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 32 transitions, 68 flow [2022-12-05 23:22:52,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 68 flow [2022-12-05 23:22:52,473 INFO L130 PetriNetUnfolder]: 1/38 cut-off events. [2022-12-05 23:22:52,473 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:22:52,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 90 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-05 23:22:52,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 32 transitions, 68 flow [2022-12-05 23:22:52,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-05 23:22:52,484 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:52,485 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:52,493 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:52,493 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:54,882 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:22:54,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2425 [2022-12-05 23:22:54,883 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 66 flow [2022-12-05 23:22:54,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-05 23:22:54,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:22:54,884 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:22:54,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:22:54,884 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-05 23:22:54,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:22:54,884 INFO L85 PathProgramCache]: Analyzing trace with hash 18525369, now seen corresponding path program 1 times [2022-12-05 23:22:54,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:22:54,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784107587] [2022-12-05 23:22:54,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:22:54,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:22:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:22:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:22:55,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:22:55,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784107587] [2022-12-05 23:22:55,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784107587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:22:55,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:22:55,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:22:55,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670422265] [2022-12-05 23:22:55,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:22:55,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:22:55,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:22:55,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:22:55,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:22:55,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-05 23:22:55,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 66 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:22:55,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:22:55,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-05 23:22:55,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:22:55,406 INFO L130 PetriNetUnfolder]: 861/1449 cut-off events. [2022-12-05 23:22:55,406 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:22:55,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2908 conditions, 1449 events. 861/1449 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7211 event pairs, 414 based on Foata normal form. 0/1213 useless extension candidates. Maximal degree in co-relation 235. Up to 1025 conditions per place. [2022-12-05 23:22:55,412 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 40 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2022-12-05 23:22:55,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 188 flow [2022-12-05 23:22:55,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:22:55,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:22:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-05 23:22:55,414 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2022-12-05 23:22:55,414 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 66 flow. Second operand 3 states and 47 transitions. [2022-12-05 23:22:55,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 188 flow [2022-12-05 23:22:55,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:22:55,415 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 102 flow [2022-12-05 23:22:55,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2022-12-05 23:22:55,416 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2022-12-05 23:22:55,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:22:55,416 INFO L89 Accepts]: Start accepts. Operand has 35 places, 35 transitions, 102 flow [2022-12-05 23:22:55,416 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:22:55,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:22:55,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 35 transitions, 102 flow [2022-12-05 23:22:55,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 35 transitions, 102 flow [2022-12-05 23:22:55,426 INFO L130 PetriNetUnfolder]: 29/133 cut-off events. [2022-12-05 23:22:55,426 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 23:22:55,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 133 events. 29/133 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 620 event pairs, 16 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 58. Up to 53 conditions per place. [2022-12-05 23:22:55,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 35 transitions, 102 flow [2022-12-05 23:22:55,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-05 23:22:59,840 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:22:59,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4425 [2022-12-05 23:22:59,841 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 102 flow [2022-12-05 23:22:59,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:22:59,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:22:59,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:22:59,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:22:59,842 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-05 23:22:59,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:22:59,842 INFO L85 PathProgramCache]: Analyzing trace with hash 574281447, now seen corresponding path program 1 times [2022-12-05 23:22:59,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:22:59,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406426183] [2022-12-05 23:22:59,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:22:59,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:22:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:22:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:22:59,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:22:59,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406426183] [2022-12-05 23:22:59,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406426183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:22:59,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:22:59,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:22:59,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557408314] [2022-12-05 23:22:59,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:22:59,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:22:59,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:22:59,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:22:59,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:22:59,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-05 23:22:59,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 35 transitions, 102 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:22:59,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:22:59,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-05 23:22:59,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:00,156 INFO L130 PetriNetUnfolder]: 935/1593 cut-off events. [2022-12-05 23:23:00,157 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2022-12-05 23:23:00,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 1593 events. 935/1593 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8299 event pairs, 490 based on Foata normal form. 90/1528 useless extension candidates. Maximal degree in co-relation 946. Up to 1130 conditions per place. [2022-12-05 23:23:00,164 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 42 selfloop transitions, 9 changer transitions 2/53 dead transitions. [2022-12-05 23:23:00,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 53 transitions, 266 flow [2022-12-05 23:23:00,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:23:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:23:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-05 23:23:00,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4946236559139785 [2022-12-05 23:23:00,166 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 102 flow. Second operand 3 states and 46 transitions. [2022-12-05 23:23:00,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 53 transitions, 266 flow [2022-12-05 23:23:00,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 53 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:23:00,175 INFO L231 Difference]: Finished difference. Result has 37 places, 41 transitions, 167 flow [2022-12-05 23:23:00,175 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=37, PETRI_TRANSITIONS=41} [2022-12-05 23:23:00,176 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2022-12-05 23:23:00,176 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:00,176 INFO L89 Accepts]: Start accepts. Operand has 37 places, 41 transitions, 167 flow [2022-12-05 23:23:00,176 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:00,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:00,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 41 transitions, 167 flow [2022-12-05 23:23:00,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 41 transitions, 167 flow [2022-12-05 23:23:00,211 INFO L130 PetriNetUnfolder]: 72/209 cut-off events. [2022-12-05 23:23:00,211 INFO L131 PetriNetUnfolder]: For 96/98 co-relation queries the response was YES. [2022-12-05 23:23:00,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 209 events. 72/209 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1057 event pairs, 16 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 160. Up to 113 conditions per place. [2022-12-05 23:23:00,212 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 41 transitions, 167 flow [2022-12-05 23:23:00,212 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-05 23:23:00,229 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:00,230 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:00,231 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:00,231 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:00,356 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_53|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_84|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_462|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_521|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_462|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|} 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 [379] 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-05 23:23:00,359 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_53|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_84|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_462|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_521|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_462|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|} 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 [409] 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_$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|) (= (store |v_#memory_int_39| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_int_39| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 1)) |v_#memory_int_38|))) 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_39|, #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_38|, 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-05 23:23:00,362 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_53|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_84|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_462|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_521|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_462|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|} 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 [377] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= (store |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1)) |v_#memory_int_29|) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-05 23:23:00,364 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_53|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_84|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_462|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_521|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_462|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|} 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 [525] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_51 28))) (and (= |v_#memory_$Pointer$.base_115| (store |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 (select (select |v_#memory_$Pointer$.base_115| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0)))) (= (store |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_22| 1))) |v_#memory_int_158|) (= (store |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 (select (select |v_#memory_$Pointer$.offset_115| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0))) |v_#memory_$Pointer$.offset_115|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_22|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_51, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_51, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_116|, #memory_int=|v_#memory_int_159|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_116|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_51, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_51, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_115|, #memory_int=|v_#memory_int_158|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_115|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-05 23:23:00,372 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:23:00,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-05 23:23:00,372 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 40 transitions, 173 flow [2022-12-05 23:23:00,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:00,373 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:00,373 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:00,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:23:00,373 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-05 23:23:00,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:00,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1473721803, now seen corresponding path program 1 times [2022-12-05 23:23:00,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:00,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366266612] [2022-12-05 23:23:00,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:00,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:00,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:00,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366266612] [2022-12-05 23:23:00,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366266612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:00,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:00,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:23:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57844022] [2022-12-05 23:23:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:00,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:23:00,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:00,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:23:00,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:23:00,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-05 23:23:00,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 40 transitions, 173 flow. Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:00,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:00,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-05 23:23:00,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:00,434 INFO L130 PetriNetUnfolder]: 80/189 cut-off events. [2022-12-05 23:23:00,434 INFO L131 PetriNetUnfolder]: For 232/235 co-relation queries the response was YES. [2022-12-05 23:23:00,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 189 events. 80/189 cut-off events. For 232/235 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 737 event pairs, 80 based on Foata normal form. 55/212 useless extension candidates. Maximal degree in co-relation 448. Up to 157 conditions per place. [2022-12-05 23:23:00,435 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 17 selfloop transitions, 0 changer transitions 2/23 dead transitions. [2022-12-05 23:23:00,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 104 flow [2022-12-05 23:23:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:23:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:23:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2022-12-05 23:23:00,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-05 23:23:00,436 INFO L175 Difference]: Start difference. First operand has 36 places, 40 transitions, 173 flow. Second operand 2 states and 36 transitions. [2022-12-05 23:23:00,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 104 flow [2022-12-05 23:23:00,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 23 transitions, 96 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 23:23:00,436 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 54 flow [2022-12-05 23:23:00,436 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-05 23:23:00,437 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -10 predicate places. [2022-12-05 23:23:00,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:00,437 INFO L89 Accepts]: Start accepts. Operand has 29 places, 21 transitions, 54 flow [2022-12-05 23:23:00,438 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:00,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:00,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 54 flow [2022-12-05 23:23:00,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 54 flow [2022-12-05 23:23:00,442 INFO L130 PetriNetUnfolder]: 4/39 cut-off events. [2022-12-05 23:23:00,442 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:23:00,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 39 events. 4/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 4 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 34. Up to 13 conditions per place. [2022-12-05 23:23:00,442 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 54 flow [2022-12-05 23:23:00,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-05 23:23:00,444 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:23:00,445 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-05 23:23:00,445 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 54 flow [2022-12-05 23:23:00,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:00,445 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:00,445 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:00,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:23:00,445 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:23:00,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:00,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1922876778, now seen corresponding path program 1 times [2022-12-05 23:23:00,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:00,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504057427] [2022-12-05 23:23:00,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:00,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:00,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:00,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504057427] [2022-12-05 23:23:00,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504057427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:00,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:00,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:23:00,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677877882] [2022-12-05 23:23:00,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:00,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:23:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:00,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:23:00,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:23:00,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-05 23:23:00,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:00,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:00,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-05 23:23:00,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:01,042 INFO L130 PetriNetUnfolder]: 69/170 cut-off events. [2022-12-05 23:23:01,042 INFO L131 PetriNetUnfolder]: For 18/26 co-relation queries the response was YES. [2022-12-05 23:23:01,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 170 events. 69/170 cut-off events. For 18/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 655 event pairs, 29 based on Foata normal form. 12/177 useless extension candidates. Maximal degree in co-relation 93. Up to 67 conditions per place. [2022-12-05 23:23:01,043 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 26 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2022-12-05 23:23:01,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 35 transitions, 155 flow [2022-12-05 23:23:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:23:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:23:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-05 23:23:01,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2022-12-05 23:23:01,044 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 5 states and 48 transitions. [2022-12-05 23:23:01,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 35 transitions, 155 flow [2022-12-05 23:23:01,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 35 transitions, 155 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:23:01,045 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 89 flow [2022-12-05 23:23:01,045 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2022-12-05 23:23:01,046 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2022-12-05 23:23:01,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:01,046 INFO L89 Accepts]: Start accepts. Operand has 31 places, 25 transitions, 89 flow [2022-12-05 23:23:01,046 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:01,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:01,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 25 transitions, 89 flow [2022-12-05 23:23:01,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 25 transitions, 89 flow [2022-12-05 23:23:01,052 INFO L130 PetriNetUnfolder]: 8/54 cut-off events. [2022-12-05 23:23:01,052 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:23:01,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 54 events. 8/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 4 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 58. Up to 19 conditions per place. [2022-12-05 23:23:01,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 25 transitions, 89 flow [2022-12-05 23:23:01,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-05 23:23:01,057 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:01,057 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:01,058 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:01,059 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:07,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:23:07,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6606 [2022-12-05 23:23:07,652 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 87 flow [2022-12-05 23:23:07,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:07,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:07,652 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:07,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:23:07,652 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-05 23:23:07,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:07,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1748318950, now seen corresponding path program 1 times [2022-12-05 23:23:07,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:07,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035439952] [2022-12-05 23:23:07,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:07,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:08,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:08,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035439952] [2022-12-05 23:23:08,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035439952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:08,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:08,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:23:08,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547199278] [2022-12-05 23:23:08,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:08,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:23:08,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:08,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:23:08,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:23:08,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:23:08,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 87 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:08,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:08,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:23:08,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:08,510 INFO L130 PetriNetUnfolder]: 123/270 cut-off events. [2022-12-05 23:23:08,511 INFO L131 PetriNetUnfolder]: For 143/143 co-relation queries the response was YES. [2022-12-05 23:23:08,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 270 events. 123/270 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1108 event pairs, 20 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 212. Up to 119 conditions per place. [2022-12-05 23:23:08,512 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 47 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2022-12-05 23:23:08,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 56 transitions, 320 flow [2022-12-05 23:23:08,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:23:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:23:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-05 23:23:08,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-05 23:23:08,514 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 87 flow. Second operand 6 states and 48 transitions. [2022-12-05 23:23:08,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 56 transitions, 320 flow [2022-12-05 23:23:08,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 56 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:23:08,516 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 128 flow [2022-12-05 23:23:08,516 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2022-12-05 23:23:08,518 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2022-12-05 23:23:08,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:08,518 INFO L89 Accepts]: Start accepts. Operand has 36 places, 27 transitions, 128 flow [2022-12-05 23:23:08,519 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:08,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:08,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 27 transitions, 128 flow [2022-12-05 23:23:08,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 27 transitions, 128 flow [2022-12-05 23:23:08,528 INFO L130 PetriNetUnfolder]: 16/92 cut-off events. [2022-12-05 23:23:08,528 INFO L131 PetriNetUnfolder]: For 46/48 co-relation queries the response was YES. [2022-12-05 23:23:08,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 92 events. 16/92 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 373 event pairs, 10 based on Foata normal form. 2/92 useless extension candidates. Maximal degree in co-relation 86. Up to 30 conditions per place. [2022-12-05 23:23:08,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 27 transitions, 128 flow [2022-12-05 23:23:08,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-05 23:23:08,626 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:23:08,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-05 23:23:08,626 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 128 flow [2022-12-05 23:23:08,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:08,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:08,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:08,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:23:08,627 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-05 23:23:08,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:08,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1615110756, now seen corresponding path program 1 times [2022-12-05 23:23:08,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:08,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246584006] [2022-12-05 23:23:08,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:08,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:10,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:10,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246584006] [2022-12-05 23:23:10,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246584006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:10,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:10,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-05 23:23:10,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164328996] [2022-12-05 23:23:10,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:10,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-05 23:23:10,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:10,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-05 23:23:10,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-05 23:23:10,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:23:10,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 128 flow. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:10,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:10,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:23:10,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:10,964 INFO L130 PetriNetUnfolder]: 173/381 cut-off events. [2022-12-05 23:23:10,964 INFO L131 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2022-12-05 23:23:10,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 381 events. 173/381 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1695 event pairs, 38 based on Foata normal form. 1/381 useless extension candidates. Maximal degree in co-relation 338. Up to 241 conditions per place. [2022-12-05 23:23:10,966 INFO L137 encePairwiseOnDemand]: 5/20 looper letters, 52 selfloop transitions, 25 changer transitions 18/95 dead transitions. [2022-12-05 23:23:10,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 95 transitions, 647 flow [2022-12-05 23:23:10,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 23:23:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 23:23:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2022-12-05 23:23:10,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27 [2022-12-05 23:23:10,967 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 128 flow. Second operand 15 states and 81 transitions. [2022-12-05 23:23:10,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 95 transitions, 647 flow [2022-12-05 23:23:10,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 95 transitions, 618 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:23:10,970 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 400 flow [2022-12-05 23:23:10,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=400, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2022-12-05 23:23:10,970 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2022-12-05 23:23:10,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:10,970 INFO L89 Accepts]: Start accepts. Operand has 56 places, 53 transitions, 400 flow [2022-12-05 23:23:10,971 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:10,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:10,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 53 transitions, 400 flow [2022-12-05 23:23:10,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 53 transitions, 400 flow [2022-12-05 23:23:10,984 INFO L130 PetriNetUnfolder]: 32/157 cut-off events. [2022-12-05 23:23:10,984 INFO L131 PetriNetUnfolder]: For 210/213 co-relation queries the response was YES. [2022-12-05 23:23:10,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 157 events. 32/157 cut-off events. For 210/213 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 827 event pairs, 1 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 492. Up to 54 conditions per place. [2022-12-05 23:23:10,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 53 transitions, 400 flow [2022-12-05 23:23:10,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-05 23:23:10,994 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:10,994 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:10,996 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:10,996 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:10,997 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:10,998 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:10,999 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:10,999 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:11,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] 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 [584] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_146 24))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_32 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= (store |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 1)) |v_#memory_int_575|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 |v_my_callbackThread1of1ForFork0_#in~arg.offset_24|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~arg.base_32) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_24| v_my_callbackThread1of1ForFork0_~arg.base_32) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= v_my_callbackThread1of1ForFork0_~data~0.base_146 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= (select .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146) 0) (= |v_#memory_$Pointer$.base_514| (store |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.base_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0)))) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 v_my_callbackThread1of1ForFork0_~dev~0.offset_32) (= |v_#pthreadsMutex_180| (store |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146 1))) (= (store |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.offset_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0))) |v_#memory_$Pointer$.offset_514|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_181|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_515|, #memory_int=|v_#memory_int_576|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_515|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_180|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_514|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_32, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_36|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_146, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_146, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_32, #memory_int=|v_#memory_int_575|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_30, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_32, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_32, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_514|} AuxVars[] AssignedVars[#pthreadsMutex, #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_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-05 23:23:11,107 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] 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 [584] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_146 24))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_32 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= (store |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 1)) |v_#memory_int_575|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 |v_my_callbackThread1of1ForFork0_#in~arg.offset_24|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~arg.base_32) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_24| v_my_callbackThread1of1ForFork0_~arg.base_32) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= v_my_callbackThread1of1ForFork0_~data~0.base_146 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= (select .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146) 0) (= |v_#memory_$Pointer$.base_514| (store |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.base_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0)))) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 v_my_callbackThread1of1ForFork0_~dev~0.offset_32) (= |v_#pthreadsMutex_180| (store |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146 1))) (= (store |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.offset_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0))) |v_#memory_$Pointer$.offset_514|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_181|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_515|, #memory_int=|v_#memory_int_576|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_515|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_180|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_514|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_32, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_36|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_146, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_146, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_32, #memory_int=|v_#memory_int_575|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_30, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_32, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_32, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_514|} AuxVars[] AssignedVars[#pthreadsMutex, #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_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-05 23:23:11,286 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} 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_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] and [584] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_146 24))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_32 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= (store |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 1)) |v_#memory_int_575|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 |v_my_callbackThread1of1ForFork0_#in~arg.offset_24|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~arg.base_32) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_24| v_my_callbackThread1of1ForFork0_~arg.base_32) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= v_my_callbackThread1of1ForFork0_~data~0.base_146 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= (select .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146) 0) (= |v_#memory_$Pointer$.base_514| (store |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.base_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0)))) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 v_my_callbackThread1of1ForFork0_~dev~0.offset_32) (= |v_#pthreadsMutex_180| (store |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146 1))) (= (store |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.offset_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0))) |v_#memory_$Pointer$.offset_514|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_181|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_515|, #memory_int=|v_#memory_int_576|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_515|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_180|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_514|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_32, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_36|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_146, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_146, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_32, #memory_int=|v_#memory_int_575|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_30, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_32, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_32, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_514|} AuxVars[] AssignedVars[#pthreadsMutex, #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_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-05 23:23:11,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} 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_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] and [584] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_146 24))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_32 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= (store |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 1)) |v_#memory_int_575|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 |v_my_callbackThread1of1ForFork0_#in~arg.offset_24|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~arg.base_32) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_24| v_my_callbackThread1of1ForFork0_~arg.base_32) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= v_my_callbackThread1of1ForFork0_~data~0.base_146 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= (select .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146) 0) (= |v_#memory_$Pointer$.base_514| (store |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.base_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0)))) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 v_my_callbackThread1of1ForFork0_~dev~0.offset_32) (= |v_#pthreadsMutex_180| (store |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146 1))) (= (store |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.offset_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0))) |v_#memory_$Pointer$.offset_514|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_181|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_515|, #memory_int=|v_#memory_int_576|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_515|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_180|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_514|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_32, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_36|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_146, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_146, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_32, #memory_int=|v_#memory_int_575|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_30, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_32, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_32, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_514|} AuxVars[] AssignedVars[#pthreadsMutex, #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_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-05 23:23:14,072 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:23:14,073 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3103 [2022-12-05 23:23:14,073 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 416 flow [2022-12-05 23:23:14,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:14,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:14,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:14,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:23:14,073 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-05 23:23:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:14,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1669920330, now seen corresponding path program 1 times [2022-12-05 23:23:14,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:14,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392973062] [2022-12-05 23:23:14,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:14,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:14,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:14,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392973062] [2022-12-05 23:23:14,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392973062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:14,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:14,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:23:14,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064800887] [2022-12-05 23:23:14,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:14,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:23:14,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:14,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:23:14,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:23:14,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-05 23:23:14,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 416 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-05 23:23:14,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:14,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-05 23:23:14,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:14,426 INFO L130 PetriNetUnfolder]: 77/214 cut-off events. [2022-12-05 23:23:14,427 INFO L131 PetriNetUnfolder]: For 548/570 co-relation queries the response was YES. [2022-12-05 23:23:14,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 214 events. 77/214 cut-off events. For 548/570 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1009 event pairs, 22 based on Foata normal form. 14/216 useless extension candidates. Maximal degree in co-relation 843. Up to 125 conditions per place. [2022-12-05 23:23:14,428 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 40 selfloop transitions, 9 changer transitions 0/54 dead transitions. [2022-12-05 23:23:14,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 477 flow [2022-12-05 23:23:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:23:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:23:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-05 23:23:14,429 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36 [2022-12-05 23:23:14,429 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 416 flow. Second operand 5 states and 45 transitions. [2022-12-05 23:23:14,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 477 flow [2022-12-05 23:23:14,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 425 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-05 23:23:14,431 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 309 flow [2022-12-05 23:23:14,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=309, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2022-12-05 23:23:14,432 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2022-12-05 23:23:14,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:14,432 INFO L89 Accepts]: Start accepts. Operand has 51 places, 45 transitions, 309 flow [2022-12-05 23:23:14,432 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:14,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:14,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 309 flow [2022-12-05 23:23:14,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 45 transitions, 309 flow [2022-12-05 23:23:14,443 INFO L130 PetriNetUnfolder]: 23/128 cut-off events. [2022-12-05 23:23:14,443 INFO L131 PetriNetUnfolder]: For 219/221 co-relation queries the response was YES. [2022-12-05 23:23:14,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 128 events. 23/128 cut-off events. For 219/221 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 633 event pairs, 4 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 248. Up to 27 conditions per place. [2022-12-05 23:23:14,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 45 transitions, 309 flow [2022-12-05 23:23:14,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-05 23:23:14,449 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:23:14,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-05 23:23:14,449 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 309 flow [2022-12-05 23:23:14,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-05 23:23:14,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:14,450 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:14,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:23:14,450 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-05 23:23:14,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:14,450 INFO L85 PathProgramCache]: Analyzing trace with hash 477767222, now seen corresponding path program 1 times [2022-12-05 23:23:14,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:14,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808727966] [2022-12-05 23:23:14,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:14,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:15,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:15,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808727966] [2022-12-05 23:23:15,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808727966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:15,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:15,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 23:23:15,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898160672] [2022-12-05 23:23:15,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:15,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 23:23:15,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:15,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 23:23:15,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-05 23:23:15,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:23:15,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 309 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:15,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:15,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:23:15,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:16,539 INFO L130 PetriNetUnfolder]: 144/339 cut-off events. [2022-12-05 23:23:16,539 INFO L131 PetriNetUnfolder]: For 769/769 co-relation queries the response was YES. [2022-12-05 23:23:16,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 339 events. 144/339 cut-off events. For 769/769 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1549 event pairs, 75 based on Foata normal form. 1/339 useless extension candidates. Maximal degree in co-relation 782. Up to 282 conditions per place. [2022-12-05 23:23:16,541 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 44 selfloop transitions, 10 changer transitions 25/79 dead transitions. [2022-12-05 23:23:16,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 642 flow [2022-12-05 23:23:16,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 23:23:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 23:23:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-12-05 23:23:16,542 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21245421245421245 [2022-12-05 23:23:16,542 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 309 flow. Second operand 13 states and 58 transitions. [2022-12-05 23:23:16,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 642 flow [2022-12-05 23:23:16,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 627 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-05 23:23:16,545 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 359 flow [2022-12-05 23:23:16,545 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=359, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2022-12-05 23:23:16,545 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 29 predicate places. [2022-12-05 23:23:16,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:16,545 INFO L89 Accepts]: Start accepts. Operand has 68 places, 47 transitions, 359 flow [2022-12-05 23:23:16,546 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:16,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:16,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 47 transitions, 359 flow [2022-12-05 23:23:16,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 47 transitions, 359 flow [2022-12-05 23:23:16,558 INFO L130 PetriNetUnfolder]: 26/132 cut-off events. [2022-12-05 23:23:16,558 INFO L131 PetriNetUnfolder]: For 282/287 co-relation queries the response was YES. [2022-12-05 23:23:16,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 132 events. 26/132 cut-off events. For 282/287 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 645 event pairs, 4 based on Foata normal form. 2/132 useless extension candidates. Maximal degree in co-relation 460. Up to 27 conditions per place. [2022-12-05 23:23:16,559 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 47 transitions, 359 flow [2022-12-05 23:23:16,559 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 23:23:16,573 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:23:16,574 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-05 23:23:16,574 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 359 flow [2022-12-05 23:23:16,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:16,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:16,574 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:16,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:23:16,574 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-05 23:23:16,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:16,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1181307190, now seen corresponding path program 2 times [2022-12-05 23:23:16,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:16,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218766860] [2022-12-05 23:23:16,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:16,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:17,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:17,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218766860] [2022-12-05 23:23:17,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218766860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:17,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:17,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 23:23:17,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496413965] [2022-12-05 23:23:17,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:17,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 23:23:17,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:17,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 23:23:17,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-05 23:23:17,726 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:23:17,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 359 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:17,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:17,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:23:17,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:18,456 INFO L130 PetriNetUnfolder]: 154/358 cut-off events. [2022-12-05 23:23:18,456 INFO L131 PetriNetUnfolder]: For 1054/1054 co-relation queries the response was YES. [2022-12-05 23:23:18,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1552 conditions, 358 events. 154/358 cut-off events. For 1054/1054 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1662 event pairs, 79 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 1525. Up to 291 conditions per place. [2022-12-05 23:23:18,460 INFO L137 encePairwiseOnDemand]: 7/21 looper letters, 62 selfloop transitions, 25 changer transitions 0/87 dead transitions. [2022-12-05 23:23:18,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 766 flow [2022-12-05 23:23:18,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 23:23:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 23:23:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-12-05 23:23:18,461 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23443223443223443 [2022-12-05 23:23:18,461 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 359 flow. Second operand 13 states and 64 transitions. [2022-12-05 23:23:18,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 766 flow [2022-12-05 23:23:18,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 712 flow, removed 16 selfloop flow, removed 10 redundant places. [2022-12-05 23:23:18,465 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 534 flow [2022-12-05 23:23:18,465 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=534, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2022-12-05 23:23:18,466 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 32 predicate places. [2022-12-05 23:23:18,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:18,466 INFO L89 Accepts]: Start accepts. Operand has 71 places, 63 transitions, 534 flow [2022-12-05 23:23:18,466 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:18,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:18,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 63 transitions, 534 flow [2022-12-05 23:23:18,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 63 transitions, 534 flow [2022-12-05 23:23:18,495 INFO L130 PetriNetUnfolder]: 31/160 cut-off events. [2022-12-05 23:23:18,495 INFO L131 PetriNetUnfolder]: For 455/463 co-relation queries the response was YES. [2022-12-05 23:23:18,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 160 events. 31/160 cut-off events. For 455/463 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 854 event pairs, 4 based on Foata normal form. 2/160 useless extension candidates. Maximal degree in co-relation 583. Up to 37 conditions per place. [2022-12-05 23:23:18,496 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 63 transitions, 534 flow [2022-12-05 23:23:18,496 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-05 23:23:18,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, 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_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} 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 [379] 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-05 23:23:18,612 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, 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_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} 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 [378] 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] [2022-12-05 23:23:18,876 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:23:18,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 411 [2022-12-05 23:23:18,877 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 569 flow [2022-12-05 23:23:18,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:18,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:18,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:18,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:23:18,877 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-05 23:23:18,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:18,877 INFO L85 PathProgramCache]: Analyzing trace with hash -310924648, now seen corresponding path program 3 times [2022-12-05 23:23:18,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:18,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100598249] [2022-12-05 23:23:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:18,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:19,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:19,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100598249] [2022-12-05 23:23:19,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100598249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:19,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:19,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 23:23:19,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106471640] [2022-12-05 23:23:19,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:19,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 23:23:19,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:19,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 23:23:19,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-05 23:23:19,961 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:23:19,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 569 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:19,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:19,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:23:19,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:20,581 INFO L130 PetriNetUnfolder]: 175/418 cut-off events. [2022-12-05 23:23:20,581 INFO L131 PetriNetUnfolder]: For 1577/1577 co-relation queries the response was YES. [2022-12-05 23:23:20,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1921 conditions, 418 events. 175/418 cut-off events. For 1577/1577 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2129 event pairs, 76 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 1840. Up to 305 conditions per place. [2022-12-05 23:23:20,584 INFO L137 encePairwiseOnDemand]: 9/25 looper letters, 56 selfloop transitions, 24 changer transitions 25/105 dead transitions. [2022-12-05 23:23:20,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 105 transitions, 1047 flow [2022-12-05 23:23:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 23:23:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 23:23:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2022-12-05 23:23:20,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22666666666666666 [2022-12-05 23:23:20,585 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 569 flow. Second operand 12 states and 68 transitions. [2022-12-05 23:23:20,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 105 transitions, 1047 flow [2022-12-05 23:23:20,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 105 transitions, 1002 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-05 23:23:20,593 INFO L231 Difference]: Finished difference. Result has 86 places, 67 transitions, 646 flow [2022-12-05 23:23:20,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=646, PETRI_PLACES=86, PETRI_TRANSITIONS=67} [2022-12-05 23:23:20,594 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 47 predicate places. [2022-12-05 23:23:20,594 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:20,594 INFO L89 Accepts]: Start accepts. Operand has 86 places, 67 transitions, 646 flow [2022-12-05 23:23:20,595 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:20,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:20,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 67 transitions, 646 flow [2022-12-05 23:23:20,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 67 transitions, 646 flow [2022-12-05 23:23:20,612 INFO L130 PetriNetUnfolder]: 34/181 cut-off events. [2022-12-05 23:23:20,613 INFO L131 PetriNetUnfolder]: For 706/717 co-relation queries the response was YES. [2022-12-05 23:23:20,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 181 events. 34/181 cut-off events. For 706/717 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1038 event pairs, 4 based on Foata normal form. 5/183 useless extension candidates. Maximal degree in co-relation 741. Up to 42 conditions per place. [2022-12-05 23:23:20,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 67 transitions, 646 flow [2022-12-05 23:23:20,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-05 23:23:20,816 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:23:20,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-05 23:23:20,817 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 642 flow [2022-12-05 23:23:20,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:20,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:20,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:20,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:23:20,817 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:23:20,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash 165739536, now seen corresponding path program 1 times [2022-12-05 23:23:20,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:20,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569807803] [2022-12-05 23:23:20,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:20,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:21,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:21,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569807803] [2022-12-05 23:23:21,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569807803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:21,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:21,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 23:23:21,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152913466] [2022-12-05 23:23:21,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:21,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 23:23:21,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:21,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 23:23:21,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-05 23:23:21,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:23:21,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 642 flow. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-05 23:23:21,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:21,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:23:21,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:21,733 INFO L130 PetriNetUnfolder]: 166/416 cut-off events. [2022-12-05 23:23:21,733 INFO L131 PetriNetUnfolder]: For 2147/2147 co-relation queries the response was YES. [2022-12-05 23:23:21,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 416 events. 166/416 cut-off events. For 2147/2147 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2135 event pairs, 16 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 2070. Up to 149 conditions per place. [2022-12-05 23:23:21,736 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 66 selfloop transitions, 36 changer transitions 5/107 dead transitions. [2022-12-05 23:23:21,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 107 transitions, 1167 flow [2022-12-05 23:23:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 23:23:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 23:23:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2022-12-05 23:23:21,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24 [2022-12-05 23:23:21,737 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 642 flow. Second operand 11 states and 66 transitions. [2022-12-05 23:23:21,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 107 transitions, 1167 flow [2022-12-05 23:23:21,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 107 transitions, 1094 flow, removed 28 selfloop flow, removed 9 redundant places. [2022-12-05 23:23:21,743 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 727 flow [2022-12-05 23:23:21,743 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=727, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2022-12-05 23:23:21,744 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2022-12-05 23:23:21,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:21,744 INFO L89 Accepts]: Start accepts. Operand has 84 places, 70 transitions, 727 flow [2022-12-05 23:23:21,746 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:21,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:21,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 70 transitions, 727 flow [2022-12-05 23:23:21,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 70 transitions, 727 flow [2022-12-05 23:23:21,763 INFO L130 PetriNetUnfolder]: 38/195 cut-off events. [2022-12-05 23:23:21,763 INFO L131 PetriNetUnfolder]: For 882/897 co-relation queries the response was YES. [2022-12-05 23:23:21,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 195 events. 38/195 cut-off events. For 882/897 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1094 event pairs, 7 based on Foata normal form. 4/194 useless extension candidates. Maximal degree in co-relation 821. Up to 44 conditions per place. [2022-12-05 23:23:21,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 70 transitions, 727 flow [2022-12-05 23:23:21,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-05 23:23:21,772 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:21,773 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-05 23:23:21,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} 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_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] and [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} 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-05 23:23:21,959 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:23:21,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-05 23:23:21,960 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 747 flow [2022-12-05 23:23:21,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-05 23:23:21,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:21,960 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:21,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:23:21,960 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:23:21,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1397058242, now seen corresponding path program 4 times [2022-12-05 23:23:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:21,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747684548] [2022-12-05 23:23:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:21,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:23,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:23,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747684548] [2022-12-05 23:23:23,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747684548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:23,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:23,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 23:23:23,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633209272] [2022-12-05 23:23:23,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:23,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 23:23:23,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:23,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 23:23:23,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-05 23:23:23,085 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 23:23:23,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 747 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:23,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:23,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 23:23:23,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:23,610 INFO L130 PetriNetUnfolder]: 188/477 cut-off events. [2022-12-05 23:23:23,610 INFO L131 PetriNetUnfolder]: For 2514/2514 co-relation queries the response was YES. [2022-12-05 23:23:23,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2372 conditions, 477 events. 188/477 cut-off events. For 2514/2514 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2516 event pairs, 121 based on Foata normal form. 2/478 useless extension candidates. Maximal degree in co-relation 2327. Up to 410 conditions per place. [2022-12-05 23:23:23,613 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 57 selfloop transitions, 11 changer transitions 28/96 dead transitions. [2022-12-05 23:23:23,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 96 transitions, 1098 flow [2022-12-05 23:23:23,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 23:23:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 23:23:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-12-05 23:23:23,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21014492753623187 [2022-12-05 23:23:23,614 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 747 flow. Second operand 12 states and 58 transitions. [2022-12-05 23:23:23,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 96 transitions, 1098 flow [2022-12-05 23:23:23,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 96 transitions, 1018 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-12-05 23:23:23,620 INFO L231 Difference]: Finished difference. Result has 92 places, 65 transitions, 636 flow [2022-12-05 23:23:23,620 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=636, PETRI_PLACES=92, PETRI_TRANSITIONS=65} [2022-12-05 23:23:23,620 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 53 predicate places. [2022-12-05 23:23:23,621 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:23,621 INFO L89 Accepts]: Start accepts. Operand has 92 places, 65 transitions, 636 flow [2022-12-05 23:23:23,621 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:23,621 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:23,621 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 65 transitions, 636 flow [2022-12-05 23:23:23,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 65 transitions, 636 flow [2022-12-05 23:23:23,636 INFO L130 PetriNetUnfolder]: 26/161 cut-off events. [2022-12-05 23:23:23,636 INFO L131 PetriNetUnfolder]: For 709/714 co-relation queries the response was YES. [2022-12-05 23:23:23,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 161 events. 26/161 cut-off events. For 709/714 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 873 event pairs, 5 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 679. Up to 35 conditions per place. [2022-12-05 23:23:23,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 65 transitions, 636 flow [2022-12-05 23:23:23,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 23:23:23,645 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:23,645 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:23,646 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:23,647 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:23,813 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:23:23,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-05 23:23:23,814 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 630 flow [2022-12-05 23:23:23,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:23,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:23,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:23,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:23:23,815 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:23:23,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:23,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1593881406, now seen corresponding path program 1 times [2022-12-05 23:23:23,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:23,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998739088] [2022-12-05 23:23:23,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:23,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:24,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:24,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998739088] [2022-12-05 23:23:24,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998739088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:24,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:24,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 23:23:24,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230823063] [2022-12-05 23:23:24,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:24,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 23:23:24,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:24,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 23:23:24,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-05 23:23:24,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 23:23:24,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 630 flow. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:24,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:24,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 23:23:24,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:25,180 INFO L130 PetriNetUnfolder]: 153/383 cut-off events. [2022-12-05 23:23:25,180 INFO L131 PetriNetUnfolder]: For 1961/1961 co-relation queries the response was YES. [2022-12-05 23:23:25,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 383 events. 153/383 cut-off events. For 1961/1961 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1881 event pairs, 90 based on Foata normal form. 1/383 useless extension candidates. Maximal degree in co-relation 1912. Up to 319 conditions per place. [2022-12-05 23:23:25,183 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 60 selfloop transitions, 20 changer transitions 10/90 dead transitions. [2022-12-05 23:23:25,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 1002 flow [2022-12-05 23:23:25,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 23:23:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 23:23:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-12-05 23:23:25,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21014492753623187 [2022-12-05 23:23:25,185 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 630 flow. Second operand 12 states and 58 transitions. [2022-12-05 23:23:25,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 1002 flow [2022-12-05 23:23:25,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 90 transitions, 932 flow, removed 23 selfloop flow, removed 11 redundant places. [2022-12-05 23:23:25,190 INFO L231 Difference]: Finished difference. Result has 88 places, 68 transitions, 664 flow [2022-12-05 23:23:25,191 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=664, PETRI_PLACES=88, PETRI_TRANSITIONS=68} [2022-12-05 23:23:25,191 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2022-12-05 23:23:25,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:25,191 INFO L89 Accepts]: Start accepts. Operand has 88 places, 68 transitions, 664 flow [2022-12-05 23:23:25,192 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:25,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:25,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 68 transitions, 664 flow [2022-12-05 23:23:25,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 68 transitions, 664 flow [2022-12-05 23:23:25,208 INFO L130 PetriNetUnfolder]: 27/170 cut-off events. [2022-12-05 23:23:25,208 INFO L131 PetriNetUnfolder]: For 684/691 co-relation queries the response was YES. [2022-12-05 23:23:25,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 170 events. 27/170 cut-off events. For 684/691 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 932 event pairs, 5 based on Foata normal form. 4/172 useless extension candidates. Maximal degree in co-relation 691. Up to 36 conditions per place. [2022-12-05 23:23:25,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 68 transitions, 664 flow [2022-12-05 23:23:25,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-05 23:23:25,213 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:25,214 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-05 23:23:25,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, 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_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} 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 [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} 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-05 23:23:25,698 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [461] L1735-1-->L1735-3: Formula: (and (= (store |v_#memory_$Pointer$.base_67| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17| (store (select |v_#memory_$Pointer$.base_67| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_14|)) |v_#memory_$Pointer$.base_66|) (= (store |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_14|)) |v_#memory_$Pointer$.offset_66|) (= |v_#memory_int_90| (store |v_#memory_int_91| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17| (store (select |v_#memory_int_91| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15| (select (select |v_#memory_int_90| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_14|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_67|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_14|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|, #memory_int=|v_#memory_int_91|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_67|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_10|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_14|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_66|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_14|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|, #memory_int=|v_#memory_int_90|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_66|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] and [558] L1712-1-->my_callbackEXIT: Formula: (and (= |v_my_callbackThread1of1ForFork0_#res.base_13| 0) (= |v_#pthreadsMutex_121| (store |v_#pthreadsMutex_122| v_my_callbackThread1of1ForFork0_~data~0.base_71 (store (select |v_#pthreadsMutex_122| v_my_callbackThread1of1ForFork0_~data~0.base_71) v_my_callbackThread1of1ForFork0_~data~0.offset_71 0))) (= |v_my_callbackThread1of1ForFork0_#res.offset_13| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_71, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_71} OutVars{#pthreadsMutex=|v_#pthreadsMutex_121|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_71, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_13|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_25|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_13|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_71} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] [2022-12-05 23:23:26,150 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 23:23:26,151 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 960 [2022-12-05 23:23:26,151 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 692 flow [2022-12-05 23:23:26,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:26,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:26,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:26,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 23:23:26,152 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-05 23:23:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:26,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1333595062, now seen corresponding path program 1 times [2022-12-05 23:23:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:26,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315012677] [2022-12-05 23:23:26,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:26,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:26,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:26,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315012677] [2022-12-05 23:23:26,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315012677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:26,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:26,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-05 23:23:26,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715903322] [2022-12-05 23:23:26,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:26,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 23:23:26,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:26,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 23:23:26,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-05 23:23:26,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:23:26,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 692 flow. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:26,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:26,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:23:26,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:27,152 INFO L130 PetriNetUnfolder]: 133/343 cut-off events. [2022-12-05 23:23:27,153 INFO L131 PetriNetUnfolder]: For 1766/1766 co-relation queries the response was YES. [2022-12-05 23:23:27,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 343 events. 133/343 cut-off events. For 1766/1766 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1649 event pairs, 87 based on Foata normal form. 1/343 useless extension candidates. Maximal degree in co-relation 1746. Up to 301 conditions per place. [2022-12-05 23:23:27,155 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 50 selfloop transitions, 12 changer transitions 11/73 dead transitions. [2022-12-05 23:23:27,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 73 transitions, 861 flow [2022-12-05 23:23:27,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 23:23:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 23:23:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2022-12-05 23:23:27,156 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1934156378600823 [2022-12-05 23:23:27,156 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 692 flow. Second operand 9 states and 47 transitions. [2022-12-05 23:23:27,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 73 transitions, 861 flow [2022-12-05 23:23:27,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 73 transitions, 807 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-12-05 23:23:27,161 INFO L231 Difference]: Finished difference. Result has 87 places, 57 transitions, 535 flow [2022-12-05 23:23:27,161 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=535, PETRI_PLACES=87, PETRI_TRANSITIONS=57} [2022-12-05 23:23:27,161 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 48 predicate places. [2022-12-05 23:23:27,161 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:27,162 INFO L89 Accepts]: Start accepts. Operand has 87 places, 57 transitions, 535 flow [2022-12-05 23:23:27,162 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:27,162 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:27,162 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 57 transitions, 535 flow [2022-12-05 23:23:27,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 57 transitions, 535 flow [2022-12-05 23:23:27,175 INFO L130 PetriNetUnfolder]: 22/142 cut-off events. [2022-12-05 23:23:27,175 INFO L131 PetriNetUnfolder]: For 529/534 co-relation queries the response was YES. [2022-12-05 23:23:27,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 142 events. 22/142 cut-off events. For 529/534 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 711 event pairs, 5 based on Foata normal form. 2/142 useless extension candidates. Maximal degree in co-relation 573. Up to 29 conditions per place. [2022-12-05 23:23:27,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 57 transitions, 535 flow [2022-12-05 23:23:27,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 23:23:27,176 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, 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_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} 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 [604] L1711-1-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_243 28))) (and (= |v_my_callbackThread1of1ForFork0_#res.base_33| 0) (= (store |v_#pthreadsMutex_253| v_my_callbackThread1of1ForFork0_~data~0.base_243 (store (select |v_#pthreadsMutex_253| v_my_callbackThread1of1ForFork0_~data~0.base_243) v_my_callbackThread1of1ForFork0_~data~0.offset_243 0)) |v_#pthreadsMutex_252|) (= (store |v_#memory_$Pointer$.offset_831| v_my_callbackThread1of1ForFork0_~data~0.base_243 (store (select |v_#memory_$Pointer$.offset_831| v_my_callbackThread1of1ForFork0_~data~0.base_243) .cse0 (select (select |v_#memory_$Pointer$.offset_830| v_my_callbackThread1of1ForFork0_~data~0.base_243) .cse0))) |v_#memory_$Pointer$.offset_830|) (= (store |v_#memory_$Pointer$.base_831| v_my_callbackThread1of1ForFork0_~data~0.base_243 (store (select |v_#memory_$Pointer$.base_831| v_my_callbackThread1of1ForFork0_~data~0.base_243) .cse0 (select (select |v_#memory_$Pointer$.base_830| v_my_callbackThread1of1ForFork0_~data~0.base_243) .cse0))) |v_#memory_$Pointer$.base_830|) (= |v_my_callbackThread1of1ForFork0_#res.offset_33| 0) (= |v_#memory_int_897| (store |v_#memory_int_898| v_my_callbackThread1of1ForFork0_~data~0.base_243 (let ((.cse1 (select |v_#memory_int_898| v_my_callbackThread1of1ForFork0_~data~0.base_243))) (store .cse1 .cse0 (+ (select .cse1 .cse0) 1))))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_253|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_243, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_831|, #memory_int=|v_#memory_int_898|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_243, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_831|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_252|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_243, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_33|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_159|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_830|, #memory_int=|v_#memory_int_897|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_33|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_243, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_830|} 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-05 23:23:27,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [584] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_146 24))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_32 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= (store |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 1)) |v_#memory_int_575|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 |v_my_callbackThread1of1ForFork0_#in~arg.offset_24|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~arg.base_32) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_24| v_my_callbackThread1of1ForFork0_~arg.base_32) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= v_my_callbackThread1of1ForFork0_~data~0.base_146 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= (select .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146) 0) (= |v_#memory_$Pointer$.base_514| (store |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.base_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0)))) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 v_my_callbackThread1of1ForFork0_~dev~0.offset_32) (= |v_#pthreadsMutex_180| (store |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146 1))) (= (store |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.offset_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0))) |v_#memory_$Pointer$.offset_514|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_181|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_515|, #memory_int=|v_#memory_int_576|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_515|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_180|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_514|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_32, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_36|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_146, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_146, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_32, #memory_int=|v_#memory_int_575|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_30, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_32, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_32, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_514|} AuxVars[] AssignedVars[#pthreadsMutex, #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_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] and [606] L1727-4-->my_callbackEXIT: Formula: (let ((.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_247 28))) (and (= (select |v_#valid_329| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_188|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_167| 0) (= (store |v_#memory_int_906| v_my_callbackThread1of1ForFork0_~data~0.base_247 (let ((.cse0 (select |v_#memory_int_906| v_my_callbackThread1of1ForFork0_~data~0.base_247))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)))) |v_#memory_int_905|) (= |v_my_callbackThread1of1ForFork0_#res.base_37| 0) (= (store |v_#memory_$Pointer$.base_845| v_my_callbackThread1of1ForFork0_~data~0.base_247 (store (select |v_#memory_$Pointer$.base_845| v_my_callbackThread1of1ForFork0_~data~0.base_247) .cse1 (select (select |v_#memory_$Pointer$.base_844| v_my_callbackThread1of1ForFork0_~data~0.base_247) .cse1))) |v_#memory_$Pointer$.base_844|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_81| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_83|) (= (store |v_#length_230| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_188| 4) |v_#length_229|) (= (store |v_#memory_$Pointer$.offset_845| v_my_callbackThread1of1ForFork0_~data~0.base_247 (store (select |v_#memory_$Pointer$.offset_845| v_my_callbackThread1of1ForFork0_~data~0.base_247) .cse1 (select (select |v_#memory_$Pointer$.offset_844| v_my_callbackThread1of1ForFork0_~data~0.base_247) .cse1))) |v_#memory_$Pointer$.offset_844|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_115| 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_164| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_116| (select (select |v_#memory_int_906| |v_~#t1~0.base_113|) |v_~#t1~0.offset_113|)) (= |v_my_callbackThread1of1ForFork0_#res.offset_37| 0) (= (store |v_#pthreadsMutex_263| v_my_callbackThread1of1ForFork0_~data~0.base_247 (store (select |v_#pthreadsMutex_263| v_my_callbackThread1of1ForFork0_~data~0.base_247) v_my_callbackThread1of1ForFork0_~data~0.offset_247 0)) |v_#pthreadsMutex_262|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_81| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_83|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_313| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_81|) (= (store |v_#valid_329| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_188| 1) |v_#valid_328|) (< |v_#StackHeapBarrier_110| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_188|) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_188| 0)) (= |v_ULTIMATE.start_main_~#data~1#1.base_313| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_81|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_263|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_845|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_313|, ~#t1~0.offset=|v_~#t1~0.offset_113|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_247, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_247, #StackHeapBarrier=|v_#StackHeapBarrier_110|, ~#t1~0.base=|v_~#t1~0.base_113|, #valid=|v_#valid_329|, #memory_int=|v_#memory_int_906|, #length=|v_#length_230|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_845|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_313|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_116|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_844|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_188|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_132|, ~#t1~0.offset=|v_~#t1~0.offset_113|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_247, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_83|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_137|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_247, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_115|, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_37|, ~#t1~0.base=|v_~#t1~0.base_113|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_150|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_137|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_164|, #length=|v_#length_229|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_97|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_81|, #pthreadsMutex=|v_#pthreadsMutex_262|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_167|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_83|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_137|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_313|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_131|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_167|, #StackHeapBarrier=|v_#StackHeapBarrier_110|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_81|, #valid=|v_#valid_328|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_132|, #memory_int=|v_#memory_int_905|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_844|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_313|} 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, 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, 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-05 23:23:28,585 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:28,585 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-05 23:23:28,590 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [608] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse6 (select |v_#memory_int_926| v_my_callbackThread1of1ForFork0_~data~0.base_251)) (.cse2 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_251 24))) (let ((.cse0 (select |v_#memory_$Pointer$.offset_864| v_my_callbackThread1of1ForFork0_~data~0.base_251)) (.cse3 (select |v_#memory_$Pointer$.base_864| v_my_callbackThread1of1ForFork0_~data~0.base_251)) (.cse4 (select |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_251)) (.cse5 (store .cse6 .cse2 1)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_251 28))) (and (= |v_ULTIMATE.start_main_~probe_ret~0#1_166| 0) (= |v_ULTIMATE.start_main_~#data~1#1.base_317| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_83|) (= (store |v_#memory_$Pointer$.offset_864| v_my_callbackThread1of1ForFork0_~data~0.base_251 (store .cse0 .cse1 (select (select |v_#memory_$Pointer$.offset_863| v_my_callbackThread1of1ForFork0_~data~0.base_251) .cse1))) |v_#memory_$Pointer$.offset_863|) (= (store |v_#memory_$Pointer$.offset_865| v_my_callbackThread1of1ForFork0_~data~0.base_251 (store (select |v_#memory_$Pointer$.offset_865| v_my_callbackThread1of1ForFork0_~data~0.base_251) .cse2 (select .cse0 .cse2))) |v_#memory_$Pointer$.offset_864|) (= (store |v_#memory_$Pointer$.base_864| v_my_callbackThread1of1ForFork0_~data~0.base_251 (store .cse3 .cse1 (select (select |v_#memory_$Pointer$.base_863| v_my_callbackThread1of1ForFork0_~data~0.base_251) .cse1))) |v_#memory_$Pointer$.base_863|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_83| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_85|) (= (store |v_#length_234| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_190| 4) |v_#length_233|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_169| 0) (= v_my_callbackThread1of1ForFork0_~dev~0.base_54 v_my_callbackThread1of1ForFork0_~arg.base_54) (= (store |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_251 (store .cse4 v_my_callbackThread1of1ForFork0_~data~0.offset_251 0)) |v_#pthreadsMutex_272|) (= (store |v_#memory_$Pointer$.base_865| v_my_callbackThread1of1ForFork0_~data~0.base_251 (store (select |v_#memory_$Pointer$.base_865| v_my_callbackThread1of1ForFork0_~data~0.base_251) .cse2 (select .cse3 .cse2))) |v_#memory_$Pointer$.base_864|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_117| 0) (= v_my_callbackThread1of1ForFork0_~data~0.base_251 v_my_callbackThread1of1ForFork0_~__mptr~0.base_52) (= (select |v_#valid_335| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_190|) 0) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_76| v_my_callbackThread1of1ForFork0_~arg.base_54) (= .cse2 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_52) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_83| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_85|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_54 v_my_callbackThread1of1ForFork0_~__mptr~0.base_52) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_54 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_52) (= |v_my_callbackThread1of1ForFork0_#res.base_41| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_41| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_190| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_118| (select (select (store |v_#memory_int_926| v_my_callbackThread1of1ForFork0_~data~0.base_251 .cse5) |v_~#t1~0.base_115|) |v_~#t1~0.offset_115|)) (= v_my_callbackThread1of1ForFork0_~arg.offset_54 v_my_callbackThread1of1ForFork0_~dev~0.offset_54) (= (select .cse4 v_my_callbackThread1of1ForFork0_~data~0.offset_251) 0) (= |v_#valid_334| (store |v_#valid_335| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_190| 1)) (= (store |v_#memory_int_926| v_my_callbackThread1of1ForFork0_~data~0.base_251 (store .cse5 .cse1 (+ (select .cse6 .cse1) 1))) |v_#memory_int_924|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_317| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_83|) (= v_my_callbackThread1of1ForFork0_~arg.offset_54 |v_my_callbackThread1of1ForFork0_#in~arg.offset_76|) (< |v_#StackHeapBarrier_112| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_190|)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_274|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_865|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_317|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_76|, ~#t1~0.offset=|v_~#t1~0.offset_115|, #StackHeapBarrier=|v_#StackHeapBarrier_112|, ~#t1~0.base=|v_~#t1~0.base_115|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_76|, #valid=|v_#valid_335|, #memory_int=|v_#memory_int_926|, #length=|v_#length_234|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_865|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_317|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_118|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_863|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_190|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_134|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_76|, ~#t1~0.offset=|v_~#t1~0.offset_115|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_58|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_52, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_251, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_85|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_142|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_251, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_117|, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_41|, ~#t1~0.base=|v_~#t1~0.base_115|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_152|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_139|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_166|, #length=|v_#length_233|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_99|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_41|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_83|, #pthreadsMutex=|v_#pthreadsMutex_272|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_171|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_85|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_139|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_54, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_317|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_133|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_169|, #StackHeapBarrier=|v_#StackHeapBarrier_112|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_76|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_83|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_54, #valid=|v_#valid_334|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_134|, #memory_int=|v_#memory_int_924|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_52, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_54, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_54, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_863|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_317|} AuxVars[|v_#memory_$Pointer$.offset_864|, |v_#memory_$Pointer$.base_864|] 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, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] and [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} 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-05 23:23:32,000 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:23:32,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4840 [2022-12-05 23:23:32,001 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 57 transitions, 565 flow [2022-12-05 23:23:32,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:32,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:32,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:32,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 23:23:32,001 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:23:32,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2049383554, now seen corresponding path program 1 times [2022-12-05 23:23:32,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:32,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738844873] [2022-12-05 23:23:32,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:32,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:32,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:32,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738844873] [2022-12-05 23:23:32,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738844873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:32,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:32,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-05 23:23:32,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585253752] [2022-12-05 23:23:32,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:32,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 23:23:32,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:32,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 23:23:32,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-05 23:23:32,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 23:23:32,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 57 transitions, 565 flow. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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-05 23:23:32,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:32,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 23:23:32,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:33,097 INFO L130 PetriNetUnfolder]: 128/324 cut-off events. [2022-12-05 23:23:33,097 INFO L131 PetriNetUnfolder]: For 1515/1515 co-relation queries the response was YES. [2022-12-05 23:23:33,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1620 conditions, 324 events. 128/324 cut-off events. For 1515/1515 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1491 event pairs, 89 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 1583. Up to 296 conditions per place. [2022-12-05 23:23:33,100 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 50 selfloop transitions, 10 changer transitions 6/66 dead transitions. [2022-12-05 23:23:33,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 66 transitions, 726 flow [2022-12-05 23:23:33,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 23:23:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 23:23:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2022-12-05 23:23:33,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20772946859903382 [2022-12-05 23:23:33,102 INFO L175 Difference]: Start difference. First operand has 81 places, 57 transitions, 565 flow. Second operand 9 states and 43 transitions. [2022-12-05 23:23:33,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 66 transitions, 726 flow [2022-12-05 23:23:33,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 66 transitions, 654 flow, removed 17 selfloop flow, removed 16 redundant places. [2022-12-05 23:23:33,108 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 465 flow [2022-12-05 23:23:33,108 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=465, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2022-12-05 23:23:33,109 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 36 predicate places. [2022-12-05 23:23:33,109 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:33,109 INFO L89 Accepts]: Start accepts. Operand has 75 places, 55 transitions, 465 flow [2022-12-05 23:23:33,110 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:33,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:33,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 55 transitions, 465 flow [2022-12-05 23:23:33,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 55 transitions, 465 flow [2022-12-05 23:23:33,122 INFO L130 PetriNetUnfolder]: 20/136 cut-off events. [2022-12-05 23:23:33,122 INFO L131 PetriNetUnfolder]: For 397/402 co-relation queries the response was YES. [2022-12-05 23:23:33,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 136 events. 20/136 cut-off events. For 397/402 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 671 event pairs, 5 based on Foata normal form. 2/136 useless extension candidates. Maximal degree in co-relation 498. Up to 27 conditions per place. [2022-12-05 23:23:33,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 55 transitions, 465 flow [2022-12-05 23:23:33,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-05 23:23:33,124 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:23:33,124 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-05 23:23:33,124 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 465 flow [2022-12-05 23:23:33,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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-05 23:23:33,124 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:33,124 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:33,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 23:23:33,125 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-05 23:23:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:33,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1174998908, now seen corresponding path program 5 times [2022-12-05 23:23:33,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:33,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485259250] [2022-12-05 23:23:33,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:33,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:34,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:34,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485259250] [2022-12-05 23:23:34,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485259250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:34,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:34,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 23:23:34,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637660155] [2022-12-05 23:23:34,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:34,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 23:23:34,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:34,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 23:23:34,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-05 23:23:34,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:23:34,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 465 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:34,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:34,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:23:34,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:34,669 INFO L130 PetriNetUnfolder]: 143/367 cut-off events. [2022-12-05 23:23:34,670 INFO L131 PetriNetUnfolder]: For 1312/1312 co-relation queries the response was YES. [2022-12-05 23:23:34,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1650 conditions, 367 events. 143/367 cut-off events. For 1312/1312 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1799 event pairs, 84 based on Foata normal form. 2/368 useless extension candidates. Maximal degree in co-relation 1619. Up to 249 conditions per place. [2022-12-05 23:23:34,672 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 52 selfloop transitions, 21 changer transitions 19/92 dead transitions. [2022-12-05 23:23:34,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 878 flow [2022-12-05 23:23:34,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 23:23:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 23:23:34,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-12-05 23:23:34,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2490842490842491 [2022-12-05 23:23:34,673 INFO L175 Difference]: Start difference. First operand has 73 places, 55 transitions, 465 flow. Second operand 13 states and 68 transitions. [2022-12-05 23:23:34,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 878 flow [2022-12-05 23:23:34,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 92 transitions, 850 flow, removed 4 selfloop flow, removed 8 redundant places. [2022-12-05 23:23:34,692 INFO L231 Difference]: Finished difference. Result has 82 places, 58 transitions, 535 flow [2022-12-05 23:23:34,693 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=535, PETRI_PLACES=82, PETRI_TRANSITIONS=58} [2022-12-05 23:23:34,693 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 43 predicate places. [2022-12-05 23:23:34,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:34,693 INFO L89 Accepts]: Start accepts. Operand has 82 places, 58 transitions, 535 flow [2022-12-05 23:23:34,694 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:34,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:34,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 58 transitions, 535 flow [2022-12-05 23:23:34,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 58 transitions, 535 flow [2022-12-05 23:23:34,706 INFO L130 PetriNetUnfolder]: 20/139 cut-off events. [2022-12-05 23:23:34,706 INFO L131 PetriNetUnfolder]: For 443/448 co-relation queries the response was YES. [2022-12-05 23:23:34,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 139 events. 20/139 cut-off events. For 443/448 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 687 event pairs, 5 based on Foata normal form. 2/139 useless extension candidates. Maximal degree in co-relation 530. Up to 28 conditions per place. [2022-12-05 23:23:34,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 58 transitions, 535 flow [2022-12-05 23:23:34,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-05 23:23:34,887 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:23:34,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-05 23:23:34,887 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 58 transitions, 535 flow [2022-12-05 23:23:34,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:34,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:34,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:34,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 23:23:34,888 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:23:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:34,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1706511762, now seen corresponding path program 6 times [2022-12-05 23:23:34,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:34,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042515987] [2022-12-05 23:23:34,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:34,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:35,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:35,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042515987] [2022-12-05 23:23:35,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042515987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:35,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:35,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 23:23:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091109956] [2022-12-05 23:23:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:35,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 23:23:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:35,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 23:23:35,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-05 23:23:35,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:23:35,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 58 transitions, 535 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:35,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:35,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:23:35,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:36,543 INFO L130 PetriNetUnfolder]: 141/367 cut-off events. [2022-12-05 23:23:36,543 INFO L131 PetriNetUnfolder]: For 1642/1642 co-relation queries the response was YES. [2022-12-05 23:23:36,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1803 conditions, 367 events. 141/367 cut-off events. For 1642/1642 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1797 event pairs, 49 based on Foata normal form. 2/368 useless extension candidates. Maximal degree in co-relation 1765. Up to 292 conditions per place. [2022-12-05 23:23:36,546 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 61 selfloop transitions, 17 changer transitions 26/104 dead transitions. [2022-12-05 23:23:36,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 104 transitions, 1079 flow [2022-12-05 23:23:36,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 23:23:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 23:23:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-12-05 23:23:36,548 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24175824175824176 [2022-12-05 23:23:36,548 INFO L175 Difference]: Start difference. First operand has 78 places, 58 transitions, 535 flow. Second operand 13 states and 66 transitions. [2022-12-05 23:23:36,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 104 transitions, 1079 flow [2022-12-05 23:23:36,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 995 flow, removed 27 selfloop flow, removed 9 redundant places. [2022-12-05 23:23:36,553 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 676 flow [2022-12-05 23:23:36,553 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=676, PETRI_PLACES=89, PETRI_TRANSITIONS=71} [2022-12-05 23:23:36,553 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 50 predicate places. [2022-12-05 23:23:36,554 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:36,554 INFO L89 Accepts]: Start accepts. Operand has 89 places, 71 transitions, 676 flow [2022-12-05 23:23:36,554 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:36,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:36,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 71 transitions, 676 flow [2022-12-05 23:23:36,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 71 transitions, 676 flow [2022-12-05 23:23:36,568 INFO L130 PetriNetUnfolder]: 26/155 cut-off events. [2022-12-05 23:23:36,568 INFO L131 PetriNetUnfolder]: For 601/607 co-relation queries the response was YES. [2022-12-05 23:23:36,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 155 events. 26/155 cut-off events. For 601/607 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 809 event pairs, 1 based on Foata normal form. 3/156 useless extension candidates. Maximal degree in co-relation 646. Up to 33 conditions per place. [2022-12-05 23:23:36,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 71 transitions, 676 flow [2022-12-05 23:23:36,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-05 23:23:36,576 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:36,578 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-05 23:23:36,585 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, 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_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} 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 [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} 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-05 23:23:36,801 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:36,802 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:36,803 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:36,804 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:36,804 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} 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_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] and [379] 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-05 23:23:37,014 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:23:37,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 460 [2022-12-05 23:23:37,015 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 699 flow [2022-12-05 23:23:37,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:37,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:37,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:37,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 23:23:37,018 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-05 23:23:37,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1970522316, now seen corresponding path program 7 times [2022-12-05 23:23:37,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:37,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040879925] [2022-12-05 23:23:37,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:37,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:38,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-05 23:23:38,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:38,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040879925] [2022-12-05 23:23:38,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040879925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:38,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:38,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 23:23:38,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771236864] [2022-12-05 23:23:38,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:38,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 23:23:38,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:38,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 23:23:38,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-05 23:23:38,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 23:23:38,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 699 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:38,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:38,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 23:23:38,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:38,826 INFO L130 PetriNetUnfolder]: 157/411 cut-off events. [2022-12-05 23:23:38,827 INFO L131 PetriNetUnfolder]: For 1935/1935 co-relation queries the response was YES. [2022-12-05 23:23:38,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 411 events. 157/411 cut-off events. For 1935/1935 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2098 event pairs, 41 based on Foata normal form. 2/412 useless extension candidates. Maximal degree in co-relation 2015. Up to 318 conditions per place. [2022-12-05 23:23:38,829 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 62 selfloop transitions, 21 changer transitions 33/116 dead transitions. [2022-12-05 23:23:38,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 116 transitions, 1276 flow [2022-12-05 23:23:38,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 23:23:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 23:23:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 72 transitions. [2022-12-05 23:23:38,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2022-12-05 23:23:38,830 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 699 flow. Second operand 13 states and 72 transitions. [2022-12-05 23:23:38,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 116 transitions, 1276 flow [2022-12-05 23:23:38,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 116 transitions, 1178 flow, removed 48 selfloop flow, removed 6 redundant places. [2022-12-05 23:23:38,836 INFO L231 Difference]: Finished difference. Result has 97 places, 77 transitions, 792 flow [2022-12-05 23:23:38,836 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=792, PETRI_PLACES=97, PETRI_TRANSITIONS=77} [2022-12-05 23:23:38,837 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 58 predicate places. [2022-12-05 23:23:38,837 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:38,837 INFO L89 Accepts]: Start accepts. Operand has 97 places, 77 transitions, 792 flow [2022-12-05 23:23:38,837 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:38,837 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:38,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 77 transitions, 792 flow [2022-12-05 23:23:38,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 77 transitions, 792 flow [2022-12-05 23:23:38,852 INFO L130 PetriNetUnfolder]: 28/154 cut-off events. [2022-12-05 23:23:38,852 INFO L131 PetriNetUnfolder]: For 736/743 co-relation queries the response was YES. [2022-12-05 23:23:38,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 154 events. 28/154 cut-off events. For 736/743 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 782 event pairs, 0 based on Foata normal form. 2/154 useless extension candidates. Maximal degree in co-relation 687. Up to 32 conditions per place. [2022-12-05 23:23:38,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 77 transitions, 792 flow [2022-12-05 23:23:38,853 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-05 23:23:38,859 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:23:38,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-05 23:23:38,860 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 792 flow [2022-12-05 23:23:38,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:38,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:38,860 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:38,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-05 23:23:38,860 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-05 23:23:38,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:38,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1132574368, now seen corresponding path program 8 times [2022-12-05 23:23:38,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:38,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074500555] [2022-12-05 23:23:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:39,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:39,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074500555] [2022-12-05 23:23:39,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074500555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:39,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:39,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 23:23:39,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414987596] [2022-12-05 23:23:39,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:39,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 23:23:39,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:39,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 23:23:39,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-05 23:23:39,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 23:23:39,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 77 transitions, 792 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:39,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:39,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 23:23:39,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:40,546 INFO L130 PetriNetUnfolder]: 134/353 cut-off events. [2022-12-05 23:23:40,546 INFO L131 PetriNetUnfolder]: For 1933/1933 co-relation queries the response was YES. [2022-12-05 23:23:40,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1857 conditions, 353 events. 134/353 cut-off events. For 1933/1933 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1717 event pairs, 38 based on Foata normal form. 2/354 useless extension candidates. Maximal degree in co-relation 1812. Up to 271 conditions per place. [2022-12-05 23:23:40,550 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 61 selfloop transitions, 21 changer transitions 25/107 dead transitions. [2022-12-05 23:23:40,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 107 transitions, 1187 flow [2022-12-05 23:23:40,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 23:23:40,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 23:23:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-12-05 23:23:40,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22742474916387959 [2022-12-05 23:23:40,565 INFO L175 Difference]: Start difference. First operand has 90 places, 77 transitions, 792 flow. Second operand 13 states and 68 transitions. [2022-12-05 23:23:40,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 107 transitions, 1187 flow [2022-12-05 23:23:40,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 107 transitions, 1118 flow, removed 32 selfloop flow, removed 7 redundant places. [2022-12-05 23:23:40,572 INFO L231 Difference]: Finished difference. Result has 100 places, 75 transitions, 777 flow [2022-12-05 23:23:40,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=777, PETRI_PLACES=100, PETRI_TRANSITIONS=75} [2022-12-05 23:23:40,573 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 61 predicate places. [2022-12-05 23:23:40,573 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:40,573 INFO L89 Accepts]: Start accepts. Operand has 100 places, 75 transitions, 777 flow [2022-12-05 23:23:40,574 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:40,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:40,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 75 transitions, 777 flow [2022-12-05 23:23:40,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 75 transitions, 777 flow [2022-12-05 23:23:40,594 INFO L130 PetriNetUnfolder]: 27/155 cut-off events. [2022-12-05 23:23:40,594 INFO L131 PetriNetUnfolder]: For 701/707 co-relation queries the response was YES. [2022-12-05 23:23:40,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 155 events. 27/155 cut-off events. For 701/707 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 790 event pairs, 0 based on Foata normal form. 3/156 useless extension candidates. Maximal degree in co-relation 683. Up to 32 conditions per place. [2022-12-05 23:23:40,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 75 transitions, 777 flow [2022-12-05 23:23:40,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-05 23:23:40,600 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:40,600 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:40,602 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:40,603 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:40,604 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, 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_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} 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 [379] 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-05 23:23:40,753 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, 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_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} 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 [525] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_51 28))) (and (= |v_#memory_$Pointer$.base_115| (store |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 (select (select |v_#memory_$Pointer$.base_115| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0)))) (= (store |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_22| 1))) |v_#memory_int_158|) (= (store |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 (select (select |v_#memory_$Pointer$.offset_115| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0))) |v_#memory_$Pointer$.offset_115|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_22|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_51, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_51, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_116|, #memory_int=|v_#memory_int_159|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_116|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_51, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_51, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_115|, #memory_int=|v_#memory_int_158|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_115|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-05 23:23:40,895 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:23:40,896 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 323 [2022-12-05 23:23:40,896 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 74 transitions, 783 flow [2022-12-05 23:23:40,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:40,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:40,896 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:40,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-05 23:23:40,897 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-05 23:23:40,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:40,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1660657234, now seen corresponding path program 9 times [2022-12-05 23:23:40,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:40,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052628174] [2022-12-05 23:23:40,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:40,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:41,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:41,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052628174] [2022-12-05 23:23:41,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052628174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:41,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:41,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 23:23:41,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573441911] [2022-12-05 23:23:41,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:41,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 23:23:41,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:41,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 23:23:41,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-05 23:23:41,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:23:41,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 74 transitions, 783 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:41,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:41,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:23:41,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:42,388 INFO L130 PetriNetUnfolder]: 116/303 cut-off events. [2022-12-05 23:23:42,389 INFO L131 PetriNetUnfolder]: For 1869/1869 co-relation queries the response was YES. [2022-12-05 23:23:42,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 303 events. 116/303 cut-off events. For 1869/1869 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1388 event pairs, 21 based on Foata normal form. 2/304 useless extension candidates. Maximal degree in co-relation 1616. Up to 213 conditions per place. [2022-12-05 23:23:42,391 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 58 selfloop transitions, 22 changer transitions 21/101 dead transitions. [2022-12-05 23:23:42,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 1149 flow [2022-12-05 23:23:42,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 23:23:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 23:23:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-12-05 23:23:42,392 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23 [2022-12-05 23:23:42,392 INFO L175 Difference]: Start difference. First operand has 93 places, 74 transitions, 783 flow. Second operand 12 states and 69 transitions. [2022-12-05 23:23:42,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 1149 flow [2022-12-05 23:23:42,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 101 transitions, 1067 flow, removed 23 selfloop flow, removed 10 redundant places. [2022-12-05 23:23:42,398 INFO L231 Difference]: Finished difference. Result has 99 places, 71 transitions, 754 flow [2022-12-05 23:23:42,398 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=754, PETRI_PLACES=99, PETRI_TRANSITIONS=71} [2022-12-05 23:23:42,398 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 60 predicate places. [2022-12-05 23:23:42,398 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:42,398 INFO L89 Accepts]: Start accepts. Operand has 99 places, 71 transitions, 754 flow [2022-12-05 23:23:42,399 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:42,399 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:42,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 71 transitions, 754 flow [2022-12-05 23:23:42,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 71 transitions, 754 flow [2022-12-05 23:23:42,412 INFO L130 PetriNetUnfolder]: 24/135 cut-off events. [2022-12-05 23:23:42,412 INFO L131 PetriNetUnfolder]: For 641/645 co-relation queries the response was YES. [2022-12-05 23:23:42,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 135 events. 24/135 cut-off events. For 641/645 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 632 event pairs, 0 based on Foata normal form. 3/136 useless extension candidates. Maximal degree in co-relation 592. Up to 27 conditions per place. [2022-12-05 23:23:42,413 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 71 transitions, 754 flow [2022-12-05 23:23:42,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-05 23:23:42,431 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:23:42,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-05 23:23:42,434 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 71 transitions, 754 flow [2022-12-05 23:23:42,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:42,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:42,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:42,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-05 23:23:42,434 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-05 23:23:42,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:42,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1773173564, now seen corresponding path program 10 times [2022-12-05 23:23:42,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:42,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363448291] [2022-12-05 23:23:42,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:42,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:43,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:43,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363448291] [2022-12-05 23:23:43,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363448291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:43,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:43,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 23:23:43,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101630677] [2022-12-05 23:23:43,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:43,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 23:23:43,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:43,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 23:23:43,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-05 23:23:43,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:23:43,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 71 transitions, 754 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:43,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:43,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:23:43,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:43,883 INFO L130 PetriNetUnfolder]: 104/271 cut-off events. [2022-12-05 23:23:43,883 INFO L131 PetriNetUnfolder]: For 1748/1748 co-relation queries the response was YES. [2022-12-05 23:23:43,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 271 events. 104/271 cut-off events. For 1748/1748 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1190 event pairs, 45 based on Foata normal form. 1/271 useless extension candidates. Maximal degree in co-relation 1387. Up to 219 conditions per place. [2022-12-05 23:23:43,885 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 58 selfloop transitions, 16 changer transitions 17/91 dead transitions. [2022-12-05 23:23:43,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 91 transitions, 1054 flow [2022-12-05 23:23:43,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 23:23:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 23:23:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-12-05 23:23:43,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1657142857142857 [2022-12-05 23:23:43,886 INFO L175 Difference]: Start difference. First operand has 94 places, 71 transitions, 754 flow. Second operand 14 states and 58 transitions. [2022-12-05 23:23:43,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 91 transitions, 1054 flow [2022-12-05 23:23:43,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 91 transitions, 976 flow, removed 16 selfloop flow, removed 10 redundant places. [2022-12-05 23:23:43,892 INFO L231 Difference]: Finished difference. Result has 102 places, 67 transitions, 681 flow [2022-12-05 23:23:43,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=681, PETRI_PLACES=102, PETRI_TRANSITIONS=67} [2022-12-05 23:23:43,892 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 63 predicate places. [2022-12-05 23:23:43,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:43,892 INFO L89 Accepts]: Start accepts. Operand has 102 places, 67 transitions, 681 flow [2022-12-05 23:23:43,893 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:43,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:43,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 67 transitions, 681 flow [2022-12-05 23:23:43,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 67 transitions, 681 flow [2022-12-05 23:23:43,905 INFO L130 PetriNetUnfolder]: 24/129 cut-off events. [2022-12-05 23:23:43,905 INFO L131 PetriNetUnfolder]: For 648/653 co-relation queries the response was YES. [2022-12-05 23:23:43,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 129 events. 24/129 cut-off events. For 648/653 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 600 event pairs, 1 based on Foata normal form. 4/131 useless extension candidates. Maximal degree in co-relation 591. Up to 26 conditions per place. [2022-12-05 23:23:43,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 67 transitions, 681 flow [2022-12-05 23:23:43,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 23:23:43,916 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:43,917 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-05 23:23:43,921 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, 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_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} 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 [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} 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-05 23:23:44,090 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, 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_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} 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 [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} 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-05 23:23:46,412 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:23:46,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2521 [2022-12-05 23:23:46,413 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 69 transitions, 710 flow [2022-12-05 23:23:46,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:46,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:46,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:46,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-05 23:23:46,414 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-05 23:23:46,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:46,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1635805550, now seen corresponding path program 11 times [2022-12-05 23:23:46,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:46,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574133406] [2022-12-05 23:23:46,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:47,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:47,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574133406] [2022-12-05 23:23:47,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574133406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:47,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:47,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 23:23:47,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553924260] [2022-12-05 23:23:47,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:47,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 23:23:47,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:47,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 23:23:47,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-05 23:23:47,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:23:47,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 69 transitions, 710 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:47,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:47,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:23:47,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:47,873 INFO L130 PetriNetUnfolder]: 101/267 cut-off events. [2022-12-05 23:23:47,873 INFO L131 PetriNetUnfolder]: For 1759/1759 co-relation queries the response was YES. [2022-12-05 23:23:47,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 267 events. 101/267 cut-off events. For 1759/1759 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1165 event pairs, 52 based on Foata normal form. 1/267 useless extension candidates. Maximal degree in co-relation 1427. Up to 237 conditions per place. [2022-12-05 23:23:47,876 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 47 selfloop transitions, 8 changer transitions 22/77 dead transitions. [2022-12-05 23:23:47,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 77 transitions, 872 flow [2022-12-05 23:23:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 23:23:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 23:23:47,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-12-05 23:23:47,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14814814814814814 [2022-12-05 23:23:47,877 INFO L175 Difference]: Start difference. First operand has 95 places, 69 transitions, 710 flow. Second operand 12 states and 48 transitions. [2022-12-05 23:23:47,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 77 transitions, 872 flow [2022-12-05 23:23:47,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 77 transitions, 826 flow, removed 7 selfloop flow, removed 11 redundant places. [2022-12-05 23:23:47,890 INFO L231 Difference]: Finished difference. Result has 98 places, 55 transitions, 544 flow [2022-12-05 23:23:47,891 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=544, PETRI_PLACES=98, PETRI_TRANSITIONS=55} [2022-12-05 23:23:47,891 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 59 predicate places. [2022-12-05 23:23:47,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:47,891 INFO L89 Accepts]: Start accepts. Operand has 98 places, 55 transitions, 544 flow [2022-12-05 23:23:47,892 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:47,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:47,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 55 transitions, 544 flow [2022-12-05 23:23:47,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 55 transitions, 544 flow [2022-12-05 23:23:47,911 INFO L130 PetriNetUnfolder]: 19/109 cut-off events. [2022-12-05 23:23:47,912 INFO L131 PetriNetUnfolder]: For 532/536 co-relation queries the response was YES. [2022-12-05 23:23:47,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 109 events. 19/109 cut-off events. For 532/536 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 441 event pairs, 1 based on Foata normal form. 4/111 useless extension candidates. Maximal degree in co-relation 496. Up to 24 conditions per place. [2022-12-05 23:23:47,913 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 55 transitions, 544 flow [2022-12-05 23:23:47,913 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-05 23:23:50,092 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:23:50,093 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2202 [2022-12-05 23:23:50,094 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 55 transitions, 544 flow [2022-12-05 23:23:50,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:50,094 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:50,094 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:50,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-05 23:23:50,094 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:23:50,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:50,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1951498684, now seen corresponding path program 12 times [2022-12-05 23:23:50,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:50,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755194397] [2022-12-05 23:23:50,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:50,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:51,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:51,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755194397] [2022-12-05 23:23:51,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755194397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:51,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:51,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 23:23:51,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537016510] [2022-12-05 23:23:51,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:51,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 23:23:51,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:51,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 23:23:51,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-05 23:23:51,101 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:23:51,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 55 transitions, 544 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:51,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:51,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:23:51,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:51,641 INFO L130 PetriNetUnfolder]: 83/220 cut-off events. [2022-12-05 23:23:51,641 INFO L131 PetriNetUnfolder]: For 1513/1513 co-relation queries the response was YES. [2022-12-05 23:23:51,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 220 events. 83/220 cut-off events. For 1513/1513 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 867 event pairs, 37 based on Foata normal form. 1/220 useless extension candidates. Maximal degree in co-relation 1212. Up to 177 conditions per place. [2022-12-05 23:23:51,643 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 39 selfloop transitions, 8 changer transitions 24/71 dead transitions. [2022-12-05 23:23:51,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 71 transitions, 792 flow [2022-12-05 23:23:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 23:23:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 23:23:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2022-12-05 23:23:51,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14857142857142858 [2022-12-05 23:23:51,645 INFO L175 Difference]: Start difference. First operand has 83 places, 55 transitions, 544 flow. Second operand 14 states and 52 transitions. [2022-12-05 23:23:51,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 71 transitions, 792 flow [2022-12-05 23:23:51,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 71 transitions, 727 flow, removed 22 selfloop flow, removed 13 redundant places. [2022-12-05 23:23:51,649 INFO L231 Difference]: Finished difference. Result has 88 places, 45 transitions, 440 flow [2022-12-05 23:23:51,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=440, PETRI_PLACES=88, PETRI_TRANSITIONS=45} [2022-12-05 23:23:51,650 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2022-12-05 23:23:51,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:51,650 INFO L89 Accepts]: Start accepts. Operand has 88 places, 45 transitions, 440 flow [2022-12-05 23:23:51,651 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:51,652 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:51,652 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 45 transitions, 440 flow [2022-12-05 23:23:51,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 45 transitions, 440 flow [2022-12-05 23:23:51,662 INFO L130 PetriNetUnfolder]: 17/93 cut-off events. [2022-12-05 23:23:51,662 INFO L131 PetriNetUnfolder]: For 512/513 co-relation queries the response was YES. [2022-12-05 23:23:51,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 93 events. 17/93 cut-off events. For 512/513 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 0 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 422. Up to 20 conditions per place. [2022-12-05 23:23:51,663 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 45 transitions, 440 flow [2022-12-05 23:23:51,663 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-05 23:23:51,666 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:51,666 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:51,667 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:51,667 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:51,787 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:51,787 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:51,788 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:51,789 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:52,003 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:52,005 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:52,006 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:52,010 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:52,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} 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_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] and [379] 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-05 23:23:52,203 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:23:52,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 554 [2022-12-05 23:23:52,204 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 42 transitions, 434 flow [2022-12-05 23:23:52,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:52,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:52,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:52,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-05 23:23:52,208 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:23:52,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:52,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1898120713, now seen corresponding path program 1 times [2022-12-05 23:23:52,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:52,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167949266] [2022-12-05 23:23:52,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:52,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:52,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:52,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167949266] [2022-12-05 23:23:52,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167949266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:52,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:52,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:23:52,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516441647] [2022-12-05 23:23:52,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:52,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:23:52,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:52,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:23:52,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:23:52,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-05 23:23:52,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 42 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:52,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:52,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-05 23:23:52,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:52,551 INFO L130 PetriNetUnfolder]: 8/55 cut-off events. [2022-12-05 23:23:52,551 INFO L131 PetriNetUnfolder]: For 633/633 co-relation queries the response was YES. [2022-12-05 23:23:52,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 55 events. 8/55 cut-off events. For 633/633 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 106 event pairs, 2 based on Foata normal form. 8/61 useless extension candidates. Maximal degree in co-relation 292. Up to 37 conditions per place. [2022-12-05 23:23:52,552 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 26 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2022-12-05 23:23:52,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 33 transitions, 350 flow [2022-12-05 23:23:52,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:23:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:23:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-05 23:23:52,553 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2518518518518518 [2022-12-05 23:23:52,553 INFO L175 Difference]: Start difference. First operand has 72 places, 42 transitions, 434 flow. Second operand 5 states and 34 transitions. [2022-12-05 23:23:52,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 33 transitions, 350 flow [2022-12-05 23:23:52,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 33 transitions, 236 flow, removed 30 selfloop flow, removed 28 redundant places. [2022-12-05 23:23:52,555 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 170 flow [2022-12-05 23:23:52,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2022-12-05 23:23:52,555 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2022-12-05 23:23:52,555 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:52,555 INFO L89 Accepts]: Start accepts. Operand has 47 places, 29 transitions, 170 flow [2022-12-05 23:23:52,556 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:52,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:52,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 29 transitions, 170 flow [2022-12-05 23:23:52,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 29 transitions, 170 flow [2022-12-05 23:23:52,560 INFO L130 PetriNetUnfolder]: 2/47 cut-off events. [2022-12-05 23:23:52,561 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-12-05 23:23:52,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 47 events. 2/47 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 1 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 87. Up to 8 conditions per place. [2022-12-05 23:23:52,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 29 transitions, 170 flow [2022-12-05 23:23:52,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-05 23:23:53,503 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 23:23:53,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 949 [2022-12-05 23:23:53,504 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 25 transitions, 176 flow [2022-12-05 23:23:53,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:53,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:53,504 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:53,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-05 23:23:53,505 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:23:53,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2068620348, now seen corresponding path program 1 times [2022-12-05 23:23:53,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:53,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033952320] [2022-12-05 23:23:53,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:53,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:54,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:54,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033952320] [2022-12-05 23:23:54,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033952320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:54,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:54,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-05 23:23:54,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571251417] [2022-12-05 23:23:54,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:54,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 23:23:54,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:54,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 23:23:54,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-05 23:23:54,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 23:23:54,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 25 transitions, 176 flow. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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-05 23:23:54,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:54,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 23:23:54,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:54,489 INFO L130 PetriNetUnfolder]: 5/43 cut-off events. [2022-12-05 23:23:54,489 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-12-05 23:23:54,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 43 events. 5/43 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 2 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 118. Up to 23 conditions per place. [2022-12-05 23:23:54,490 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 16 selfloop transitions, 5 changer transitions 12/33 dead transitions. [2022-12-05 23:23:54,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 33 transitions, 288 flow [2022-12-05 23:23:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 23:23:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 23:23:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-12-05 23:23:54,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13043478260869565 [2022-12-05 23:23:54,491 INFO L175 Difference]: Start difference. First operand has 43 places, 25 transitions, 176 flow. Second operand 11 states and 33 transitions. [2022-12-05 23:23:54,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 33 transitions, 288 flow [2022-12-05 23:23:54,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 33 transitions, 254 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-05 23:23:54,492 INFO L231 Difference]: Finished difference. Result has 50 places, 21 transitions, 135 flow [2022-12-05 23:23:54,492 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=135, PETRI_PLACES=50, PETRI_TRANSITIONS=21} [2022-12-05 23:23:54,492 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2022-12-05 23:23:54,492 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:54,492 INFO L89 Accepts]: Start accepts. Operand has 50 places, 21 transitions, 135 flow [2022-12-05 23:23:54,493 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:54,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:54,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 21 transitions, 135 flow [2022-12-05 23:23:54,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 21 transitions, 135 flow [2022-12-05 23:23:54,496 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-05 23:23:54,496 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-05 23:23:54,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 25 events. 0/25 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-12-05 23:23:54,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 21 transitions, 135 flow [2022-12-05 23:23:54,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-05 23:23:54,497 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:23:54,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-05 23:23:54,498 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 21 transitions, 135 flow [2022-12-05 23:23:54,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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-05 23:23:54,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:54,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:54,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-05 23:23:54,498 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-05 23:23:54,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:54,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1339825243, now seen corresponding path program 1 times [2022-12-05 23:23:54,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:54,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367173894] [2022-12-05 23:23:54,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:54,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:55,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:55,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367173894] [2022-12-05 23:23:55,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367173894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:55,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:55,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 23:23:55,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610825538] [2022-12-05 23:23:55,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:55,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 23:23:55,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:55,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 23:23:55,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-05 23:23:55,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-05 23:23:55,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 21 transitions, 135 flow. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:55,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:55,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-05 23:23:55,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:55,731 INFO L130 PetriNetUnfolder]: 1/33 cut-off events. [2022-12-05 23:23:55,732 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2022-12-05 23:23:55,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 33 events. 1/33 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 128. Up to 14 conditions per place. [2022-12-05 23:23:55,732 INFO L137 encePairwiseOnDemand]: 6/19 looper letters, 11 selfloop transitions, 12 changer transitions 5/28 dead transitions. [2022-12-05 23:23:55,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 28 transitions, 226 flow [2022-12-05 23:23:55,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 23:23:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 23:23:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2022-12-05 23:23:55,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1339712918660287 [2022-12-05 23:23:55,733 INFO L175 Difference]: Start difference. First operand has 42 places, 21 transitions, 135 flow. Second operand 11 states and 28 transitions. [2022-12-05 23:23:55,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 28 transitions, 226 flow [2022-12-05 23:23:55,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 28 transitions, 178 flow, removed 12 selfloop flow, removed 13 redundant places. [2022-12-05 23:23:55,733 INFO L231 Difference]: Finished difference. Result has 42 places, 23 transitions, 143 flow [2022-12-05 23:23:55,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=143, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2022-12-05 23:23:55,734 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2022-12-05 23:23:55,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:55,734 INFO L89 Accepts]: Start accepts. Operand has 42 places, 23 transitions, 143 flow [2022-12-05 23:23:55,734 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:55,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:55,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 23 transitions, 143 flow [2022-12-05 23:23:55,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 23 transitions, 143 flow [2022-12-05 23:23:55,739 INFO L130 PetriNetUnfolder]: 1/28 cut-off events. [2022-12-05 23:23:55,739 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-05 23:23:55,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 28 events. 1/28 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 83. Up to 6 conditions per place. [2022-12-05 23:23:55,739 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 23 transitions, 143 flow [2022-12-05 23:23:55,739 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:23:55,748 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:55,749 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-05 23:23:55,754 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, 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_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} 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 [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} 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-05 23:23:55,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L1712-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_376 28))) (and (= |v_my_callbackThread1of1ForFork0_#res.offset_45| 0) (= (store |v_#pthreadsMutex_345| v_my_callbackThread1of1ForFork0_~data~0.base_376 (store (select |v_#pthreadsMutex_345| v_my_callbackThread1of1ForFork0_~data~0.base_376) v_my_callbackThread1of1ForFork0_~data~0.offset_376 0)) |v_#pthreadsMutex_344|) (= (store |v_#memory_$Pointer$.base_1233| v_my_callbackThread1of1ForFork0_~data~0.base_376 (store (select |v_#memory_$Pointer$.base_1233| v_my_callbackThread1of1ForFork0_~data~0.base_376) .cse0 (select (select |v_#memory_$Pointer$.base_1232| v_my_callbackThread1of1ForFork0_~data~0.base_376) .cse0))) |v_#memory_$Pointer$.base_1232|) (= (store |v_#memory_int_1308| v_my_callbackThread1of1ForFork0_~data~0.base_376 (store (select |v_#memory_int_1308| v_my_callbackThread1of1ForFork0_~data~0.base_376) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_278| 1))) |v_#memory_int_1307|) (= |v_my_callbackThread1of1ForFork0_#res.base_45| 0) (= (store |v_#memory_$Pointer$.offset_1233| v_my_callbackThread1of1ForFork0_~data~0.base_376 (store (select |v_#memory_$Pointer$.offset_1233| v_my_callbackThread1of1ForFork0_~data~0.base_376) .cse0 (select (select |v_#memory_$Pointer$.offset_1232| v_my_callbackThread1of1ForFork0_~data~0.base_376) .cse0))) |v_#memory_$Pointer$.offset_1232|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_345|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_376, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_278|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1233|, #memory_int=|v_#memory_int_1308|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_376, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1233|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_344|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_376, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_45|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1232|, #memory_int=|v_#memory_int_1307|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_45|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_376, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1232|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} 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_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] [2022-12-05 23:23:56,051 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] L1712-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_378 28))) (and (= (store |v_#memory_$Pointer$.offset_1237| v_my_callbackThread1of1ForFork0_~data~0.base_378 (store (select |v_#memory_$Pointer$.offset_1237| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse0 (select (select |v_#memory_$Pointer$.offset_1236| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse0))) |v_#memory_$Pointer$.offset_1236|) (= (store |v_#pthreadsMutex_349| v_my_callbackThread1of1ForFork0_~data~0.base_378 (store (select |v_#pthreadsMutex_349| v_my_callbackThread1of1ForFork0_~data~0.base_378) v_my_callbackThread1of1ForFork0_~data~0.offset_378 0)) |v_#pthreadsMutex_348|) (= |v_my_callbackThread1of1ForFork0_#res.base_47| 0) (= |v_#memory_$Pointer$.base_1236| (store |v_#memory_$Pointer$.base_1237| v_my_callbackThread1of1ForFork0_~data~0.base_378 (store (select |v_#memory_$Pointer$.base_1237| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse0 (select (select |v_#memory_$Pointer$.base_1236| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse0)))) (= |v_#memory_int_1311| (store |v_#memory_int_1312| v_my_callbackThread1of1ForFork0_~data~0.base_378 (store (select |v_#memory_int_1312| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_282| 1)))) (= |v_my_callbackThread1of1ForFork0_#res.offset_47| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_349|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_378, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_282|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1237|, #memory_int=|v_#memory_int_1312|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_378, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1237|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_348|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_378, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_47|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1236|, #memory_int=|v_#memory_int_1311|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_47|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_378, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1236|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} 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_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] [2022-12-05 23:23:56,458 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:56,461 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:56,462 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:56,463 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:56,463 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, 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_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} 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 [622] L1712-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_419 28))) (and (= (store |v_#memory_$Pointer$.base_1187| v_my_callbackThread1of1ForFork1_~data~0.base_402 (store (select |v_#memory_$Pointer$.base_1187| v_my_callbackThread1of1ForFork1_~data~0.base_402) .cse0 (select (select |v_#memory_$Pointer$.base_1186| v_my_callbackThread1of1ForFork1_~data~0.base_402) .cse0))) |v_#memory_$Pointer$.base_1186|) (= (store |v_#memory_$Pointer$.offset_1187| v_my_callbackThread1of1ForFork1_~data~0.base_402 (store (select |v_#memory_$Pointer$.offset_1187| v_my_callbackThread1of1ForFork1_~data~0.base_402) .cse0 (select (select |v_#memory_$Pointer$.offset_1186| v_my_callbackThread1of1ForFork1_~data~0.base_402) .cse0))) |v_#memory_$Pointer$.offset_1186|) (= |v_#memory_int_1261| (store |v_#memory_int_1262| v_my_callbackThread1of1ForFork1_~data~0.base_402 (store (select |v_#memory_int_1262| v_my_callbackThread1of1ForFork1_~data~0.base_402) .cse0 (+ 1 |v_my_callbackThread1of1ForFork1_#t~mem32_249|)))) (= |v_my_callbackThread1of1ForFork1_#res.offset_18| 0) (= (store |v_#pthreadsMutex_313| v_my_callbackThread1of1ForFork1_~data~0.base_402 (store (select |v_#pthreadsMutex_313| v_my_callbackThread1of1ForFork1_~data~0.base_402) v_my_callbackThread1of1ForFork1_~data~0.offset_419 0)) |v_#pthreadsMutex_312|) (= |v_my_callbackThread1of1ForFork1_#res.base_18| 0))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_249|, #pthreadsMutex=|v_#pthreadsMutex_313|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_419, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_402, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1187|, #memory_int=|v_#memory_int_1262|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1187|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_312|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_419, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_18|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_402, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1186|, #memory_int=|v_#memory_int_1261|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1186|} 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-05 23:23:56,614 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:56,616 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:56,617 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:56,617 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:56,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [621] L1710-1-->L1712: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_413 24))) (and (= (store |v_#memory_$Pointer$.base_1177| v_my_callbackThread1of1ForFork1_~data~0.base_397 (store (select |v_#memory_$Pointer$.base_1177| v_my_callbackThread1of1ForFork1_~data~0.base_397) .cse0 (select (select |v_#memory_$Pointer$.base_1176| v_my_callbackThread1of1ForFork1_~data~0.base_397) .cse0))) |v_#memory_$Pointer$.base_1176|) (= (select (select |v_#memory_int_1250| v_my_callbackThread1of1ForFork1_~data~0.base_397) (+ v_my_callbackThread1of1ForFork1_~data~0.offset_413 28)) |v_my_callbackThread1of1ForFork1_#t~mem32_240|) (= (store |v_#memory_int_1251| v_my_callbackThread1of1ForFork1_~data~0.base_397 (store (select |v_#memory_int_1251| v_my_callbackThread1of1ForFork1_~data~0.base_397) .cse0 1)) |v_#memory_int_1250|) (= (store |v_#memory_$Pointer$.offset_1177| v_my_callbackThread1of1ForFork1_~data~0.base_397 (store (select |v_#memory_$Pointer$.offset_1177| v_my_callbackThread1of1ForFork1_~data~0.base_397) .cse0 (select (select |v_#memory_$Pointer$.offset_1176| v_my_callbackThread1of1ForFork1_~data~0.base_397) .cse0))) |v_#memory_$Pointer$.offset_1176|))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_413, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_397, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1177|, #memory_int=|v_#memory_int_1251|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1177|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_240|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_413, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_397, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1176|, #memory_int=|v_#memory_int_1250|, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_146|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1176|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#t~nondet31, #memory_$Pointer$.offset] and [637] L1727-4-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_445 28))) (and (= |v_#pthreadsMutex_372| (store |v_#pthreadsMutex_373| v_my_callbackThread1of1ForFork1_~data~0.base_425 (store (select |v_#pthreadsMutex_373| v_my_callbackThread1of1ForFork1_~data~0.base_425) v_my_callbackThread1of1ForFork1_~data~0.offset_445 0))) (= (store |v_#memory_$Pointer$.base_1276| v_my_callbackThread1of1ForFork1_~data~0.base_425 (store (select |v_#memory_$Pointer$.base_1276| v_my_callbackThread1of1ForFork1_~data~0.base_425) .cse0 (select (select |v_#memory_$Pointer$.base_1275| v_my_callbackThread1of1ForFork1_~data~0.base_425) .cse0))) |v_#memory_$Pointer$.base_1275|) (= (select |v_#valid_539| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304|) 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_447| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_147|) (= (store |v_#memory_$Pointer$.offset_1276| v_my_callbackThread1of1ForFork1_~data~0.base_425 (store (select |v_#memory_$Pointer$.offset_1276| v_my_callbackThread1of1ForFork1_~data~0.base_425) .cse0 (select (select |v_#memory_$Pointer$.offset_1275| v_my_callbackThread1of1ForFork1_~data~0.base_425) .cse0))) |v_#memory_$Pointer$.offset_1275|) (= (store |v_#valid_539| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304| 1) |v_#valid_538|) (= |v_ULTIMATE.start_main_~#data~1#1.base_447| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_147|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_268| 0) (< |v_#StackHeapBarrier_176| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_181| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304| 0)) (= |v_my_callbackThread1of1ForFork1_#res.base_31| 0) (= |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_149| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_147|) (= |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_149| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_147|) (= |v_my_callbackThread1of1ForFork1_#res.offset_31| 0) (= (store |v_#length_362| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304| 4) |v_#length_361|) (= |v_#memory_int_1346| (store |v_#memory_int_1347| v_my_callbackThread1of1ForFork1_~data~0.base_425 (store (select |v_#memory_int_1347| v_my_callbackThread1of1ForFork1_~data~0.base_425) .cse0 (+ 1 |v_my_callbackThread1of1ForFork1_#t~mem32_279|)))) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_207| (select (select |v_#memory_int_1347| |v_~#t1~0.base_191|) |v_~#t1~0.offset_179|)) (= |v_ULTIMATE.start_main_~probe_ret~0#1_230| 0))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_279|, #pthreadsMutex=|v_#pthreadsMutex_373|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1276|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_447|, ~#t1~0.offset=|v_~#t1~0.offset_179|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_445, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_425, #StackHeapBarrier=|v_#StackHeapBarrier_176|, ~#t1~0.base=|v_~#t1~0.base_191|, #valid=|v_#valid_539|, #memory_int=|v_#memory_int_1347|, #length=|v_#length_362|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1276|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_447|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_207|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1275|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_208|, ~#t1~0.offset=|v_~#t1~0.offset_179|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_149|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_212|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_445, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_31|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_181|, ~#t1~0.base=|v_~#t1~0.base_191|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_216|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_238|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_230|, #length=|v_#length_361|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_163|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_31|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_147|, #pthreadsMutex=|v_#pthreadsMutex_372|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_149|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_238|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_447|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_217|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_425, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_268|, #StackHeapBarrier=|v_#StackHeapBarrier_176|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_147|, #valid=|v_#valid_538|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_208|, #memory_int=|v_#memory_int_1346|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1275|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_447|} 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-05 23:23:56,960 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 23:23:56,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1226 [2022-12-05 23:23:56,960 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 150 flow [2022-12-05 23:23:56,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:56,961 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:56,961 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:56,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-05 23:23:56,961 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:23:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:56,961 INFO L85 PathProgramCache]: Analyzing trace with hash -417587994, now seen corresponding path program 1 times [2022-12-05 23:23:56,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:56,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769659950] [2022-12-05 23:23:56,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:56,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:23:57,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:57,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769659950] [2022-12-05 23:23:57,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769659950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:57,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:57,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 23:23:57,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130353331] [2022-12-05 23:23:57,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:57,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 23:23:57,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:57,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 23:23:57,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-05 23:23:57,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:23:57,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 21 transitions, 150 flow. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-05 23:23:57,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:57,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:23:57,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:57,801 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-05 23:23:57,801 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-05 23:23:57,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 22 events. 0/22 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 26 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-05 23:23:57,802 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 7 selfloop transitions, 6 changer transitions 8/21 dead transitions. [2022-12-05 23:23:57,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 21 transitions, 176 flow [2022-12-05 23:23:57,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 23:23:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 23:23:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-12-05 23:23:57,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1375 [2022-12-05 23:23:57,803 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 150 flow. Second operand 8 states and 22 transitions. [2022-12-05 23:23:57,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 21 transitions, 176 flow [2022-12-05 23:23:57,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 21 transitions, 136 flow, removed 4 selfloop flow, removed 10 redundant places. [2022-12-05 23:23:57,803 INFO L231 Difference]: Finished difference. Result has 35 places, 13 transitions, 69 flow [2022-12-05 23:23:57,803 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=69, PETRI_PLACES=35, PETRI_TRANSITIONS=13} [2022-12-05 23:23:57,804 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2022-12-05 23:23:57,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:57,804 INFO L89 Accepts]: Start accepts. Operand has 35 places, 13 transitions, 69 flow [2022-12-05 23:23:57,804 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:57,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:57,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 13 transitions, 69 flow [2022-12-05 23:23:57,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 13 transitions, 69 flow [2022-12-05 23:23:57,807 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-05 23:23:57,807 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-05 23:23:57,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 13 events. 0/13 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 1 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-05 23:23:57,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 13 transitions, 69 flow [2022-12-05 23:23:57,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:23:57,821 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:57,825 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-05 23:23:57,826 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:57,827 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:57,828 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:57,829 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:57,829 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:57,830 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:59,553 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:59,553 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:59,555 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:59,556 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-12-05 23:23:59,557 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:59,557 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:59,561 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:59,562 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-12-05 23:23:59,564 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:59,564 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2022-12-05 23:23:59,567 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:59,567 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:08,554 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:08,555 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2022-12-05 23:24:08,557 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:08,557 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2022-12-05 23:24:08,559 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:08,560 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2022-12-05 23:24:08,562 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:08,562 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:08,570 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:08,570 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:08,573 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:08,573 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:08,575 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:08,576 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2022-12-05 23:24:08,578 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:08,578 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:08,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, 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_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} 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 [640] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse13 (select |v_#pthreadsMutex_388| v_my_callbackThread1of1ForFork0_~data~0.base_388))) (let ((.cse1 (store |v_#pthreadsMutex_388| v_my_callbackThread1of1ForFork0_~data~0.base_388 (store .cse13 v_my_callbackThread1of1ForFork0_~data~0.offset_388 0)))) (let ((.cse2 (select .cse1 v_my_callbackThread1of1ForFork1_~data~0.base_431)) (.cse5 (select |v_#memory_$Pointer$.offset_1300| v_my_callbackThread1of1ForFork0_~data~0.base_388)) (.cse4 (select |v_#memory_$Pointer$.offset_1302| v_my_callbackThread1of1ForFork1_~data~0.base_431)) (.cse8 (select |v_#memory_$Pointer$.base_1300| v_my_callbackThread1of1ForFork0_~data~0.base_388)) (.cse9 (select |v_#memory_$Pointer$.base_1302| v_my_callbackThread1of1ForFork1_~data~0.base_431)) (.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_451 24)) (.cse7 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_451 28)) (.cse3 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_388 24)) (.cse6 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_388 28))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_67 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_65) (= v_my_callbackThread1of1ForFork0_~dev~0.base_67 v_my_callbackThread1of1ForFork0_~__mptr~0.base_65) (= |v_my_callbackThread1of1ForFork0_#res.base_55| 0) (= .cse0 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_63) (= v_my_callbackThread1of1ForFork0_~arg.offset_67 v_my_callbackThread1of1ForFork0_~dev~0.offset_67) (= |v_my_callbackThread1of1ForFork1_#res.offset_37| 0) (= (store .cse1 v_my_callbackThread1of1ForFork1_~data~0.base_431 (store .cse2 v_my_callbackThread1of1ForFork1_~data~0.offset_451 0)) |v_#pthreadsMutex_386|) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_65 .cse3) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_156| v_my_callbackThread1of1ForFork0_~arg.base_67) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_51 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_63) (= v_my_callbackThread1of1ForFork1_~dev~0.base_51 v_my_callbackThread1of1ForFork1_~__mptr~0.base_63) (= |v_#memory_$Pointer$.offset_1302| (store |v_#memory_$Pointer$.offset_1301| v_my_callbackThread1of1ForFork1_~data~0.base_431 (store (select |v_#memory_$Pointer$.offset_1301| v_my_callbackThread1of1ForFork1_~data~0.base_431) .cse0 (select .cse4 .cse0)))) (= (store |v_#memory_$Pointer$.offset_1303| v_my_callbackThread1of1ForFork0_~data~0.base_388 (store (select |v_#memory_$Pointer$.offset_1303| v_my_callbackThread1of1ForFork0_~data~0.base_388) .cse3 (select .cse5 .cse3))) |v_#memory_$Pointer$.offset_1300|) (= v_my_callbackThread1of1ForFork1_~arg.base_49 |v_my_callbackThread1of1ForFork1_#in~arg.base_117|) (= (select .cse2 v_my_callbackThread1of1ForFork1_~data~0.offset_451) 0) (= v_my_callbackThread1of1ForFork0_~data~0.base_388 v_my_callbackThread1of1ForFork0_~__mptr~0.base_65) (= (store |v_#memory_$Pointer$.offset_1300| v_my_callbackThread1of1ForFork0_~data~0.base_388 (store .cse5 .cse6 (select (select |v_#memory_$Pointer$.offset_1301| v_my_callbackThread1of1ForFork0_~data~0.base_388) .cse6))) |v_#memory_$Pointer$.offset_1301|) (= (store |v_#memory_$Pointer$.offset_1302| v_my_callbackThread1of1ForFork1_~data~0.base_431 (store .cse4 .cse7 (select (select |v_#memory_$Pointer$.offset_1299| v_my_callbackThread1of1ForFork1_~data~0.base_431) .cse7))) |v_#memory_$Pointer$.offset_1299|) (= v_my_callbackThread1of1ForFork1_~arg.offset_49 |v_my_callbackThread1of1ForFork1_#in~arg.offset_149|) (= |v_my_callbackThread1of1ForFork0_#res.offset_55| 0) (= v_my_callbackThread1of1ForFork0_~arg.offset_67 |v_my_callbackThread1of1ForFork0_#in~arg.offset_156|) (= v_my_callbackThread1of1ForFork1_~arg.offset_49 v_my_callbackThread1of1ForFork1_~dev~0.offset_51) (= |v_my_callbackThread1of1ForFork1_#res.base_37| 0) (= (store |v_#memory_$Pointer$.base_1300| v_my_callbackThread1of1ForFork0_~data~0.base_388 (store .cse8 .cse6 (select (select |v_#memory_$Pointer$.base_1301| v_my_callbackThread1of1ForFork0_~data~0.base_388) .cse6))) |v_#memory_$Pointer$.base_1301|) (= |v_#memory_$Pointer$.base_1300| (store |v_#memory_$Pointer$.base_1303| v_my_callbackThread1of1ForFork0_~data~0.base_388 (store (select |v_#memory_$Pointer$.base_1303| v_my_callbackThread1of1ForFork0_~data~0.base_388) .cse3 (select .cse8 .cse3)))) (= (store |v_#memory_$Pointer$.base_1301| v_my_callbackThread1of1ForFork1_~data~0.base_431 (store (select |v_#memory_$Pointer$.base_1301| v_my_callbackThread1of1ForFork1_~data~0.base_431) .cse0 (select .cse9 .cse0))) |v_#memory_$Pointer$.base_1302|) (= v_my_callbackThread1of1ForFork1_~dev~0.base_51 v_my_callbackThread1of1ForFork1_~arg.base_49) (= |v_#memory_$Pointer$.base_1299| (store |v_#memory_$Pointer$.base_1302| v_my_callbackThread1of1ForFork1_~data~0.base_431 (store .cse9 .cse7 (select (select |v_#memory_$Pointer$.base_1299| v_my_callbackThread1of1ForFork1_~data~0.base_431) .cse7)))) (= (let ((.cse10 (store |v_#memory_int_1364| v_my_callbackThread1of1ForFork0_~data~0.base_388 (let ((.cse12 (select |v_#memory_int_1364| v_my_callbackThread1of1ForFork0_~data~0.base_388))) (store (store .cse12 .cse3 1) .cse6 (+ (select .cse12 .cse6) 1)))))) (store .cse10 v_my_callbackThread1of1ForFork1_~data~0.base_431 (let ((.cse11 (select .cse10 v_my_callbackThread1of1ForFork1_~data~0.base_431))) (store (store .cse11 .cse0 1) .cse7 (+ (select .cse11 .cse7) 1))))) |v_#memory_int_1362|) (= 0 (select .cse13 v_my_callbackThread1of1ForFork0_~data~0.offset_388)) (= v_my_callbackThread1of1ForFork0_~dev~0.base_67 v_my_callbackThread1of1ForFork0_~arg.base_67) (= v_my_callbackThread1of1ForFork1_~data~0.base_431 v_my_callbackThread1of1ForFork1_~__mptr~0.base_63))))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_117|, #pthreadsMutex=|v_#pthreadsMutex_388|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_156|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1303|, #memory_int=|v_#memory_int_1364|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_156|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1303|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_149|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1299|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_156|, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_63, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_71|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_65, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_170|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_388, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_149|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_451, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_37|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_388, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_55|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_37|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_55|, my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_288|, #pthreadsMutex=|v_#pthreadsMutex_386|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_297|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_67, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_49, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_117|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_431, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_49, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_156|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_67, #memory_int=|v_#memory_int_1362|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_63, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_65, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_51, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_67, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_51, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_67, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1299|} AuxVars[|v_#memory_$Pointer$.offset_1302|, |v_#memory_$Pointer$.base_1302|, |v_#memory_$Pointer$.base_1301|, |v_#memory_$Pointer$.offset_1301|, |v_#memory_$Pointer$.base_1300|, |v_#memory_$Pointer$.offset_1300|] AssignedVars[#memory_$Pointer$.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_#res.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork1_#res.offset, my_callbackThread1of1ForFork0_#res.offset, my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork1_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-05 23:24:20,318 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:24:20,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22515 [2022-12-05 23:24:20,319 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 12 transitions, 68 flow [2022-12-05 23:24:20,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-05 23:24:20,319 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:24:20,319 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:24:20,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-05 23:24:20,320 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:24:20,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:24:20,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1655116602, now seen corresponding path program 1 times [2022-12-05 23:24:20,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:24:20,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943052062] [2022-12-05 23:24:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:24:20,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:24:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:24:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:24:20,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:24:20,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943052062] [2022-12-05 23:24:20,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943052062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:24:20,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:24:20,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:24:20,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68248121] [2022-12-05 23:24:20,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:24:20,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:24:20,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:24:20,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:24:20,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:24:20,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 12 [2022-12-05 23:24:20,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 12 transitions, 68 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-05 23:24:20,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:24:20,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 12 [2022-12-05 23:24:20,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:24:20,761 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-05 23:24:20,761 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 23:24:20,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 11 events. 0/11 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/11 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-12-05 23:24:20,761 INFO L137 encePairwiseOnDemand]: 7/12 looper letters, 5 selfloop transitions, 4 changer transitions 2/11 dead transitions. [2022-12-05 23:24:20,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 11 transitions, 85 flow [2022-12-05 23:24:20,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:24:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:24:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-12-05 23:24:20,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2 [2022-12-05 23:24:20,762 INFO L175 Difference]: Start difference. First operand has 29 places, 12 transitions, 68 flow. Second operand 5 states and 12 transitions. [2022-12-05 23:24:20,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 11 transitions, 85 flow [2022-12-05 23:24:20,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 11 transitions, 52 flow, removed 3 selfloop flow, removed 12 redundant places. [2022-12-05 23:24:20,762 INFO L231 Difference]: Finished difference. Result has 20 places, 9 transitions, 30 flow [2022-12-05 23:24:20,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=30, PETRI_PLACES=20, PETRI_TRANSITIONS=9} [2022-12-05 23:24:20,765 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -19 predicate places. [2022-12-05 23:24:20,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:24:20,765 INFO L89 Accepts]: Start accepts. Operand has 20 places, 9 transitions, 30 flow [2022-12-05 23:24:20,765 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:24:20,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:24:20,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 9 transitions, 30 flow [2022-12-05 23:24:20,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 9 transitions, 30 flow [2022-12-05 23:24:20,768 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-05 23:24:20,768 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:24:20,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 conditions, 9 events. 0/9 cut-off events. For 1/1 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/9 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:24:20,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 16 places, 9 transitions, 30 flow [2022-12-05 23:24:20,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:24:20,775 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} 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 [641] L1727-4-->my_callbackEXIT: Formula: (let ((.cse13 (select |v_#pthreadsMutex_393| v_my_callbackThread1of1ForFork0_~data~0.base_390))) (let ((.cse2 (store |v_#pthreadsMutex_393| v_my_callbackThread1of1ForFork0_~data~0.base_390 (store .cse13 v_my_callbackThread1of1ForFork0_~data~0.offset_390 0)))) (let ((.cse5 (select |v_#memory_$Pointer$.base_1314| v_my_callbackThread1of1ForFork1_~data~0.base_433)) (.cse3 (select .cse2 v_my_callbackThread1of1ForFork1_~data~0.base_433)) (.cse4 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_453 24)) (.cse8 (select |v_#memory_$Pointer$.base_1316| v_my_callbackThread1of1ForFork0_~data~0.base_390)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_390 28)) (.cse6 (select |v_#memory_$Pointer$.offset_1314| v_my_callbackThread1of1ForFork1_~data~0.base_433)) (.cse9 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_453 28)) (.cse0 (select |v_#memory_$Pointer$.offset_1316| v_my_callbackThread1of1ForFork0_~data~0.base_390)) (.cse7 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_390 24))) (and (= (select |v_#valid_547| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_308|) 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_185| 0) (= |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_153| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_151|) (= v_my_callbackThread1of1ForFork1_~arg.base_51 |v_my_callbackThread1of1ForFork1_#in~arg.base_119|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_69 v_my_callbackThread1of1ForFork0_~__mptr~0.base_67) (= v_my_callbackThread1of1ForFork1_~data~0.base_433 v_my_callbackThread1of1ForFork1_~__mptr~0.base_65) (= v_my_callbackThread1of1ForFork0_~dev~0.base_69 v_my_callbackThread1of1ForFork0_~arg.base_69) (= v_my_callbackThread1of1ForFork0_~arg.offset_69 v_my_callbackThread1of1ForFork0_~dev~0.offset_69) (= v_my_callbackThread1of1ForFork1_~arg.offset_51 v_my_callbackThread1of1ForFork1_~dev~0.offset_53) (= (store |v_#memory_$Pointer$.offset_1316| v_my_callbackThread1of1ForFork0_~data~0.base_390 (store .cse0 .cse1 (select (select |v_#memory_$Pointer$.offset_1315| v_my_callbackThread1of1ForFork0_~data~0.base_390) .cse1))) |v_#memory_$Pointer$.offset_1315|) (= (store .cse2 v_my_callbackThread1of1ForFork1_~data~0.base_433 (store .cse3 v_my_callbackThread1of1ForFork1_~data~0.offset_453 0)) |v_#pthreadsMutex_392|) (= (store |v_#memory_$Pointer$.base_1315| v_my_callbackThread1of1ForFork1_~data~0.base_433 (store (select |v_#memory_$Pointer$.base_1315| v_my_callbackThread1of1ForFork1_~data~0.base_433) .cse4 (select .cse5 .cse4))) |v_#memory_$Pointer$.base_1314|) (= |v_#memory_$Pointer$.offset_1314| (store |v_#memory_$Pointer$.offset_1315| v_my_callbackThread1of1ForFork1_~data~0.base_433 (store (select |v_#memory_$Pointer$.offset_1315| v_my_callbackThread1of1ForFork1_~data~0.base_433) .cse4 (select .cse6 .cse4)))) (< |v_#StackHeapBarrier_180| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_308|) (= v_my_callbackThread1of1ForFork0_~arg.offset_69 |v_my_callbackThread1of1ForFork0_#in~arg.offset_158|) (= (store |v_#memory_$Pointer$.base_1313| v_my_callbackThread1of1ForFork0_~data~0.base_390 (store (select |v_#memory_$Pointer$.base_1313| v_my_callbackThread1of1ForFork0_~data~0.base_390) .cse7 (select .cse8 .cse7))) |v_#memory_$Pointer$.base_1316|) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_158| v_my_callbackThread1of1ForFork0_~arg.base_69) (= |v_my_callbackThread1of1ForFork1_#res.offset_39| 0) (= v_my_callbackThread1of1ForFork1_~dev~0.base_53 v_my_callbackThread1of1ForFork1_~arg.base_51) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_308| 0)) (= v_my_callbackThread1of1ForFork0_~data~0.base_390 v_my_callbackThread1of1ForFork0_~__mptr~0.base_67) (= (store |v_#memory_$Pointer$.base_1314| v_my_callbackThread1of1ForFork1_~data~0.base_433 (store .cse5 .cse9 (select (select |v_#memory_$Pointer$.base_1312| v_my_callbackThread1of1ForFork1_~data~0.base_433) .cse9))) |v_#memory_$Pointer$.base_1312|) (= (select .cse3 v_my_callbackThread1of1ForFork1_~data~0.offset_453) 0) (= v_my_callbackThread1of1ForFork1_~arg.offset_51 |v_my_callbackThread1of1ForFork1_#in~arg.offset_151|) (= |v_#valid_546| (store |v_#valid_547| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_308| 1)) (= v_my_callbackThread1of1ForFork1_~dev~0.base_53 v_my_callbackThread1of1ForFork1_~__mptr~0.base_65) (= |v_my_callbackThread1of1ForFork0_#res.base_57| 0) (= |v_ULTIMATE.start_main_~#data~1#1.base_451| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_151|) (= (let ((.cse10 (store |v_#memory_int_1369| v_my_callbackThread1of1ForFork0_~data~0.base_390 (let ((.cse12 (select |v_#memory_int_1369| v_my_callbackThread1of1ForFork0_~data~0.base_390))) (store (store .cse12 .cse7 1) .cse1 (+ (select .cse12 .cse1) 1)))))) (store .cse10 v_my_callbackThread1of1ForFork1_~data~0.base_433 (let ((.cse11 (select .cse10 v_my_callbackThread1of1ForFork1_~data~0.base_433))) (store (store .cse11 .cse4 1) .cse9 (+ (select .cse11 .cse9) 1))))) |v_#memory_int_1368|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_211| (select (select |v_#memory_int_1369| |v_~#t1~0.base_195|) |v_~#t1~0.offset_183|)) (= (store |v_#length_370| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_308| 4) |v_#length_369|) (= |v_my_callbackThread1of1ForFork0_#res.offset_57| 0) (= .cse7 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_67) (= v_my_callbackThread1of1ForFork1_~__mptr~0.offset_65 .cse4) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_69 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_67) (= |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_153| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_151|) (= |v_#memory_$Pointer$.base_1315| (store |v_#memory_$Pointer$.base_1316| v_my_callbackThread1of1ForFork0_~data~0.base_390 (store .cse8 .cse1 (select (select |v_#memory_$Pointer$.base_1315| v_my_callbackThread1of1ForFork0_~data~0.base_390) .cse1)))) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_53 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_65) (= |v_ULTIMATE.start_main_~#data~1#1.offset_451| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_151|) (= (store |v_#memory_$Pointer$.offset_1314| v_my_callbackThread1of1ForFork1_~data~0.base_433 (store .cse6 .cse9 (select (select |v_#memory_$Pointer$.offset_1312| v_my_callbackThread1of1ForFork1_~data~0.base_433) .cse9))) |v_#memory_$Pointer$.offset_1312|) (= (store |v_#memory_$Pointer$.offset_1313| v_my_callbackThread1of1ForFork0_~data~0.base_390 (store (select |v_#memory_$Pointer$.offset_1313| v_my_callbackThread1of1ForFork0_~data~0.base_390) .cse7 (select .cse0 .cse7))) |v_#memory_$Pointer$.offset_1316|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_272| 0) (= |v_my_callbackThread1of1ForFork1_#res.base_39| 0) (= (select .cse13 v_my_callbackThread1of1ForFork0_~data~0.offset_390) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_234| 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_393|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1313|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_158|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_451|, ~#t1~0.offset=|v_~#t1~0.offset_183|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_151|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_119|, #StackHeapBarrier=|v_#StackHeapBarrier_180|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_158|, ~#t1~0.base=|v_~#t1~0.base_195|, #valid=|v_#valid_547|, #memory_int=|v_#memory_int_1369|, #length=|v_#length_370|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1313|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_451|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1312|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_158|, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_65, ~#t1~0.offset=|v_~#t1~0.offset_183|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_67, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_390, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_153|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_151|, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_39|, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_57|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_220|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_234|, #length=|v_#length_369|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_151|, #pthreadsMutex=|v_#pthreadsMutex_392|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_242|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_221|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_119|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_433, #StackHeapBarrier=|v_#StackHeapBarrier_180|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_158|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_151|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_212|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_65, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_67, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_69, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_53, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1312|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_211|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_308|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_212|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_73|, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_172|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_216|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_453, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_390, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_185|, ~#t1~0.base=|v_~#t1~0.base_195|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_242|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_167|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_39|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_57|, my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_290|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_301|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_153|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_69, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_51, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_451|, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_51, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_272|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_69, #valid=|v_#valid_546|, #memory_int=|v_#memory_int_1368|, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_53, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_69, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_451|} AuxVars[|v_#memory_$Pointer$.offset_1315|, |v_#memory_$Pointer$.offset_1314|, |v_#memory_$Pointer$.base_1316|, |v_#memory_$Pointer$.offset_1316|, |v_#memory_$Pointer$.base_1315|, |v_#memory_$Pointer$.base_1314|] 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_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork1_#t~nondet31, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_#res.base, 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_callbackThread1of1ForFork1_#res.offset, my_callbackThread1of1ForFork0_#res.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, my_callbackThread1of1ForFork0_#t~mem32, ULTIMATE.start_my_drv_disconnect_~data#1.offset, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork1_~arg.base, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, my_callbackThread1of1ForFork0_~arg.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #valid, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-05 23:24:28,223 WARN L233 SmtUtils]: Spent 7.45s on a formula simplification that was a NOOP. DAG size: 216 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-05 23:24:35,038 WARN L233 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 210 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-05 23:24:43,143 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 219 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-05 23:24:50,789 WARN L233 SmtUtils]: Spent 7.64s on a formula simplification that was a NOOP. DAG size: 213 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-05 23:24:50,791 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:24:50,791 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30026 [2022-12-05 23:24:50,791 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 10 transitions, 39 flow [2022-12-05 23:24:50,792 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-05 23:24:50,792 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:24:50,792 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:24:50,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-05 23:24:50,792 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:24:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:24:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1655116590, now seen corresponding path program 1 times [2022-12-05 23:24:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:24:50,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251298030] [2022-12-05 23:24:50,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:24:50,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:24:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:24:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:24:51,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:24:51,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251298030] [2022-12-05 23:24:51,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251298030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:24:51,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:24:51,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:24:51,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243179065] [2022-12-05 23:24:51,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:24:51,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:24:51,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:24:51,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:24:51,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:24:51,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 10 [2022-12-05 23:24:51,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 10 transitions, 39 flow. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:51,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:24:51,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 10 [2022-12-05 23:24:51,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:24:51,630 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-05 23:24:51,631 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:24:51,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 8 events. 0/8 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 1/9 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-05 23:24:51,631 INFO L137 encePairwiseOnDemand]: 5/10 looper letters, 0 selfloop transitions, 0 changer transitions 8/8 dead transitions. [2022-12-05 23:24:51,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 8 transitions, 41 flow [2022-12-05 23:24:51,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:24:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:24:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2022-12-05 23:24:51,632 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15 [2022-12-05 23:24:51,632 INFO L175 Difference]: Start difference. First operand has 17 places, 10 transitions, 39 flow. Second operand 6 states and 9 transitions. [2022-12-05 23:24:51,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 8 transitions, 41 flow [2022-12-05 23:24:51,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 8 transitions, 34 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:24:51,632 INFO L231 Difference]: Finished difference. Result has 16 places, 0 transitions, 0 flow [2022-12-05 23:24:51,632 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=10, PETRI_DIFFERENCE_MINUEND_FLOW=18, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=16, PETRI_TRANSITIONS=0} [2022-12-05 23:24:51,632 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -23 predicate places. [2022-12-05 23:24:51,633 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:24:51,633 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 16 places, 0 transitions, 0 flow [2022-12-05 23:24:51,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:24:51,633 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:24:51,633 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:24:51,633 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-05 23:24:51,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:24:51,633 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:24:51,633 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:24:51,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-05 23:24:51,634 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:24:51,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:51,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-05 23:24:51,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-05 23:24:51,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-05 23:24:51,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-12-05 23:24:51,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-12-05 23:24:51,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-12-05 23:24:51,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-12-05 23:24:51,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-12-05 23:24:51,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-05 23:24:51,637 INFO L458 BasicCegarLoop]: Path program histogram: [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:24:51,639 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:24:51,639 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:24:51,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:24:51 BasicIcfg [2022-12-05 23:24:51,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:24:51,641 INFO L158 Benchmark]: Toolchain (without parser) took 146494.50ms. Allocated memory was 186.6MB in the beginning and 719.3MB in the end (delta: 532.7MB). Free memory was 148.0MB in the beginning and 452.6MB in the end (delta: -304.6MB). Peak memory consumption was 229.1MB. Max. memory is 8.0GB. [2022-12-05 23:24:51,641 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 186.6MB. Free memory is still 163.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:24:51,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.22ms. Allocated memory is still 186.6MB. Free memory was 147.5MB in the beginning and 91.4MB in the end (delta: 56.1MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. [2022-12-05 23:24:51,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.19ms. Allocated memory is still 186.6MB. Free memory was 91.4MB in the beginning and 88.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:24:51,642 INFO L158 Benchmark]: Boogie Preprocessor took 26.74ms. Allocated memory is still 186.6MB. Free memory was 88.2MB in the beginning and 85.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:24:51,644 INFO L158 Benchmark]: RCFGBuilder took 588.60ms. Allocated memory is still 186.6MB. Free memory was 85.1MB in the beginning and 160.3MB in the end (delta: -75.2MB). Peak memory consumption was 30.9MB. Max. memory is 8.0GB. [2022-12-05 23:24:51,644 INFO L158 Benchmark]: TraceAbstraction took 145119.72ms. Allocated memory was 186.6MB in the beginning and 719.3MB in the end (delta: 532.7MB). Free memory was 159.6MB in the beginning and 452.6MB in the end (delta: -293.0MB). Peak memory consumption was 239.1MB. Max. memory is 8.0GB. [2022-12-05 23:24:51,645 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.39ms. Allocated memory is still 186.6MB. Free memory is still 163.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 688.22ms. Allocated memory is still 186.6MB. Free memory was 147.5MB in the beginning and 91.4MB in the end (delta: 56.1MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.19ms. Allocated memory is still 186.6MB. Free memory was 91.4MB in the beginning and 88.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.74ms. Allocated memory is still 186.6MB. Free memory was 88.2MB in the beginning and 85.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 588.60ms. Allocated memory is still 186.6MB. Free memory was 85.1MB in the beginning and 160.3MB in the end (delta: -75.2MB). Peak memory consumption was 30.9MB. Max. memory is 8.0GB. * TraceAbstraction took 145119.72ms. Allocated memory was 186.6MB in the beginning and 719.3MB in the end (delta: 532.7MB). Free memory was 159.6MB in the beginning and 452.6MB in the end (delta: -293.0MB). Peak memory consumption was 239.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.2s, 162 PlacesBefore, 39 PlacesAfterwards, 162 TransitionsBefore, 35 TransitionsAfterwards, 2604 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 76 TrivialYvCompositions, 50 ConcurrentYvCompositions, 4 ChoiceCompositions, 132 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1835, independent: 1744, independent conditional: 1744, independent unconditional: 0, dependent: 81, dependent conditional: 81, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1835, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1835, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1835, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1512, independent: 1475, independent conditional: 0, independent unconditional: 1475, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1512, independent: 1472, independent conditional: 0, independent unconditional: 1472, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15413, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 266, dependent conditional: 0, dependent unconditional: 266, unknown: 15140, unknown conditional: 0, unknown unconditional: 15140] ], Cache Queries: [ total: 1835, independent: 269, independent conditional: 0, independent unconditional: 269, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 1515, unknown conditional: 0, unknown unconditional: 1515] , Statistics on independence cache: Total cache size (in pairs): 2485, Positive cache size: 2455, Positive conditional cache size: 0, Positive unconditional cache size: 2455, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, 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: 2.4s, 33 PlacesBefore, 32 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 144, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 144, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 144, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 67, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2262, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] ], Cache Queries: [ total: 144, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 68, unknown conditional: 0, unknown unconditional: 68] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 35 PlacesBefore, 35 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 105, independent: 85, independent conditional: 8, independent unconditional: 77, dependent: 15, dependent conditional: 3, dependent unconditional: 12, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 105, independent: 85, independent conditional: 8, independent unconditional: 77, dependent: 15, dependent conditional: 3, dependent unconditional: 12, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 105, independent: 85, independent conditional: 8, independent unconditional: 77, dependent: 15, dependent conditional: 3, dependent unconditional: 12, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4410, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 4332, unknown conditional: 4332, unknown unconditional: 0] ], Cache Queries: [ total: 105, independent: 78, independent conditional: 8, independent unconditional: 70, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 15, unknown conditional: 7, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 3, Unknown conditional cache size: 2, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 36 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 648, independent: 557, independent conditional: 557, independent unconditional: 0, dependent: 88, dependent conditional: 88, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 648, independent: 557, independent conditional: 60, independent unconditional: 497, dependent: 88, dependent conditional: 18, dependent unconditional: 70, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 666, independent: 557, independent conditional: 60, independent unconditional: 497, dependent: 106, dependent conditional: 36, dependent unconditional: 70, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 666, independent: 557, independent conditional: 60, independent unconditional: 497, dependent: 106, dependent conditional: 36, dependent unconditional: 70, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, independent: 32, independent conditional: 2, independent unconditional: 30, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 40, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 12, dependent conditional: 9, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 666, independent: 525, independent conditional: 58, independent unconditional: 467, dependent: 98, dependent conditional: 30, dependent unconditional: 68, unknown: 43, unknown conditional: 8, unknown unconditional: 35] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 98, Positive conditional cache size: 2, Positive unconditional cache size: 96, Negative cache size: 32, Negative conditional cache size: 9, Negative unconditional cache size: 23, Unknown cache size: 3, Unknown conditional cache size: 2, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 26, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 100, Positive conditional cache size: 2, Positive unconditional cache size: 98, Negative cache size: 33, Negative conditional cache size: 9, Negative unconditional cache size: 24, Unknown cache size: 3, Unknown conditional cache size: 2, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 31 PlacesBefore, 30 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6499, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 6334, unknown conditional: 0, unknown unconditional: 6334] ], Cache Queries: [ total: 33, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 14, unknown conditional: 4, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 107, Positive conditional cache size: 6, Positive unconditional cache size: 101, Negative cache size: 36, Negative conditional cache size: 9, Negative unconditional cache size: 27, Unknown cache size: 6, Unknown conditional cache size: 2, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 9, dependent conditional: 4, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 9, dependent conditional: 4, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 9, dependent conditional: 4, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 96, independent: 87, independent conditional: 87, independent unconditional: 0, dependent: 9, dependent conditional: 8, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 112, Positive conditional cache size: 10, Positive unconditional cache size: 102, Negative cache size: 39, Negative conditional cache size: 11, Negative unconditional cache size: 28, Unknown cache size: 6, Unknown conditional cache size: 2, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 52 PlacesBefore, 51 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 40, dependent conditional: 14, dependent unconditional: 26, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 40, dependent conditional: 14, dependent unconditional: 26, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 40, dependent conditional: 14, dependent unconditional: 26, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2337, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 93, dependent conditional: 90, dependent unconditional: 3, unknown: 2163, unknown conditional: 2163, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 35, dependent conditional: 11, dependent unconditional: 24, unknown: 14, unknown conditional: 12, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 125, Positive conditional cache size: 17, Positive unconditional cache size: 108, Negative cache size: 44, Negative conditional cache size: 14, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 17, dependent conditional: 14, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 17, dependent conditional: 14, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 17, dependent conditional: 14, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 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: 26, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 15, dependent conditional: 12, dependent unconditional: 3, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 127, Positive conditional cache size: 17, Positive unconditional cache size: 110, Negative cache size: 46, Negative conditional cache size: 16, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 27, independent conditional: 14, independent unconditional: 13, dependent: 18, dependent conditional: 15, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 27, independent conditional: 14, independent unconditional: 13, dependent: 22, dependent conditional: 19, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 27, independent conditional: 14, independent unconditional: 13, dependent: 22, dependent conditional: 19, dependent unconditional: 3, 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: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 27, independent conditional: 14, independent unconditional: 13, dependent: 20, dependent conditional: 17, dependent unconditional: 3, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 127, Positive conditional cache size: 17, Positive unconditional cache size: 110, Negative cache size: 48, Negative conditional cache size: 18, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 71 PlacesBefore, 71 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 22, independent conditional: 18, independent unconditional: 4, dependent: 16, dependent conditional: 12, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 22, independent conditional: 18, independent unconditional: 4, dependent: 21, dependent conditional: 17, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 22, independent conditional: 18, independent unconditional: 4, dependent: 21, dependent conditional: 17, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 15, dependent conditional: 11, dependent unconditional: 4, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 135, Positive conditional cache size: 21, Positive unconditional cache size: 114, Negative cache size: 54, Negative conditional cache size: 24, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 82 PlacesBefore, 81 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 7, independent unconditional: 8, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 15, independent conditional: 7, independent unconditional: 8, dependent: 12, dependent conditional: 8, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 15, independent conditional: 7, independent unconditional: 8, dependent: 12, dependent conditional: 8, dependent unconditional: 4, 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: 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] ], Cache Queries: [ total: 27, independent: 15, independent conditional: 7, independent unconditional: 8, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 135, Positive conditional cache size: 21, Positive unconditional cache size: 114, Negative cache size: 55, Negative conditional cache size: 25, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 82 PlacesBefore, 83 PlacesAfterwards, 70 TransitionsBefore, 71 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 154, independent conditional: 154, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 210, independent: 154, independent conditional: 96, independent unconditional: 58, dependent: 56, dependent conditional: 18, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 212, independent: 154, independent conditional: 96, independent unconditional: 58, dependent: 58, dependent conditional: 20, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 212, independent: 154, independent conditional: 96, independent unconditional: 58, dependent: 58, dependent conditional: 20, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 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: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 212, independent: 149, independent conditional: 92, independent unconditional: 57, dependent: 56, dependent conditional: 18, dependent unconditional: 38, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 140, Positive conditional cache size: 25, Positive unconditional cache size: 115, Negative cache size: 57, Negative conditional cache size: 27, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 84 PlacesBefore, 83 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 21, independent conditional: 11, independent unconditional: 10, dependent: 45, dependent conditional: 9, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 21, independent conditional: 11, independent unconditional: 10, dependent: 47, dependent conditional: 11, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 21, independent conditional: 11, independent unconditional: 10, dependent: 47, dependent conditional: 11, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 108, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 20, independent conditional: 10, independent unconditional: 10, dependent: 45, dependent conditional: 9, dependent unconditional: 36, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 143, Positive conditional cache size: 26, Positive unconditional cache size: 117, Negative cache size: 59, Negative conditional cache size: 29, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 86 PlacesBefore, 85 PlacesAfterwards, 68 TransitionsBefore, 67 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 43, independent conditional: 29, independent unconditional: 14, dependent: 16, dependent conditional: 12, dependent unconditional: 4, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 43, independent conditional: 29, independent unconditional: 14, dependent: 16, dependent conditional: 12, dependent unconditional: 4, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 43, independent conditional: 29, independent unconditional: 14, dependent: 16, dependent conditional: 12, dependent unconditional: 4, unknown: 2, unknown conditional: 2, 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: 61, independent: 42, independent conditional: 28, independent unconditional: 14, dependent: 16, dependent conditional: 12, dependent unconditional: 4, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 161, Positive conditional cache size: 30, Positive unconditional cache size: 131, Negative cache size: 59, Negative conditional cache size: 29, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 81 PlacesBefore, 81 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 73, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 51, dependent conditional: 21, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 51, dependent conditional: 21, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 51, dependent conditional: 21, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 126, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 73, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 51, dependent conditional: 21, dependent unconditional: 30, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 164, Positive conditional cache size: 32, Positive unconditional cache size: 132, Negative cache size: 59, Negative conditional cache size: 29, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 164, Positive conditional cache size: 32, Positive unconditional cache size: 132, Negative cache size: 59, Negative conditional cache size: 29, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 78 PlacesBefore, 78 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 24, dependent conditional: 9, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 30, dependent conditional: 15, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 30, dependent conditional: 15, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 178, independent: 166, independent conditional: 166, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 27, dependent conditional: 12, dependent unconditional: 15, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 166, Positive conditional cache size: 34, Positive unconditional cache size: 132, Negative cache size: 62, Negative conditional cache size: 32, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 84 PlacesBefore, 84 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 169, Positive conditional cache size: 34, Positive unconditional cache size: 135, Negative cache size: 65, Negative conditional cache size: 35, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 90 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 21, independent conditional: 10, independent unconditional: 11, dependent: 28, dependent conditional: 8, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 21, independent conditional: 10, independent unconditional: 11, dependent: 36, dependent conditional: 16, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 21, independent conditional: 10, independent unconditional: 11, dependent: 36, dependent conditional: 16, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 20, independent conditional: 9, independent unconditional: 11, dependent: 34, dependent conditional: 14, dependent unconditional: 20, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 170, Positive conditional cache size: 35, Positive unconditional cache size: 135, Negative cache size: 67, Negative conditional cache size: 37, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 95 PlacesBefore, 93 PlacesAfterwards, 75 TransitionsBefore, 74 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 175, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 165, dependent conditional: 165, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 175, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 165, dependent conditional: 165, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 175, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 156, dependent conditional: 156, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 172, Positive conditional cache size: 35, Positive unconditional cache size: 137, Negative cache size: 76, Negative conditional cache size: 46, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 70, independent: 42, independent conditional: 20, independent unconditional: 22, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 142, independent: 42, independent conditional: 20, independent unconditional: 22, dependent: 100, dependent conditional: 100, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 42, independent conditional: 20, independent unconditional: 22, dependent: 100, dependent conditional: 100, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 142, independent: 41, independent conditional: 20, independent unconditional: 21, dependent: 92, dependent conditional: 92, dependent unconditional: 0, unknown: 9, unknown conditional: 8, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 173, Positive conditional cache size: 35, Positive unconditional cache size: 138, Negative cache size: 84, Negative conditional cache size: 54, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 94 PlacesBefore, 95 PlacesAfterwards, 67 TransitionsBefore, 69 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 136, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 60, dependent conditional: 52, dependent unconditional: 8, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 222, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 146, dependent conditional: 138, dependent unconditional: 8, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 146, dependent conditional: 138, dependent unconditional: 8, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2160, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 2153, unknown conditional: 2153, unknown unconditional: 0] ], Cache Queries: [ total: 222, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 144, dependent conditional: 136, dependent unconditional: 8, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 174, Positive conditional cache size: 36, Positive unconditional cache size: 138, Negative cache size: 86, Negative conditional cache size: 56, Negative unconditional cache size: 30, Unknown cache size: 8, Unknown conditional cache size: 4, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 83 PlacesBefore, 83 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 22, dependent conditional: 20, dependent unconditional: 2, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 56, dependent conditional: 54, dependent unconditional: 2, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 56, dependent conditional: 54, dependent unconditional: 2, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2178, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 2171, unknown conditional: 2171, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 54, dependent conditional: 52, dependent unconditional: 2, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 174, Positive conditional cache size: 36, Positive unconditional cache size: 138, Negative cache size: 88, Negative conditional cache size: 58, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 77 PlacesBefore, 72 PlacesAfterwards, 45 TransitionsBefore, 42 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 86, independent: 31, independent conditional: 7, independent unconditional: 24, dependent: 51, dependent conditional: 47, dependent unconditional: 4, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 31, independent conditional: 7, independent unconditional: 24, dependent: 69, dependent conditional: 65, dependent unconditional: 4, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 31, independent conditional: 7, independent unconditional: 24, dependent: 69, dependent conditional: 65, dependent unconditional: 4, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, 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: 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: 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 30, independent conditional: 6, independent unconditional: 24, dependent: 66, dependent conditional: 62, dependent unconditional: 4, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 182, Positive conditional cache size: 37, Positive unconditional cache size: 145, Negative cache size: 91, Negative conditional cache size: 61, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 47 PlacesBefore, 43 PlacesAfterwards, 29 TransitionsBefore, 25 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 201, Positive conditional cache size: 39, Positive unconditional cache size: 162, Negative cache size: 96, Negative conditional cache size: 66, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ 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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ 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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 201, Positive conditional cache size: 39, Positive unconditional cache size: 162, Negative cache size: 96, Negative conditional cache size: 66, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 40 PlacesBefore, 38 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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): 301, Positive cache size: 205, Positive conditional cache size: 39, Positive unconditional cache size: 166, Negative cache size: 96, Negative conditional cache size: 66, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.5s, 31 PlacesBefore, 29 PlacesAfterwards, 13 TransitionsBefore, 12 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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): 303, Positive cache size: 207, Positive conditional cache size: 39, Positive unconditional cache size: 168, Negative cache size: 96, Negative conditional cache size: 66, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.0s, 16 PlacesBefore, 17 PlacesAfterwards, 9 TransitionsBefore, 10 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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): 303, Positive cache size: 207, Positive conditional cache size: 39, Positive unconditional cache size: 168, Negative cache size: 96, Negative conditional cache size: 66, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, 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): 303, Positive cache size: 207, Positive conditional cache size: 39, Positive unconditional cache size: 168, Negative cache size: 96, Negative conditional cache size: 66, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, 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, 183 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: 145.0s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 817 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 817 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 518 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8519 IncrementalHoareTripleChecker+Invalid, 9037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 518 mSolverCounterUnsat, 52 mSDtfsCounter, 8519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=792occurred in iteration=19, InterpolantAutomatonStates: 282, 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.6s SatisfiabilityAnalysisTime, 20.9s InterpolantComputationTime, 446 NumberOfCodeBlocks, 446 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 416 ConstructedInterpolants, 0 QuantifiedInterpolants, 10041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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-05 23:24:51,720 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...